SelfStudys .

com

Relations and Functions

( Fastracl Revision )
» Let Aand B be two non-empty sets. Then a relation R From » A relation Rin set X satisfying the condition (g, b) € R and
Ato Bis asubset of AxB.le, R is arelation from A to B (b, ©) € R= (g, c) €R for any q, b, ce Xis transitive relation.
< Rc(AxB). » A relation R in set X, which is reflexive, symmetric and
» In set X, the relation R given by R =¢c X x X Is called an
transitive, Is said to be an equivalence relation.
empty relation if no element of Xis related to any element
» Equivalence class [a) containing a € X for an equivalence
of X.
» InsetX, the relationR given by R=(X x X)c(X x X) s called relation R in set X is the subset of set X containing all
a universal relation if each element of Xis related to every elements related to a.
element of X. » Let Aand B be two non-empty sets. Then a relation ffrom A
» IF Aand Bare two non-empty sets and Ris arelation from A to Bls function, if every element in A has aunique Image in
to B,suchthat R ={(q, b): aeA beB}thentheinverse of R,
B and which is denoted by f:A— B.
denoted by R, is a relation from B to 4 and Is defined by
» A function f: X— Yis one-one (or Injective) if
R'={(b,a):(a,b)eR).
» A relation Rin set X for which (a,a)e RVae X, Is reflexive
Flx)=F0x) = X=X VX X eX.

relation. » A function f: X— Yis onto (or surjective) if given any

» Arelation Rinset X which satisfies the condition that(a,b) e R yeY,3xeXsuchthat f(x) =y.
implies (b, a) e Rfor any a,b e X, Is symmetric relation. » Afunction f: X— Yis bijectiveif fis both one-one and onto.
» Arelation Ris sald to be anti-symmetric relation, iff » Given a finite set X, a function f:X—Y Is one-one
(a, b)eRand (b, a)eR (respectively onto) if and only if fis onto (respectively
= a=bforanya,
b eX one-one). This Is the characteristic property of a finite set.
In case a « b, then even if (g, b) e R and (b, a) e R holds, the
This Is not true for infinite set.
relation cannot be antl-symmetric.

& Practice Exercise

Q6. Letset X ={1,2,3}and arelation Ris defined in X
'/ Multlple Choice Questions as R={(1,3), (2,2), (3,2)}, then minimum ordered
pairs which should be added in relation R to make
Q1. Let A={3,5) Then number of reflexive relation it reflexive and symmetric, are: (CBSE 2021 Term-1)
onA is: (CBSE2023)
a.2 b. 4 c.0 d.8
a.((1).(2.3).0.2)) b.{3.3).(31).(12))
C{(L).@E 3B D.(23) d(1L).E3).E.0.2)
Q2. Let R be a relation in the set N given by
R={(a,b):a=b-2, b> 6}, then: 06. Let A={x,y,z}and B = (1, 2}, then the number of
(CBSE2023) relations from A to B is:
a.(8.7)eR b.(6.8) R a.32 b.64 c. 128 d.8
c.(3.8)eR d.(2.4) eR Q7. The relation R defined in A ={1,2,3} by aRb, if
Q3. IfR={(x,y); x,y eZ,xt4y? <4}is arelationin |aZ -b? | 5. Which of the following is false?
set Z, then domain of Ris: (CBSE2021 Yorm-1)
a.{0.1.2) b.{-2.-1.0.1.2}
a.R={(11).(22).33).(21.(.2).(2.3).(3.2))
b.R"'=R
c.{0,-1.-2} d.{-1.0,1}
c.Domain of R ={12,3)
Q4. A relation R in set A={1,2,3} is defined as
d.Range of R = {5)
R={(1,1), (1, 2), (2, 2), (3, 3)}. Which of the
following ordered pair in R shall be removed to 0 8. Arelation in a set Ais called .. «.e relation, if
make it an equivalence relation in A? each element of Ais related to itself.
(CBSESQP 2021 Term-1) a. reflexive b. symmetric
a. (1) b.(1.2) c(2.2) d.(3.3) c. transitive d. None of these

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

Qa. A relation R on a set A is called ... Q1. Let 11 be a fixed positive integer. Let a relation R
(@;,a;)eR and (a;,a5)eR implies that be defined in / (the set of all integers) as follows:
(@ay,a35)eR, thenay,a,,a; €A. aRb iffn| (@ - b), that is, iff a - b is divisible by n.
a. reflexive Then, the relation Ris:
b. symmetric a. reflexive only b. symmetric only
c. transitive only d.an equivalence relation
C transitive
d. None of the above Q2o. For real numbers x and y, we write xRy <
x—y+fi is an irrational number. Then, the
Q10. Total number of equivalence relations defined in
relation R is:
the setS ={a, b, c}is:
a. reflexive b. symmetric
as b.31 c23 d.33 c transitive d. None of these
Qn Let A={1,2,3}. Then number of relations Q21 Let T be the set of all triangles in the Euclidean
containing (1, 2) and (1, 3) which are reflexive plane and let a relation R on T be defined as aRb if
and symmetric but not transitive is: aiscongruenttob Va,b €T.ThenRis:
al b.2 c3 d4 a. reflexive but not transitive
Q12 Let A={1,2,3}). Then number of equivalence b. transitive but not symmetric
relations containing (1, 2) c. equivalence
d. None of the above
al b.2 c3 d4
Q13. Let R be the relation in the set {1, 2, 3, 4} given by Q22 Let R be the relation in the set A of all books in a
library of a college given by R={(x,y): x and y
R={(1,2),2.2),(1,1),(4.4),(1,3),3,3), 3, 2)}-
Choose the correct answer. have same number of pages}. Then, Ris:
a. not reflexive b. not symmetric
a.RIs reflexive and symmetric but not transitive.
c. not transitive d. an equivalence relation
b. R Is reflexive and transitive but not symmetric.
Q2a. Let
S be the set of all points in a plane and R be a
C.RIs symmetric and transltive but not reflexive.
relation on S defined as
d.R s an equivalence relation. R = {(P, Q) :distance between Pand Qis less than 2
Q14 Let A={1,2,3}and R={(1,2), (2, 3)} be a relation units} then, Ris:
in A. Then, the minimum number of ordered pairs a. reflexive but not symmetric
may be added, so that R becomes an equivalence b. symmetric and transitive
relation, is: c reflexive and transitive
d. reflexive and symmetric but not transitive
a7 b.&5 cl d4
Q24 Let X be a family of sets and R be a relation in X
Q16. Letthe relation RinthesetA={xZ:0sx<12},
defined by 'A is disjoint from B’. Then, relation R
given by R={(a,b):la-b| is a multiple of 4}.
is:
Then [1], the equivalence class containing 1, is: a. reflexive b. symmetric
a.{1.5.9) b.{0.1.2.5) c. transitive d. antl-symmetric
cé dA
Q25 If n| mmeans that n is a factor of m, then relation
. Let S be the set of all real numbers. Then, the ‘I'in Z - {0} is:
relation R={(a,b):1+ab >0}onSis: a. reflexive and symmetric
a. reflexive and symmetric but not transitive b. symmetric and transitive
c reflexive. symmetric and transitive
b. reflexive and transitive but not symmetric
d. reflexive. transitive and not symmetric
c symmetric and transitive but not reflexive
d. reflexive. transitive and symmetric Q26. Suppose A={1, 2, 3, ......, 9} and Rbe the relation
on Ax A defined by (a,b) R(c,d) ifa+d =b +c for
Q17 If R and R’ are symmetric relations (not disjoint)
all (a,b), (c,d)eAxA. Then the number of
on a set A, then the relation R N R’ is:
elements in equivalence classrelated to [(2, 5)] is:
a. reflexive b. symmetric
a.6 b.5 c4 d3
c transitive d. None of these
3n).
Q27. If f(x)=|cos x|, then fl = |is:
Q1B. Let Rbe a relation on the set N of natural numbers 4 (CBSE 2023)
denoted by nRm < n is a factor of m (i.e., n| m). 1 1
al b. -1 c— d
Then, Ris: Z Z
a. reflexive and symmetric g28. Let f:R —>R be defined by f(x)=x2 +1.Then,
b. transitive and symmetric pre-images of 17 and -3, respectively, are:
c equivalence a ¢ {4.-4) b.3.-3}¢
d. reflexive. transitive but not symmetric c{4-4)é d.{4.-4}{2.-2)

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

029. Let A={1,2,3},B={4,5,6,7}and let f ={(1, 4), Qas. LetA=R-{3},B=R
- (1}.Let f: A Bbedefined
(2, 5), (3, 6)} be a function from A to B. Based on 2
the given information, fis best defined as:
by f(x)=""2 Then,
x=-3
a. surjective function b. injective function
a.f is bijective
c. bijective function d. function
b. f is one-one but not onto
Q30. A function f:R — Rdefined by f(x)=2+ x? is: c.f is onto but not one-one
a. not cne-one d. None of the above
b. one-one
c.not onto Q4o0. A function f from the set of natural numbers to
d. neither one-one nor onto El,whenn isodd
Qal Let X ={x? : x € N}and the function f:N — X is integers
is defined by f(n)= ’3
defined by f(x)= x2, x e N.Then this function is: -;, when n is even
a.injective only b. not bijective
c. surjective only d. bijective is:
Qaz The function f:R — Rdefined as f(x)= x> is: a. one-one but not onto
a. one-one but not onto b. onto but not one-one
b.not one-one but onto c. one-one and onto both
c. neither one-one nor onto d. neither one-one nor onto
d. one-one and onto
Qaa. Let f:N — Ndefined by f(x)=x?+x+1,x N, -¢) Assertion & Reason Type Questions
then fis:
a. one-one and onto Directions (Q. Nos. 41-48): In the following questions, each
b. many-one and onto question contains Assertion (A) and Reason (R). Each question
c. one-one but not onto has 4 choices (a), (b), (c) and (d) out of which only one is
d. None of the above correct. The choices are:
Qaa. Let f:IZ?—>R be a function defined by a. Both Assertion (A) and Reason (R) are true and
[(x)=xz-8,thenfis: Reason (R) is the correct explanation of
X +2 Assertion (A)
a. one-one but not onto b. Both Assertion (A) and Reason (R) are true but
b. one-one and onto Reason (R) is not the correct explanation of
c. onto but not one-one Assertion (A).
d. neither one-one nor onto c. Assertion (A) is true but Reason (R) Is false
d. Assertlon (A) s false but Reason (R) Is true
Q36. Let f:R — Rbe defined as f(x)=3x.Choose the
correct answer. Qal Assertion (A): The relation R in a set
a.f Is one-one onto A ={1,2,3, 4} defined by R={(x,y):3x -y =0}
b. f is many-one onto have the Domain ={1,2,3, 4}
c. f Is one-one but not onto
d.f Is neither one-one nor onto and Range ={3, 6,9, 12).
Q3s. Let f: R —> Rbe defined as f(x)=x".Choose the Reason (R): Domain and range of the relation (R)
correct answer. is respectively the set of all first and second
a.f Is one-one onto entries of the distinct ordered pair of the relation.
b. f is many-one onto
c. f Is one-one but not onto Q 42. Assertion (A): If R is a relation defined on the set
d.f Is neither one-one nor onto of natural numbers N such that
Qar. LetA={x:~-1<x<1}and f:A— Aisa function R={(x,y): x,y eN and 2x + y =24},then Ris an
defined by f(x)= x| x|, then fis: equivalence relation.
a. a bijection Reason (R): A relation is said to be an equivalence
b. injection but not surjection relation ifit is reflexive, symmetric and transitive.
c. surjection but not Injection
d. neither Injection nor surjection Q43 Assertion (A): If the relation R defined in
Qas. Let £:[0, ) - [0,2] be defined by f(x)=
2x A={1,2,3)byaRb,if|la? -b?| <5,then R =R.
1+x' Reason (R): For above relation, domain of
then fis: R~! =Range of R.
a. one-one but not onto Q4a. Assertion (A): A function y = f(x) defined by
b. onto but not one-one
c. both one-one and onto x?=cot™ y =m,then domain of f(x)=R.
d. neither one-one nor onto Reason (R): cot™? y e (0, n).

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

 Q 45. Assertion (A): A function f:R — R satisfies the Reason (R): Any relation R is an equivalence
equation f(x)-f(y)=x-yVx,yeR and relation, if it is reflexive, symmetric and
transitive.
FB) =2, then f(xy)
= xyi 1. Q 47. Assertion (A): The relation R given by
Reason (R): f(x)= f(—)v xeR x=0 R={(1,3),(4,2),(2,4),@,3),3,1)}
x onaset A={1,2, 3,4} is not symmetric.
and @) =7 i fix) = Xzz +x+1 . Reason (R): For symmetric relation, R=R™™.
3 x“-x+1 Q 48. Assertion (A): The relation f:{1,2,3,4} - {x,y,z,p}
Q 46. Assertion (A): The relation R on the set Nx N, ?::‘;ie:n by f={(L,x)@y)E2)]} is a bijective
defined by (a,b)R.(c,d) c:»'a +d =b +c.for all Reason (R): The function f:{1,2,3)
> {x,,2.p}
(a, b),(c,d) e N x N is an equivalence relation. such that f = {(1, x), (2,), 3,2)} is one-one.
(CBSESQP2023-24)
Answers
1. (b) 2. (o) 3. (b) 4. (b) 5. (c) 6. (b) 7. (d) 8. (a) 9. (¢ 10. ()
11. (a) 12.(0) 13.(0) 14 (a) 15. (a) 16. () 17.(0) 18.(d) 19.(d) 20.(a)
21.(c) 22.(d) 23.(d) 24.(p) 25(d) 26.(@ 27.(d) 28.() 29 () 30.(d)
a1, (d) 32.(d) 33.() 34.(d) 35 () 36.(d) 37.(a) 38 (3) 9. (a) 40.(c)
41. (@) 42.(d) 43 () 44 (d 45.() 46 (a 47. (a) 48. (d)

@/ Case studv Based Questions decides to find the symmetric relation on set B.
© What is difference between their results?
Case Study 1 2.1024 b.2'9(15)
In two different societies, there are some school c2"(3) d.2'%(63)
going sludunls—including girls as well as boy; Q4. Let R:A—>B, R={{a,b,) @;,b,), @ b,),
Satish forn?s two sets with these students, as his (";»b;)v("n 'bz)r("svbz»' then Ris:
college project.
a. neither one-one nor onto
Let A={ay,a,,a5,a,,as} and B={b,,b,,b3,bs} b. one-one but, not onto
where a;’s and b; s are the school going students of c.only onto, but not one-one
first and second society respectively. d. fiat & finctian
Satish decides to explore these sets for various types 5. To help Satishiin his project, Rajat decides to form
of relations and functions. onto function from set A to B. How many such
Based on the above information, solve the following functions are possible?
questions: a.342 b.240
Q1 Satish wishes to know the number of reflexive c.729 d.1024

relations defined on set A. How many such

Solutions ]
relations are possible?
a.0 b.2° 1. Number of reflexive relations defined on a set of n
coN d.220 elements

02 LetR:A-»A,R={(x,y): x and y are students of

=200,
Therefore, number of reflexive relations defined on
same sex}. Then relation Ris:
set A having 5 elements = 25 ** = 220
a. reflexive only
So, option (d) is carrect.
b. reflexive and symmetric but not transitive
2. As(x x)eR for all x e A when x Is elther boy or girl
c. reflexive and transitive but not symmetric
So, Ris reflexive.
d. an equlivalence relation
Let(x y) eR thatls, x and y are of same sex.
ga. Satish and his friend Rajat are interested to know
That means, y and x are also of same sex.
the number of symmetric relations defined on
This implies. (v, x) e R.
both the sets A and B,separately. Satish decides to
find the symmetric relation on set A, while Rajat So. Ris symmetric.

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

 Also let(x. y) eR and (y.2) eR. Based on the given information, solve the following
That means, x andy are of same sex;y and zare same questions:
sex. Clearly, x and z will also be of same sex. That Q1 Let R:B— B be defined by R={(x,y):y is
implies, (x. z) eR.
divisible by x}is:
So.R s transitive. a. reflexive and transitive but not symmetric
Therefore, R Is equivalence relation. b. reflexive and symmetric and not transitive
So, option (d) Is correct. c. not reflexive but symmetric and transitive
3. No. of Symmetric relations defined on a set of n d. equivalence
elements 0 2. Raji wants to know the numberof functions from A
nlns 1
to B.How many number of functions are possible?
=2 2
a.6% b.2¢ c6! d.2"
Therefore, number of symmetric relations defined on
5x6 Q3. Let Rbe a relation on Bdefined by R = {(1, 2), 2,2),
set Ahaving 5elements =272 =2" (1,3),(3,4),(3,1),(4,3),(5, 5)}. Then Ris:
Therefore, number of symmetric relations defined an a. symmetric b. reflexive
5x4 C. transitive d. None of these
set B having 4 elements =2 2 =2"
Q4. Raji wants to know the number of relations
Hence. the required difference Is 2'% - 2" =2'°(3)). possible from A to B. How many numbers of
So. option (c) Is correct. relations are possible?
4. For the element ayeA, we have different images a.6% b.2¢ c6! d. 2%
underR. Q6. LetR: B — Bbedefinedby R=((1,1), (1,2),(2,2),
Note that, we have (ay, by). (ay, b;) eR. (3,3),(4,4), (5, 5), (6, 6)}, then R is:
So.R s not a function. a. symmetric
So. option (d) Is correct. b. reflexive and transitive
5. If A and B are two sets having m and n elements C. transitive and symmetric
respectively such that m 2 n, then total number of d. equivalence
onto functions from set A to set Bls
= I () %€, x(n—rym. Solutions .
r=0
1 R =((11).(2.2).(3.3). (4.4). (5.5).(6.6).(1.2). (1.3).
Here.n(A)=5le.m=5andn(B)=4le.n=4 (1.4).(1.5). (1.6). (2. 4). (2.6). 3. 6)}
So. the number of onto functions from set Ato set 8 Far reflexive, we know that x Is divisible by x for all
4
= T (-l x9C x(4-r)® xeB
r=0 . (x x) eR far all x eR. S0, R s reflexive.
= (=1 x “Cox(4=0) +(=1) x “Cy x (4 -1F + Far symmetry, we observe that 6 Is divisible by 2.
(=12 x4C, x(4 =2 + (-1 x 4Cy x(4 =3P + This means that (2.6) eR but (6.2) «R. So. R Is not
symmetric.
(<1 x4C, x(4-4)
For transitivity, let (x.y) eR and (y.z)eR. then z Is
=1x1x(4f
+ (<) x4 x (3P +1x6 x(2fF +(=-1)
x4 x1
divisible by x.
+1x1x0
= (x.z)eR
=1024 =972 +192 - 4= 240. Far example. 4 is divisible by 2. 2 Is divisible by 1
So, option (b) Is correct. Sa, 4 Is divisible by 1. So, R Is transitive.
Case Study 2 Sa, option (a) Is correct.
2. Here,n(A)=2andn(B)=6
Sherlin and Danju are playing Ludo at home during
. Number of functions from A ta B= (n(8)"" = 62
Covid-19. While rolling the dice, Sherlin’s sister Raji
So, option (a) Is correct.
observed and noted the possible outcomes of the
throw every time belongs to set {1,2,3,4,5,6}. Let 4 3. HereB={12,3 4,56)andR ={(1.2).(2.2).(1.3).(3.4).
be the set of players while B be the set of all possible (31). (4.3).(5.5)
Since, (a.a) #R. for every a «(1, 2,3 4,5,6)
outcomes. i.e, A={S,D},B={1,2,3,4,5,6}
Therefore, R Is not reflexive.
Now, since, (12) aRbut (2,1) 2 R.
Therefore, R Is not symmetric.
Also, it is observed that (a, b), (b.c) R
=s(ac)¢R.foranya, b ce(l23 4,56)
As (1. 3). (3, 4)aR. but (1,4) «R
Therefore R is not transitive.
So. option (d) is correct.

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

 4. Here.n(A)=2andn(B) =6 Q 5. The function f:Z —Z defined by f(x)=x? is
- Number of relations from A to B= 274 =@
=226.21 a. neither injective nor surjective
So. option (d) is correct. b. injective
5. Here B={1,2.3 45,6} C. surfective
d. bijective
and R=((1.2).(22).(1.1).(33).(4 4).(55). (66))
Since, (0. a) R for every o €{1,2, 3, 4, 5.6}
Solutions ]
So.R s reflexive.
Now, since (1. 2) eR but (2.1) gR. 1. f:R—Rlsgivenby f(x)= 2
S0, R Is not symmetric. It is seen that f(=1) = (1) =1but-1£1
Also. it is observed that (o, b). (b.c) eR Sa. f is not injective.
= (a.c)eR forany a.b.ce(l.2.34.5.6) Now, -2 eR. But there does not exist any element
So.Rs transitive. x eRsuchthat f(x)=x2=-2
So. option (b) Is correct. So. f Is not surjective.
Hence, function Is neither surjective nor Injective
Case Study 3
So. option (a) Is correct.
Archana visited the exhibition along with her family.
The exhibition had a huge swing, which attracted
2. f:N- Nisgiven by f(x)= x”
It Is seen that for x. y eN. f(x) = f(y)
many children. Archana found that the swing traced = xi=y?
the path of a parabola as given by y = x?2.
= x=y
[ x and y are positive numbers)
Sa. f Is injective.
Now, 2 eN but there does not exist any x In N such
that f(x) = x? =2.
It means there Is some element In co-domain in
which do not have any images. Therefare, f Is not
surlective.
So, option (c) Is correct.
3. f:{12.3...}>{1.49...) Is glven by
f(x)=x%
It Is seen that for x,, x> e{12,3 ...}

Based on the above information, solve the following

f(x)=f(x,)
questions:
- xp=x3
= Xy =Xy
Q1. Let
f: R — Rbe defined by f(x)=x7 is .ccoueurnae § [+ x,and x; are poslitive numbers)
a. neither surjective nor Injective So. fls Injective.
b. surjective Now, there exist any element x In (1 2,3 ...} such
C.injective f(x)=x*
d. bijective eg At x=1, f()=1
Q2. Let f:N —> N be defined by f(x)=x?is ......... . At x=2 fQ2)=4
a. surlective but not Injective At x=3 f(3)=9..
b. surjective TR!CK
c.Injective
P function is an onto (surjective) function, if its range Is]
d. bijective equal to co-domain.
Qa. Let f:{1,2,3,...} »{1,4,9,..} be defined by
FO)=x2 05 v . It means all elements In co-domaln have images.
a. bijective So, f Is surjective.
Hence. f Is bijective function.
b. surjective but not Injective
So, option (a) Is correct.
c. Injective but surfective
d. Nelther surjective nor injective 4. f:N - RIsglven by f(x)=x?
At x=1 f()=1
Q4. Let N — R be defined by f(x)
= x2. Range of the At x=2 f2)=4
function among the following is .. At x=3 f(3)=9....
a.{1,4,9.16,...} b.{1,4,8,9,10, So, range of f(x)={14,9.16. ...}
c.{1.4.9,15,16,..) d.(1.4.8,%6,. Sa, option (a) Is correct.

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

 x
5. f:Z— ZlIs given by f(x)=x? 4. We have, ve, gl¥)=——
=
It Is seen that f(-1) = f(1) =1
but 121 Let g(xa)=g(x2)
So. f Is not Injective. - x1___ X2
Now, -2 e Z. But there does not exist any elements X, =2 x;-2
xeZsuchthat f(x)=x?=-2 = XXy = 2X = XX, —2X;
So, f Is not surjective. = 2x;=2X,
Hence. function f Is neither injective nor surjective = X=Xy
So. option (a) is correct.
Thus, glx)=g(xz)
Case Study 4 = Xy=X3
Consider the mapping f : 4 — B is defined by Hence. g(x) is one-one.
x— Also, range of g(x) = co-domain
fx)= — such that f is a bijection. So. g(x)is onto.
Based on the above information, solve the following So. option (a) Is correct.
questions: 5. f(x)) =f(x2)
Q1. Domain of fis: > X=X
aRrR-2 bR cR-{.2) dR-(0) So. option (c) Is correct.
Q 2. Range of fis: Case Study 5
a.R b.R-{1) cR-{) dR-(.2)
Students of Grade 12, planned to plant saplings along
Qa. ifg: R~ {2} > R -{1}is defined by straight lines, parallel to each other to one side of the
g(x) =2f(x) - 1,then g(x)in terms of x is: playground ensuring that they had enough play area.
X+2 x+1 x-2 X Letus assume that they planted one of the rows of the
a. b. g c= d —
saplings along the line y =x —4.Let Lbe the set ofall
Q 4. The function g defined above, is: lines which are parallel on the ground and R be a
a.one-one b. many-one relation on L.
c.Into d. None of these
Q6. A function f(x)is said to be one-one iff:
a.f(x,) =f(x3) = —x; = x;
b. f(=x1) = f(=x2) = -x1=x2
Cf(x) =F(xz) = xy=x;
d. None of the above

&—— Solutions ———

1. For f(x)to be defined x -2 #0le. x 2
Based on the above information, solve the following
;. Domain of f =R - {2) questions:
So. option (a) Is correct. Q1. Let relation R be defined by R={(L,L,):L,|IL,
2. Let y =f(x) theny =l where L, , L, e L}then show that the relation R is
x=2
an equivalence relation.
= xy-2y=x-1
Q2. Let R={(L,,L,):L, L L, where L,L, L}, then
= Xy -x=2y-1
show that R is only symmetric relation.
= xa =1 Q3. Show that the function f:R-»R defined by
y =1
Since, x eR - {2}
f(x) = x = 4is bijective.
thereforey «1 Solutions ]
Hence. range of f =R - (1)
So, option (b) is carrect.
1. Here.R = ((L,. L;): L, IIL, where L, L, aL)
R s reflexive as any line L, Is parallel to Itself
3. We have, g(x)=2f(x) -1
x -1 Le. (L) aR
=2 =1
xX=-2 Now, let (L, L) eR
2x=2=-X+2 x = Llsparallel to L= L, Is parallel to L,
x=2 x=2 = (LyL)eR
So, optlon (d) Is correct. So. R Is symmetric.

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

 Now. let (L, Ly). (Lo L3) eR or
= L,is parallel toL,.also L, Is parallel to Ly A function f:B > G be defined by f={(b,,9,),
= Lis parallelto Ly (b5,95).(bs,g,)). Check whether f is bijective.
= (L. L3) €R.S0. R Is transitive. Justify your answer.
Hence, R Is an equivalence relation.
2. Here.R={(L,. L,): L, LL, where L, L, eL} g Solutions d
R is not reflexive as any line L, Is not perpendicular to 1. The number of relations fromBto G Is
itself. 27{B)xn(6) _ 23x2
le. (Luy) 2R =2f=64
Now. let (L. L;) eR
2. The number of functions fromBtoGls
= Lis perpendicular to L,
= L,is perpendicular to L,
[n(G)F® ie.23or B.
3. Reflexive
= (LzL)eR
So. R Is symmetric. Since x and x are of the same sex.
Now. let (L. L,). (L5 Ls) R So.(x. x) eR for all x.
= LyisperpendicularL, alsoL,isperpendicular to Ly -. Rls reflexive.
= Lyisparalleltol;le,L,isnotperpendiculartol,. Symmetric
= (L, L3) €R.50.R s not transitive. If x and y are of the same sex. Theny and x are of the
3. Here.f:R — Ris defined by f(x)=x -4 same sex.
Let x,. X e R such that f(x,)
= f(x5) Le.(x.y)eR=(y.x) eRYX.y
= Xj=b=xy-4 So, R Is symmetric.
= X1=X> Transitive
Therefore, f is one-one. If x and y are of the same sex; y and z are of the same
For any real number y in R, there exist (y + 4) In R sex. then x and z are of the same sex.
such that Le.(x.y)eR.(v.z) eR= (x.z)eRV x,yand z
Fly+4)=(y+4)-4=y So.R s transitive
So, f is onto. Hence, f Is bilective. Hence, R Is an equivalence relation.
Or
Case Study 6
Given function f: 8 — G such that
An organization conducted bike race under two f ={(b1.91). (b2.9,).
(b3 9))}
different categories—Boys and Girls. There were 28 Here we see thatby and by have same Image gy, so itls
participants in all. Among all of them, finally three not one to one function.
from category 1 and two from category 2 were Thus, f(x) Is not bljective function.
selected for the final race. Ravi forms two sets B and
G with these participants for his college project. Case Study 7
Let B={b,,b,,b;} and G={g,,g,}, where B A relation R on a set A4 is said to be an equivalence
represents the set of Boys selected and G the set of relation on A iff it is:
Girls selected ————
for the final race.
— Reflexive i.e., (a,a)e RY ae A.
il '— Symmetrici.e, (a,b)e R=>(b,a) e R foranya,be A.
Transitive i.e., (a,b) € R and (b, c)e R
= (a,c)eRforany a,b,ce A.
Based on the above information, solve the following
questions:
Q1. Ifthe relation R = {(1,1), (1,2), (1,3), (2, 2), (2, 3),
(3,1), (3,2), (3, 3)} defined on the set A={1,2,3},
Based on the above information, solve the following then show that the relation R is only reflexive.
questions: (CBSE 2023)
Q2. If the relation R={(1,2),(21),(13), G, 1)}
Q1. How many relations are possible from Bto G? defined on the set A={1,2,3}, then show that
Q2. Among all the possible relations from Bto G, how relation R is only symmetric.
many functions can be formed from Bto G? Q3. Ifthe relation Ron the set N of all natural numbers
Q3. LetR: B — Bbe defined by R ={(x,y): xand y are defined as R={(x,y):y = x +5and x <4}, then
students of the same sex}. Check whether Ris an show that R is not reflexive as well as symmetric
equivalence relation. but R is transitive.

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

Q 4. Ifthe relation Ron the setA={1,2,3,...... ,13, 14} Qa. A relation R is defined for set A={1,2,3} as
defined as R={(x, y): 3x —y =0}, then show that written below: (NCERT EXEMPLAR)
Ris not reflexive, symmetric and transitive. R={(1,1),@2),(,3),(1,3)}
Q 6. If the relation R on the set A ={1,2,3} defined as Write those ordered pairs which when added in R,
R={(1,1),(1,2),(1,3), 2,1),@,2), 23),3,1), 3, 2), it becomes the smallest equivalence relation.
(3, 3)},then show that Ris an equivalence relation. Q4. IFR={(1,2),2,1),(1, 1), 2,2)}andS ={(2,3), (,2),
(2,2),3,3)} are two transitive relations on set
Solutions . A ={1,2,3} then show that R US is reflexive and
1. Clearly, (1.7). (2. 2).(3.3). €R. So.R s reflexive on A symmetric but not transitive.
Since. (1.2) eR but (2.1) ¢R. So. R Is not symmetric Q6. Let X is a set of real numbers then prove that the
on A relation R={(a,b):aecX,beX and a=b}is an
Since, (2.3). eR and (3.1) eR but (2.1) R. So, R Is not equivalence relation. (NCERT EXERCISE)
transitive on A.
. Since, (1,1), (2. 2) and (3, 3) are not In R. 06. Find the number of all one-one functions from the
So.R Is not reflexive on A. set A={1,2,3}to itself. (NCERT EXERCISE)
Now.(1.2)eR = (2.1)eR Q7. Prove that the function f:R— R, given by
and (L3)eR = (3.1)eR. f(x)=2x, is one-one and onto. (NCERT EXERCISE)
S0, R Is symmetric
gs. Prove that f: N — N defined by f(x)=x—1and
Clearly, (1.2) R and (2,1) eR but (1.1) eR. f(1) = f@2), x >2is onto but not one-one.
So, R Is not transitive on A (NCERT EXERCISE)
. We have,R={(x.y):y = x + 5and x < 4}, Q9. Show that the function f:R R, defined as
where x.y eN. f(x) = x?, is neither one-one nor onto.
R={(1.6).(2.7).(38)) 0Q10. Show that the function f:[-1,1] — R, given by
Clearly, (1,1).(2.2) etc. are not InR. So.Rs not reflexive. f)= =—%) 4is one-one.
-
Since, (1, 6) eR but (6.1) &R. So. R Is not symmetric.
Since. (1.6) eR and there Is no order palr In R which
has 6 as the first element. Same Is the case for(2. 7) ‘/ Short Answer Type-1 Questions
and (3. 8). Q1 Check if the relation Rin the set Rof real numbers
So,R Is transitive as transitivity Is not contradicted. defined as R={(a,b):a<b} is (i) symmetric,
. We have,R ={(x.y):3x -y =0}, (i) transitive. (CBSE 2020)
where x.y e A={1.2,......14} g2 Show that the relation R in R defined as
R={(1.3).(2.6).(39).(412)) R={(a,b):a <b), is reflexive and transitive but
Clearly, (1,1) R. So, R Is not reflexive on A. not symmetric. (NCERT EXERCISE; CBSE 2019)
Since. (1.3) R but (3.1) £R. So, R Is not symmetric Qa. Prove that the function f: N — N defined through
onA f(x)=2x is one-one but not onto.
Since, (1.3) eR and (3.9) eR but (1,9) #R. So, R Is not Q4. If X={=1,1} and the mapping f:X - X is
transitive on A. defined as f(x)=x3, then prove that this
. Clearly. (1.1). (2. 2). (3. 3) eR.S0. R Is reflexive on A. mapping is one-one and onto.
We find that the ordered pairs obtained by Q6. If the function f : Q - Qis defined by f(x) =3x - 4
interchanging the components of ordered palrs In R V x €@, then show that f is one-one and onto,
are also In R. So, R Is symmetric on A where Q is the set of rational numbers.
For 1, 2, 3 eA such that (1, 2) and (2, 3) are in R 06. Prove that the function f is surjective, where
implies that (1, 3)is also, in R. S0,
R Is transitive on A. f:N — N such that
Thus, R Is an equivalence relation.
1+ i nisodd
fm=4,
Very Short AnSWer Type Questions 7 if n is even

Q1. Let A={0,1,2,3} and a relation R in A is defined Is the function injective? Justify your answer.
as:R={(0,0), (0,1),(0,3), (1,0),(1,1),(2,2), 3,0), (CBSE SQP 2022-23)
(3,3)}. Is R reflexive, symmetric and transitive? Q7. Show that f: N —> N, given by
(NCERT EXEMPLAR) x+ 1, if xisodd
0 2. Show that, in the set of positive integers, the f(x) ={ x=1, if xiseven
relation ‘divide’ is reflexive and transitive but not
is both one-one and onto. (NCERT EXERCISE)
symmetric.

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

 Oor
Q8. Consider a function f:[O,;]—»R, given by
Define the relation Rin the set Nx N as follows:
f(x)=sinx and g:[o,g]ak given by For (a,b),(c,d)eNxN, (a,b)R(c,d) iff ad =bc
Prove that R is an equivalence relation in Nx N.
g(x) = cos(x). Show that f and g are one-one but (CBSESQP2022-23)
f + g is not one-one. (NCERT EXERCISE) Q2. If N denotes the set of all natural numbersand Ris
Q9. f R={(4,5),(1,4),(4,6),(7,6),3,7)} then find the relation on Nx N defined by (a,b)R(c.d), if
the value of R10R™1. ad (b +c) = bc(a +d). Show that Ris an equivalence
Q10. Prove that the function f:N — N, defined by relation. (CBSE 2023)

f(x)=x? + x + 1is one-one but not onto. Q3. If Rand

S are equivalence relationsin aset4, show
(CBSE 2019) that R n S is also an equivalence relation.
(NCERT EXERCISE)
’, Short Answer Type-1l Questions
Q4. Given a non-empty set X, define the relation R in

Q1. Check whether the relation R in R defined by P(X)as follows:

R={(a,b):a<b?} is reflexive, symmetric or ForA,BeP(X),(A,B) =R iff A= B.Prove thatRis

transitive. (NCERT EXERCISE) reflexive, transitive and not symmetric.
(CBSESQP2022-23)
Q2. Prove that in the set of sets, the relation ‘c' is Q6. LetA={x €Z:0<
x <12). Show that
anti-symmetric. R={(a,b):a,beAla-blis divisible by 4} is an
Q3. Showthat
the signum function f: R — R, given by equivalence relation. Find the set of all elements
1, ifx>0 related to 1. Also write the equivalence class [2].
(CBSE2018)
f(x)={ 0, ifx=0
-1, ifx<0
Q6. Let A=R-{3},B=R-{1). Let f:AB be
defined by j(x)=x—_?’.
- ¥ x €A Show that f is
is neither one-one nor onto. (NCERT EXERCISE)

Q4. Let the function f:R-—>R be defined by bijective. (NCERT EXERCISE; CBSE 2017)
f(x)=cosx V,x eR, show that f is neither
Q7. Let f:R—{—i;} -+ R be a function defined as
one-one nor onto. (NCERT EXEMPLAR)
Q6. Consider f:R, — [~5,w)given by f(x) =L Show that f is a one-one function.
£(x)=9x2 + 6x —5. Show that fis bijective, Ix+4
where R_ is the set of all non-negative real Also, check whether f is an onto function or not.
(CBSE 2023)
numbers. (NCERT EXERCISE; CBSE 2017)
Q8. Show that the function f:R— R defined by
Lflng Answer Type Questions
fix)=—~T V X €R is neither one-one nor
x“+1
Q1. Let N be the set of all natural numbers and Rbe a
relation on Nx N defined by (a,b)R(c,d) < ad = bc onto. (CBSE2018)
for all (a,b),(c,d) e NxN. Show that R is an Q 9. Show that the function f:R —> {x e R:=1<x <1}
equivalence relation on NxN. Also, find the X
defined by f(x)= , X €R is one-one and
equivalence class of (2, 6), i.e., [(2, 6)]. 1+]x|
(CBSESQP2023-24) onto function. (CBSESQP 2023-24)

Very Short Answer Type Questions Let two positive integers a and b are such that a
divides b, then b cannaot divide a. Therefore the
1. Here R Is reflexive as (0. 0). (1. 1). (2. 2). (3. 3) @R and
relation s not symmetric. Hence proved.
symmetric as (0, 1) aR then (1, 0) eR also (0, 3) R
then (3, 0) e R but not transitive because (1, 0) e R and 3. (3.1)Is the only ordered palr which when addedin R, it
(0.3) eR while (1.3) ¢R. becomes smallest equivalence relation.
As (1.1),(2.2). (3.3) aR. so R s reflexive, (1. 3) a R then
2. Every positive integer divides Itself. Therefore, the
(3.1) eR. SO R Is symmetric.
relation Is reflexive.
Atlast (1.3) eR. (3.1) eR= (1.1) eR so R s transitive
Let three positive integers a, b, c are such that a
also. Hence R is an equivalence relation.
divides b and b divides ¢, then awill divide c definitely.

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

4. Here.RUS ={(1.2).(2.1).(1.1).(2.2). (2.3). 3 2).(3.3))
Here, (1.1). (2. 2). (3. 3) R so R is reflexive.
As(1.2)eR=(2.T)eRand (2.3)eR= (3.2)eRs0.RIs
symmetric.
Clearly(1.2)eR US and (2.3)eRUS
but (1.3)gRUS
Therefore, the relation R LS is not transitive.
M
Hence proved.
5. Here X = Set of real numbers and The image of 1and - Tunder f is 1.
R=((a.b):aeX.beXanda=b) 10. Given:f:[-11] >R
(i) R s reflexive because and flx)=—X_ x=-2
X+2
0=a = (0.0)eR.
consider f(x,) =f(x;)
(ii) R Is symmetric because if
= -2X X2
(a.b)eR = a=b
xX1+2 X2+2
= b=a
= x(x2+2)=x3(x1+2)
= (b.a)eR
= XyKg 42Xy =X\ X5 + 2X5
(iii) R s transitive because if (0. b) eR. (b.c) eR
2x,=2x,

U
= a=bb=c
Xy=X2
=>0=C
Therefore, f s one-one. Hence proved.
=(a.c)eR
- Rls an equivalence relation Hence proved. Short Answer Type-I Questions
6. One-one function from {1.2, 3} to itself Is simply a 1. Given a relationR ={(a. b): a <b)onR.
permutation on three symbols1, 2,3
Therefore, total number of one-one maps from ¢-TiPS
{1.2,3} to itself Is same as total number of o Arelation R defined on setA is a symmetric, if (x,y) € R
permutations on three symbols1,2,3 which Is 3! =6. = (v,x) e R foranyx,y € A
7. flis one-one, as ® A relation R defined on a set A is a transitive,
() =F(x3) if(x,y)e Rand (y,2)eR.
= 2xy=2x3 = (x,2)€ R, foranyx,y,z € A
= Xy=X;
() Symmetric: Note that(2,3) cRas2 <3
Y
But (32)¢Ras3+2
Y = f(x) = 2x Hence, the glven relation Is not symmetric.
X ) X
(Il) Transitive: Let (o, b) eR and (b.c) eR be any
arbltrary element.
M
Then, we havea <bandb<c
Also. glven any real number y In R, there exists % InR = a<b<c = a<c
= (a.c)eR
such that
Hence, the glven relation Is transitive
2. Let A = set of real numbers

Hence, f is onto. Hence proved. and R={(a.b):asb)

8. Here, (1) = f(2) but1»2
.. fisnotone-one. Hence proved.
TiPS
e A relation R defined an a set A is a reflexive,
Agaln, let f(x)=y wherey aN if (x)e RVxeA.
= x=l=y ® A relation R defined on set A is a symmetric,
= xmy+laN Vv yeN if (x,y)e R = (v,x)e Rforany x,y € A
. flsonto. Hence proved. ® A relation R defined on a set A s a transitive,
9. Sincef(~1) =1= f(1). f is not one-one. Also the element if(x.y)e Rand (y,z)eR.
(- 2)in the co-domaln R is notimage of any element x = (x,2) € R, foranyx,y,z € A.
in the domain R. Therefore. f Is not onto.

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

 (i) Ris reflexive because a sa=a=a. When n i; even, le.n=2
(ii) Ris not symmetric because ais less than b, but
b is not less than a. If 1is less than 2. then 2
@-2
fR)===1

cannot be less than 1. We see that. f image of 1and 2 is 1

(iii) Ris transitive. becausea<b.b<c=a<c - f is not one-one (injective).
Hence. R is reflexive and transitive but not (ii) Each member of co-domain is image of one of the
symmetric. Hence proved. member of domain e.g.. 1is the image of numbers
land 2
3. Let x,. X, eN and f(x,)
= f(x;)
.. f Is surjective (onto).
= 2xy=2x; Hence. f Is not Injective but surjective.
= Xy =X
7. Suppose f(x;)= f(x5)
- fis one-one. Hence proved.
Let f(x)=y wherey eN TR!CK
= 2x=y If x, is odd and x; is even, then we will have x; +1=
Xy = 1 ie,x;—xy =2 which is impossible. Similarly, the
= X “Len
zfi
possibility of x, being even and x, being odd can also
Ify=5 ENbU[X:gEN be ruled out, using the similar argument. Therefore
both xy and x, must be either odd or even.
- fls not onto. Hence proved.
4. Here only two elements —1and 1 are there In set X. Suppose bath x; and x; are odd. Then f(x;) = f(x3)
Thus, Fl=Ym (=P w1 = Xy + 1= X5 + 1= x; = X,. Similarly, if both x,and x,
are even, then also f(x,)=f(x;) = x, =1=x, =1=
and f)=(P2=1
Xy = x5 Thus, f Is one-one. Also, any odd number
Le. F(=1) = F(1)
2r + 1in the co-domain N Is the image of 2r + 2 In the
So. f Is one-one mapping,
domainN and any even number 2rin the co-domain N
Again, f(~1) = —1and f(1) = 1 shows that each element
Is the image of 2r - 1in the domain N. Thus, f Is onto.
of co-domain has pre-image In domain.
Hence proved.
So, f Is onto mapping.
B. Since for any two distinct elements x,and x5 In [U. g]
Therefore, the mapping f Is one-ane and onto.
Hence proved. sinx, = sin x, and cos x, = cos x,, both f and g must be
5. Letx,and x;are any two rational numbers such that, one-one.

f(x))=f(x,) then, x,=x, But (f+9)(0)=sin0+cosO=1

= 3x-4=3x;-4 " n ®
and (f+g)(3]=sln-2-+cosi=l‘
= 3x,=3x, = Xy= X,
Therefore. f + gls not one-one. Hence proved.
which shows that f Is one-one function.
9. Glven that,R = {(4.5). (1. 4).(4 6), (7.6). (3 7)}
Again let y be any element of co-domaln Q such that
R ={(5,4).(4.1.(6.4). (6.7).(7.3))
y=f(x)=3x-4 Now, we see that,
then, 3x=y+4
(5.4)aR™and(4.1)eR™ = (5.1)eR™OR™
y+4
or X= (6.4)eR™ and(4.1 eR™ = (6.1 eR"OR™
3
and (6.7)eR™'and(7.3)eR™ = (6.3)eR™OR™
Now, put the above value of x In the function
Hence, R='0R"' = {(5.1). (6.1). (6.3)).
f(x)=3x - 4.
10. Let x, y eN such that f(x) = f(y)
f(>"3—“)=3(%“)—4=(y+4)-4=y = x2+x+'\=y7+y+1

-+ Pre-image (y; 4] of each ratlonal number y Is

@-TiP
also a rational number /.e., In domain. fis one-oneiff f(x;)=f(x)= xy=x;
Hence, function f is onto. Hence proved. for all x;,x, € Xor fis one-one iff
6. Here.f:N — N while fxg) # f(xg) = xq # x5 for all xq,x; € X.

“—”. if nisodd x2-y2i(x-y)=0

f(n)=1, 2
S if niseven (x=y)(x+y)+(x-y)=0
[VI

(x=y)(x+y+N=0
() Whennls odd, Le.n =1 x-y=0 (“x+y+1=0)
141 2
f(1)=7=5=.1 X=y
.. f:N— N s one-one.

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

 (TR!CK 5. Here. function f: R, — (- 5. =)is given as
A function is an onto function, if its range is equal to its f(x)=9x2+6x-5.
co-domain.
TR!CK
f is not onto because x? + x + 123V x eN fis one-one iff f(x)) =f(x)) = x3=x; ¥V x3, x5 X
and so. 1. 2 does not have thelr pre-images. or f is one-oneiff
Hence proved. fx)#fx)=x12x; Vx,x€ X

Short Answer Type-Il Questions Let x. x, eR, such that

1. Let A = set of real numbers f(x1) =f(x2)
and R={(a.b):a<b’} then, 9x¢ +6x,-5=9x% + 6x, -5
= 9(x{ - x2)+6(x,
- x)=0
(i) Ris not reflexive. if a = %and b =d®=

@)—
= 90x + x3) (%= x3)
+ 6(x, - x;) =0
So. lls nat less than l = (x1=x2)
8(x1 + x2)+6}=0
2 8 = x-x3=0
(ii) Ris not symmetricifa <b? thenb s not less or [ xp X2 €R, = 9(xy+ x2) + 6 =0)
equaltoa asa=1b=2.1<2? but 2Is not less = Xy=X2VX X3 R,
than P.
Therefare, f(x) is one-one function.
(ili) R is not transitive, if a s b® b < c then it Is not
necessary thata s c. TR!CK
Therefore, R is none of the reflexive, symmetric and A function is an onto function, if its range is equal to its
transitive. co-domain.
2. Let X is the set of sets and AeX.BeX are two Let y be any arbitrary element of (-5, )
elements such that Ac B.
Then y=f(x) = y=9x?+6x-5
Now A c Bimplies that B¢ A is not always true. = y=0Bx+1)?-1-5=(3x+1)*-6
For example, if A={12)and B ={1.2,3)then Ac Bbut => (3x+1)2=y+6
BgA
= 3x+1=,Jy+6 asy2-5 =y+620
Infact
Ac B= Be Als true only when A =B.
Therefore, relation 'c' Is antisymmetric. = X = 3

Hence proved.
Therefore, f Is onto, thereby range f = (-5, )
3. Heref:R >R,
Hence. f(x) Is a bijective function.
1, ifx>0
Glven, f(x)={ 0. ifx=0 Long Answer Type Questions
-1, ifx<0
1. Here. (0.b) and (c d) relates by relation R when
f(x)=Twhen x >0,f(1) = f(2) =1. ad =bcl.e., first xfourth = second x third.
We see that the f image of 1and 2 are 1. (i) Reflexive:
.. fls not one-one. (1) From the glven condition,
Only 1.0. -1are the images, the other numbers are (a. b)willbe related to (a, b)byRwhena b =b o
not the images of any element of the Domain. - Foreacha,beN,ab=bals true
.. fisnotonto. =12) (0, b)R (o, b)= RelationR Is reflexive.
From egs. (1) and (2). (i) Symmetric:
fls neither one-one nor onto. Hence proved. Let(a, b)R (c. d). then from given condition
4. Let x,, x, &R such that f(x,) = f(x,) (a.b)R(c.d)=>ad=bc=bc=ad
then f(x1)
= f(x2) = cb=da (from commutative law)
= €05 X =C0S X3 =(c.d)R(a.b)
= Xy=2nn X,
~(a.b)R(c.d) = (c.d)R(a.b)
£ Xy B Xy
.. Relation R is symmetric.
.. f Is not one-one.
(i) Transitive:
Also, -1scosx <1
Let(a b)R (c.d)and(c. d)R (e. f)
.. The numbers smaller than -1and greater than
1are In co-domain R which are not the image of any then from given condition,
element of domain R. (a.b)R (c.d)and(c.d)R (e. f)
.. fis not onto. So, f Is neither one-one nor onto. = ad=bcandcf=de
Hence proved. = (ad)x(cf)=(bc)x(de)

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

 = af=be = ab(f-e)=ef(b-a)
=(a.b)R (e.f) = abf + efa=abe + efb
(a.b)R(c.d) and (c.d)R(e.f) = af(b+e)=be(a+f)
= (a.b)R(e.f) = (a.b)R(e.f)
- Relation R s transitive. . (a.b)R(c.d)and (c.d)R(e.f)= (a.b)R(e.f)
- The relationR on N xN is reflexive, symmetric and . Rls transitive
transitive. We see that the relation R an N xN Is reflexive,
Therefore, the relation R Is equivalence relation on symmetric and transitive.
N xN. Hence proved. Hence, R Is an equivalence relation.
Let the equivalence class of (2.6) be(x.y) Hence Proved.
Then . Since R and S are equivalence relations In set A so
2y=6x from the definition of the relation,
This Is possible when RcAxAandSc AxA
x=1y=3 = RASc AxA
= RnSisarelation in set A.
x=2y=6
Now, we will prove that RS is an equivalence
¥=3y=9
relation.
Hence, the equivalence class of (2, 6) are (1.3). (2. 6).
-+ The relations R and S are reflexive.
(3.9).....(n.3n).
(a.0)eR and (a.0)eSv aeA
. NxN={(a.b):aeN.beN} = (a.0)eRNSVaeA
Here the pair (a.b) related to (c.d) by R where
So. the relation R n S s reflexive.
ad(b +c)=bc(o +d)
Let.a, b € A be such that (a, b) eR NS
Le..first xfourth (second + third)
then, (a.b)eRNS
=second xthird (first + fourth)
= (a.b)eRand(a,b)eS
(1) Reflexive:
— (b.a)eRand(b,a)eS
From the given condition.
(- Rand S are symmetric)
(0. b) will be related to (0, b) by R.
= (b.a)eRNS
when ab(b+a)=bala+b)
So, the relation R N S Is symmetric.
or ab(a+b)=abla+b)vabeN
Let, a, b, c e Abe such that,
(-~ Natural numbers are commutative with
(a.b)eRnSand(b.c)eR NS
respect to addition and multiplication)
= ((a.b)eRand(a. b) e5)
= (o b)R (a.b)
and ((b.c)eRand(b.c)eS)
= RelationR s reflexive.
= ((a.b)eRand(b.c)eR)
(1) symmetric: and ((a.b)eSand(b.c)eS)
Let (a,b) R (c, d) then from given condition = ((a.c)eRand(a.c)eS)
(a.b)R (c.d) = ad(b+c)=bc(a+d) (- Rand S are transitive)
= bc(a+d)=ad(b+c) [(commutativelaw) = (a.c)eRNS
= cb(d+a)=da(c+b) [commutativelaw) So, the relation R N S Is transitive.
= (c.d)R(a.b) Thus, we see that the relation R A S Is reflexive,
s (ab)R(c.d) = (cd)R(ab) symmetric and transitive.
». Relation R Is symmetric. Hence,R n 5 is an equivalence relatlon.
(i) Transitive: Hence proved.
Let(a.b)R (c.d)and (c. d)R (e. f) . Let AeP(X).
From the given condition, Then, Ac A= (A A)eR
ad(b+c)=bc(a+d) So. R s reflexive.
Let A B CeP(X)such that
and cf(d+e)=de(c+f)
(A.B).(B.C)eR
= adb-bca=bcd-adc
= AcBBcC
and cfd-dec=def - cfe = AccC
= ab(d-c)=cd(b-a) = (A.C)eR
and cd(f-e)=ef(d-c) So.Rs transitive.
ob-a -C
0d-c el-e Let ¢ X eP(X)such that gc X

bb-a f-e
_ef Hence.(¢ X) e R.But. X & ¢ which implies that(X ¢) a R.
Thus. RIs not symmetric Hence proved.

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

 5. Given relationisR = {(a. b): a.b e A |a - blis divisible
by 4} TiP
and A={xeZ:0<x<12} fis one-one iff f(xq)=f(x;) = Xy =X, for all x;,x; € X
Now. A can be written as or fis one-one iff
A=(0123..12) fxq) # f(x2) = x1 # x5 forall xg, x; € X

¢-TiPS
o A relation R defined an a set A is a reflexive,
Let x, x2 e A such that f(x;) = f(x3)
Then.
if (x,x)e RVYxeA.
® A relation R defined on set A is a symmetric,
= (qa=2)(x2-3)=(x-2)(x,-3)
if ()€ R = (y,x)€ Rforany x,y € A
= X)X2 =2x2=3x)1+
6 =x1x2 -2x1-3x2+6
® A relation R defined on a set A is a transitive,
= =3x1-2x; =-2x1-3x;
if(x,y) € Rand(y,z)eR.
= =3(x;-x3)
+2(x; - x3) =0
= (x,2)€ R, foranyx,y,z € A.
= —(%,-x;)=0
Reflexive: As for any x < A we get = X=X, =0 =X =X,
Ix — x| =0, which s divisible by 4. Thi us. fxa)
= F(x;)
= (x.x)eR.V xeA = X =%V
x), Xz € A
Therefore, R is reflexive So. f(x)Is a one-one function.
Symmetric: As for any (x.y) eR. we get |x -yl s Lety eB =R - {l}be any arbitrary element.
divisible by 4. (By using definition of given relation) Then, f(x)=y
= Ix-yl=42 forsomereZ x=2
= =
= ly = x|=4kx forsomereZ x-3
= |y - xlis divisible by 4. = x=-2=xy-3y
Thus, (x.y)eR = (v.x)eR.foranyx,y
e A = X-xy=2-3y
Therefore, R is symmetric. = x(1-y)=2-3y
Transitive: For any, (x.y)eR and (v.z)eR. we get _2-3y 3y -2
| x -yl s divisible by 4 and |y —z| Is divisible by 4 = x-]_y or o ()
(By using definition of given relation).
= Ix-yl=4randly -zl=4p TR!CK
Forsome A,p eZ. P function is an onto function, if its range is equal ro]
Now, X=z=(x=y)+(y-2) co-domain.
=t 4Nt 4p
Clearly, x = é# Is a real number forally #1
=+ 4(h+p)
= |x -zlIsdivisible by 4. Also, éyL_]z %3
= (x.2)eR
Thus, (x.v)eRand(y.z)eR [3“/’_“]2 —353y-2-3y-352=3 whlchlsabsurd]
= (x.z)eR.forany x,y,.ze A
Therefore, R s transltive. Thus, for eachy eB, there exist x = é}% €A
Since, R Is reflexive, symmetric and transitive. So, It Is
an equivalence relation. Hence proved.
TR!CK suchthat f(x)= f[fl]=
y-=1
Let R be an equivalence relation in aset Aand let a € A.
Then, the set of all those elements of Awhich are related
to a under the relation R, is called the equivalence class _3y-2-2y+2_
determined by a 3y-2-3y+3

Now, set of all elements related to 11s { 1.5, 9).

TR!CK
A functionf: X = Y Is a bijective function, if it is both
The set of all elements related to (2). one-one and onto.
={a e A:2 - alls divisible by 4) = {2,6,10)
6. Glven, a function f: A — B, where A=R - (3) Therefore, f(x) is an onto function.

and B= R - {1} defined by f(x) = ;‘(‘g Hence, f(x) s a bijective function.

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

 7. Given.f:R —{—%}—» R defined by = (%2 =x)) (xpxz =1) =0
= x;=xy=0 or x;x,-1=0

f(x)= fx = Xyp=x; or X el
T3+ 4 1752 L Xy
Let X1 x2€R —{— %} Here. f is not one-one as if we take x, =1
x2
1

@-TiP 2
= In particular, x; =2 and x; = =, we get

= fisone-one iff f(x1) =f(xz) = x; =x; forall x;,x; € X

i) 4415
or fis one-one iff 1
Flxp) # fxg) = xy # x3 forall xq,x; € X and f(l)_ 2 _12 _2
2 l+‘ 5/4 5
such that F(xy) = f(x;) 4
- A __4x f(2)=f(5}1
3 +4 33X+ 4 ’
= (4x,)(3x, + 4)=(3x, + 4) (4x5) but 2*5
=5 12xx2+16x=12Xx1x3 + 16x2 6, FIS Aot GG
= 16x=16x; = x1=X3
(TR ! CK J
= fls one-one.
LetyeR. A function is an onto function, if its range is equal to
The function f s onto if there exist codomain
xeR —-{- %} such that f(x) =y Let y eR (co-domain) be any arbitrary element.
Consider, y=Ff(x)
Now, f(x)=y X
L 3x+4 4
. x’y
V7o
yx
= +y=
TR!CK ’ = x¥-x+y=0
A function is an onto function, if its range is equal to
co-domain.
- c T
2y
= 4x =3xy + 4y which does not exist for
1- 4y? <0..e..
for
= 4x -3xy =4y y>%andy<-%
= x(4=3y)= 4y4y i In particular for y =1&R (co-domain), there does not
= =R -{— g} existany x e R (domaln) such that f(x)=y.
4 .. f Is not onta.
Here we see that fory = F* Is not defined. Hence, fIs neither one-one nor onto. ~ Hence proved.
Thus, f Is not onto. 9. Let x,y eRand f(x)=f(y)
B. We have, a functlon f : R — R defined by X oY
et T+Ixl 1+1yl
f(x):xi*fvxafi‘ Ifx >0andy <0Othen x -y >0and2xy <0

Tip
PRo
o T+x 1-y

fis one-one iff f(x1) = f(xz) = xy =x; forall xy,x; € X = yHEXY

mX =Xy
or fis one-one iff = 2xy = x =y which Is not possible.
f(xp) # flxg) = xq # X3 forall xy,x; € X If x and y, both are positive then
f(x)=fly)
Letx,, x, @R such that f(x,)
= f(x,) - X y
=5 X} il T+x 1+y
xf+1 x§+1
= X4+ XY=y + Xy
= XX3 4 X) m XpXE + Xy = x=y
= X = xoxf + X1 = %3 =0 If x and y both are negative then
= xp(x3=x)=(x3-x)=0 f(x)=f(y)

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

 L et MSD = y(1-y)<0y=1
= —x 1-y -y
= X=Xy=y-—xy = O<y<ly=1= 0<y<] —()
= X=y
when
x <0,

.. fis one-one. V=i = Yyx=X

- = =
x(+y)=y = X .Fe
YE1x
when x 20, As
x <0,
=——
X
= Y+YX=X v yly+D)
1+ x T+y (v+1)?
= x=2 = viy+1)<0 = -1<y<0 ={2)
1-y From egs. (1) and (2). we get
Asx 20, 1<y <1, which s equal to co-domain.
.. fls onto.
Hence. f s one-one and onto. Hence proved.

& Chapter Test

Multiple Choice Questions Q4. Assertion (A): Let the function f:R—R be
Q1. LetRbe arelation onthe setN of natural numbers defined by f(x)=4x-1 V xeR Then, f is
one-one.
defined by nRmif n divides m. Then Ris:
a. reflexive and symmetric Reason (R): A function f: X —Y is defined to be
b. transitive and symmetric one-one (or injective), if the images of distinct
c. equivalence elements ofX under f are distinct, i.e.,
d. reflexive, transitive but not symmetric
XXy €X, f(xg)=flx;) = %, =x,.
Q2 Let f:R-—>R be defined by f(x)=%VxeR.
Case Study Based Questions
Then fis:
Q6. Case Study 1
a.one-one b. onto
A relation R in a set A4 is called:
c. bljective d. fIs not defined Reflexive: if (a,a) eR, for every a e A.
Symmetric: if (a,,a;)e R, implies that
Assertion and Reason Type Questions (ay,a,)eR,foranya,,a, e
Directions (Q. Nos. 3-4): In the following questions, each Transitive: if (a),a,)€ R, (a,,a;) e R implies
question contains Assertion (A) and Reason (R). Each question that(a,,a;)e R forany a,,a,,a; € A.
has 4 choices (a), (b), (c) and (d) out of which only one is Based on the given information, solve the
correct. The choices are: Jollowing questions:
a. Both Assertion (A) and Reason (R) are true and (i) Show that the relation R in the set
Reason (R) Is the correct explanation of A={1,2,3,..,13,14} defined as
Assertion (A) R={(x,y) : 3x =y =0} is neither reflexive
b. Both Assertion (A) and Reason (R) are true but nor symmetric nor transitive.
Reason (R) Is not the correct explanation of
(ii) Show that the relation R in the set Z of all
Assertion (A)
integers defined as R={(x,y): x =y is an
c. Assertion (A) is true but Reason (R) is false
integer} is an equivalence relation.
d. Assertion (A) is false and Reasan (R) Is true
(iii) Show that the relation Rin the set A of human
Q3. Assertion (A): Let the relation R be defined in N by
beings inatown R ={(x,y): x is the father of y}
aRb, if 2a +3b =30.
is neither reflexive nor symmetric nor
Then R ={(3, 8), (6, 6), (9,4), (12,2)} transitive.
Reason (R): An integer m is said to be related to or
another integer n, if mis a integral multiple of n. Show that the relation Rin the set A of human
This relation in Z is reflexive, symmetric and beings in a town R={(x, y): x is wife of y} is
transitive. neither reflexive nor symmetric nor transitive.

JOIN ON TELEGRAM @Class_12_CBSE_Study_Material

 Q6. Case Study 2 Q8. If A={a, b,c,d}and the function
An organisation conducted bike race under 2
different categories-boys and girls. Totally there f={@,b), (6,d), c,a),d,)}, write f .
were 250 participants. Among all of them finally Short Answer Type-l Questions
three from category 1 and two from category 2
were selected for the final race. Ravi forms two Q9. IfA={1,2,3}and f, g are relations corresponding
sets B and G with these participants for his to the subsetof Ax Aas f={(1,2),2,1),(3,3)}and
college project.
Let B ={b,,b,,b3} and G ={g,,g,} where B
9={(1,2),(1,3),2,1),(3,1)}, which of f,g is a
function? Why?
represents the set of boys selected and G is
the setof girls who were selected for the final race. Q10. Let R be the equivalence relation in the set Z of
integers given by R={(a,b):2 divides a -b}.
Write the equivalence class [0].

Short Answer Type-Il Questions

QM. Is g={(1,1),(2,3),(35), (4 7)} a function? If g is
described by g(x)=ax +f, then what value
should be assigned to « and 7
Q12. Let the function f:R-—>R be defined by
f(x)=cosx,V
x eR. Show that f is neither
one-one nor onto.
Ravi decides to explore these sets for various
types of relations and functions.
Long Answer Type Questions
Based on the above information, solve the Q13. If A={1,2,3,4]}, define relations on A which have
Jollowing questions: properties of being:
(i) Let R: B —> Bbe defined by R ={(x,y): x and
(i) reflexive, transitive but not symmetric.
y are students of same sex}. Then show that
the relation Ris an equivalence relation. (ii) symmetric but neither reflexive nor transitive.
(i) Let R:B—G be defined by R={(b,,9,), (iii) reflexive, symmetric and transitive.
(b;,9,), (bs,g,)), then the function R is
Q4. Let A=[-1,1], then discuss whether the
many-one but onto.
following functions defined on Aare one-one onto
(iii) Ravi wants to find the number of injective
or bijective.
functions from B to G. How many numbers of
injective functions are possible? 0 f00=7
Very Short Answer Type Questions
(ii) g(x)
=1 x|
Q7. Let A={0,1,2,3} and define a relation R on A as (iii) h(x)=x|x|
follows: R={(0,0), (0, 1), (0,3), (1, 0),(1,1),2,2),
(iv) k(x) = x?
6,0), (3 3))
Is R reflexive, symmetric and transitive?

SelfStudys .com
JOIN ON TELEGRAM @Class_12_CBSE_Study_Material