0% found this document useful (0 votes)
14 views31 pagesRelation and Function Assignment
The document provides various examples and solutions related to reflexive, symmetric, transitive, and equivalence relations on sets. It illustrates the properties of different relations through specific examples, demonstrating how to determine whether a relation meets the criteria for being reflexive, symmetric, transitive, or an equivalence relation. Additionally, it discusses the number of possible relations under certain conditions and the implications of these properties in set theory.
Uploaded by
jaybadgujjar17Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
14 views31 pagesRelation and Function Assignment
The document provides various examples and solutions related to reflexive, symmetric, transitive, and equivalence relations on sets. It illustrates the properties of different relations through specific examples, demonstrating how to determine whether a relation meets the criteria for being reflexive, symmetric, transitive, or an equivalence relation. Additionally, it discusses the number of possible relations under certain conditions and the implications of these properties in set theory.
Uploaded by
jaybadgujjar17Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
/ 31
EXAMPLE 1_ Let R be a reflexive relation on a set A and I be the identity relation on A. Then,
(b+) Rel (TCR (d) Rel
SOLUTION The identity relation is always a reflexive relation but a reflexive relation need not
be the identity relation. For example, the relation R = {(1, 1), (2, 2), (3, 3), (1, 2] is reflexive but
not the identity relation I ={(1, 1), (2, 2), (3, 3)}.
‘EXAMPLE2 The relation R ={(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} on set A ={1, 2, 3, 4} is
(a) reflexive (b) not symmetric (c) transitive (d) identity
Ans. (b)
SOLUTION _ R is not reflexive because I ¢ R. We find that (2, 3) ¢ R but (3, 2) ¢ R. So, R is not
symmetric. We also observe that (1, 3) € R and (3,1) € R but (1,1) ¢ R. So, R is not transitive.
EXAMPLE3_ The relation R ={(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3,9), (3,12), (3, 6)} on set
A=(3, 6,9, 12} is
(a) reflexive only (b) reflexive and symmetric only
(0) reflexive and transitive only (a) an equivalence relation
Ans. (c)
SOLUTION We find that the identity relation I on A is a subset of R. So, it is reflexive on A. We
also observe that (6, 12) € R but (12, 6) ¢ R. Therefore, R is not symmetric. It can be checked that
Ris transitive. Hence, R is reflexive and transitive only.
EXAMPLE 4 Let R be a relation on the set N given by R ={(a, b):a=b—2, b >6}. Then,
@ (2,4eR (&) (3,8) eR (0) (6,8)eR (d) (8,7)eR
Ans. (0) [NCERT]
SOLUTION If a=6 and b =8, then a=b-2 and b >6. Therefore, (6, 8) € R. So, option (¢) is
correct.
EXAMPLES Let A =({1, 2, 3} and consider the relation R =((1, 1), (2, 2), (3, 3), (1,2), (2, 3), (1. Dk
Then R is
(a) reflexive but not symmetric (b) reflexive but not transitive
(c) symmetric and transitive (d) neither symmetric nor transitive.
Ans. (a) INCERT EXEMPLAR]
SOLUTION We find that A =(1, 2, 3} and (1, 1), (2, 2), (3, 3) ER . So, Ris reflexive. Clearly,
(1,2) eR but(2, 1) ¢R.So, R is not symmetric. R is a transitive, because (1, 1) ¢ R and (1, 2) (2,3)ERi(1,2)€R and (2,3eR a(t, oer
(1,2)eR and (2,2) eR => (1,2) €R;(2, 3)€R and (3, 3) eR =9(2, eR (eR
(3, 3) R= (1, 3) ER. Hence, R is reflexive and transitive but not symmetric.
EXAMPLE 6 _ Ifa relation R on the set A =(1,2, 3) be defined by R =((1, 2)}, then Ris
n pet i, these
eee (b) transitive (c) symmetric (a) non of ety SOLUTION Given that A =(1,2, 3}. Therefore, for relation R to be reflexive,
(1, 1), 2,2) and (3,3). But, it does not. So, it isnot reflexive. Since(1, 2) € R but
not symmetric. R is transitive as it contains (1, 2) only and does not contain
pair beginning with 2.
Let A=(1, 2, 3}. Then the number of relations containing (1,2) and (1, 3) which are
reflexive and symmetric but not transitive is
(1 (b) 2 ()3 (a) 4
Ans. (a) can wcasarta
SOLUTION The smallest relation R, containing (1, 2) and (1, 3) which is reflexive and
symmetric is Ry = {(1, 1), (2, 2),(3, 3), (1, 2),(1, 3),(2,1),(3,1)). Clearly, it is not transitive as
(3,1), (1, 2) ER but @, 2) €R. If we add one of the ordered pairs (2,3) or (3,2) then Ry is not
symuetric. So, to make it symmetric we have to add both (2, 3) and (3, 2) to Rj. The new relation
is the largest relation i.e. the universal relation on A whichis reflexive, symmetric and transitive
Hence, there is only one relation Ry which is reflexive and symmetric but not transitive.
EXAMPLES The maximum number of equivalence relations on the set A = (1,2,3} is
(a) 1 (b) 2 (3 (d) 5
Ans. (d) INCERT EXEMPLAR]
SOLUTION The smallest equivalence relation on A={1,2,3} is the identity relation
I, =((1,1),(2, 2), (3, 3)}. If we add ordered pair (1, 2) to I, we must also add (2, 1) to make the
relation symmetric. The relation Ry = (1, 1),(2, 2), (3, 3), (1, 2), (2, 1)} so obtained is transitive
also and hence it is an equivalence relation on A. Similarly, by adding (2, 3) (3,2) to 4, we obtain
Ry ={(1, 1), (2, 2), (3, 3), (2, 3), (3, 2)} an equivalence relation on A. By adding (1, 3) and (3, 1) to
14, we obtain R3 =((1, 1), (2, 2), (3, 3), (1, 3), (3, 1)} as an equivalence relation on A. If we add
(1, 2)and (2, 3), then we must also add (2, 1), (3, 2) (1,3) and (3, 1) to make the relation symmetric
and transitive. The relation so obtained is the universal relation. Hence, in all there are 5
equivalence relation on set A =(1,2,3}.
it should contain
(2,1) €R. So, itis
any other ordered
EXAMPLE 9 Let A ={1,2,3}. Then the number of equivalence relations containing (1, 2) is
—
@T b) 2 ©3 (a4
Ans. (b) I(NCERT, CBSE 2020]
SOLUTION As discussed in Example 8, the equivalence relations containing (1, 2) are
© (4,1),2,2),,3),(1,2),(,1)) and (i) (4,1) (2,2), 3,3), (1,2), 2.1). (1,9).8.0.2.3.8.2h
EXAMPLE 10 Let us define a relation S on set R of all real numbers by the rule aR if a >b. Then, Ris
(a) an equivalence relation (b) reflexive, transitive but not symmetric
(©) symmetric, transitive but not reflexive (d) neither transitive nor reflexive but symmetric
Ans. (b) UNCERT EXEMPLAR]
SOLUTION For anyaeR,a>ais true. Therefore, (a, a) € S$ for alla € R. So, Sis reflexive.
Leta, b, ce R such that (a, b) © Sand (b, c) € §, Then,
a2bandb2c = are = (a,c)eS
So, Sis transitive on R.
Sis not symmetric because7 > 3 but 3 $7 ie.(7, 3)< Sbut(3,7) €S.
Hence, Sis reflexive and transitive but not symmetric.
EXAMPLE 11 Let R bea relation on the: set N of natural numbers. defined by nRm iff n divides m. Then, Ris
(a) reflexive and symmetric
° (b) transitive and symmetric
(©) equivalence (A) reflexive, transitive but not symmetric:
eo INCERT EXEMPLAR] SOLUTION For any natural number 1,n divides itself is true. Therefore, n divides n for alln e N
and hence (n,n) € R for all n EN. So, R is reflexive. We know that 2 divides 6 but 6 does not
divide 2 ie. (2, 6) € R but (6,2) ¢ R. So, R is not symmetric.
Let m,n, p € N such that m, ne R and (1, p) € R. Then,
(m,n) eR and (n, p) eR > mdivides n and n divides p = m divides p > (m,p)<¢R
So, R is transitive. Hence, option (d) is correct.
EXAMPLE 12 Let L denote the set of all straight lines ina plane. Let a relation R be defined by [Rm iff! is
perpendicular to m for all 1, me L. Then R is
(a) reflexive (b) symmetric (c) transitive (d) none of these
Ans. (b) INCERT EXEMPLAR]
SOLUTION A straight line in a plane cannot be perpendicular to itself. Therefore, (1, l) < R for
any | € L. So, R is not reflexive.
Let (I, m) € R. Then, | L m=> m1 | = (m, 1) €R. So, R is symmetric.
Now, let /,m, n € L such that (I, m) € R and (m,n) € R. Then,
IL mandmLn = lis parallelton > (Ln)¢R '
So, R is not transitive.
EXAMPLE 13 _ The relation R on the set A =(1,2,3} given by R ={(1,2),(2, 1), (3, 3)} is
(a) symmetric and transitive, but not reflexive (b) reflexive and symmetric, but not transitive
(0) symmetric, but neither reflexive nor transitive (4) an equivalence relation
Ans. (c)
SOLUTION Given relation R is not reflexive because (1, 1), (2, 2), (3, 3) do not belong to R.
Relation R is symmetric but it is not transitive because (1,2) < R, (2, 1) ¢ R but (1,1) €R.
EXAMPLE 14 If A ={1, 2, 3}, then which of the following relations are equivalence relation on A?
(a) Ry ={(1, 1), (2, 2), (3, 3)} (b) Ry ={(1, 0), (2, 2), (3, 3), (1,2), (2, D}
(©) R3 =((1, 1), (2, 2), (3, 3), (2, 3), (3,2) (d) Ry, Rp and Rg
Ans. (d)
SOLUTION Relation R; is the identity relation on A and hence it is an equivalence relation on set
A. Relations Ry and R are also equivalence relations on A. Hence, option (d) is correct. EXAMPLE17_ If A is the set of even natural numbers less than 8 and B is the set of prime numbers less
than 7, then the number of relations from A to B is
(a) 2° (b) 9? (c) 3? (d) 29-1
Ans. (a) r
SOLUTION _Itis given that A =(2, 4, 6} and B ={2, 3, 5}. Therefore, Ax B has 3x 3 =9elerents.
Hence, number of relations from A to Bis 29.
LE 18 Let W denote the set of all words in the English dictionary. Define the relation R by
R ={(x, y) eWx W: the words x and y have at least one letter in common). The relation R on W is
(a) reflexive, symmetric but not transitive (b) reflexive but not symmetric and transitive
(c) an equivalence relation (d) not reflexive but symmetric and transitive
Ans. (a)
SOLUTION For any word x in set W, x and x have all letters in common. Therefore, (x, x) = R .
Thus, (x, x) € R for all x e W. So, R is reflexive on W.
Let (x, y) € R. Then,
(x, y) €R => Words x and y have at least one letter in common.
=> Words y and x have at least one letter in common = (y, x) =
So, R is symmetric.
We find that BOLD is related to BAT and BAT is related ACE. But, BOLD is not related to ACE.
So, R is not transitive. [EXAMPLE20 yr is a relation Z (set of all integers) defined by xRy iff |x—y| <1, then Ris
(a) reflexive and symmetric (b) reflexive and transitive
(©) symmetric and transitive (A) an equivalence relation
Ans. (a)
SOLUTION Reflexivity: Let x be any integer. Then,| x-x|=0<1 => xRx.
Thus, xRx for all x € Z. So, R is reflexive.
Symmetry: Let x, y eZ such that
xRy =| x-y|<1 = |-(y-x)|<1 = |y-x|<1 = yRx
Thus, xRy => yRx for all x, y € Z. So, R is symmetric.
Transitivity: We find that
3.1 5),(3 3), (1 51
<1 and |3-1 5)r(3 a (F)a(Z)e (3-4) R.
44 1 (Zag) 4) a) a’ a)®
So, R is not transitive.
EXAMPLE 21_ The number of reflexive relations on a set A consisting of n elements is equal to
(a) 2" (b) n? () 27e"-D (a) n?=-n
Ans. (c)
SOLUTION Let A ={a1,a,..., 4,) be the set consisting of n elements. Then, each reflexive
relation on A must have following n ordered pairs: (a1, 44), (ag, 4), .-, (dq, 4) and any number
of ordered pairs from the remainingn” —n =n (n-1) ordered pairs. Any number of ordered pairs
from (n—1) ordered pairs can be chosen in
MO Derg 4 MO NEy 4g MO NC) 4 MONG, (yay = 20D ways
<1 but, [5 —
4
Hence, the number of reflexive relations on A is 2"("-),
EXAMPLE 22 _Let R be a reflexive relation on a finite set A having n-elements and let there be m ordered
pairs in R. Then,
(@) man (b) msn (0) m=n (a) none of these
Ans.(a)
SOLUTION As mentioned in Example 21, every reflexive relation on A must have n ordered
Pairs (a,, 4), (42, a), ... (dq, %)-S0, the number of ordered pairs in R is greater than or equal
tonie.m>n.
EXAMPLE 23 The number of symmetric relations on set
A=(1,2, 3, dis
(a) 210 ) 26 (0) 22 (a) 21°
Ans. (a)
(ore)
SOLUTION The number of symmetric relations on a set cgnsist
ing of m elements is 2 2
n= 4. So, the number symmetric relations on set A is 2° =2. EXAMPLE 25 Statement-1 (A): The relation R on the set N x N defined by (a,b) R (c,d) <> a+d
=b+c for alla,b, c,d €N is an equivalence relation.
Statement-2(R): The intersection of two equivalence relations ona set A is an equivalence
relation.
Ans. (b)
SOLUTION See Example 11 on page 1.18 and Theorem 1 on page 1.24 of class XII book.
EXAMPLE 26 Statement-1 (A):The relation R on the set NxN_ defined by
(a,b) R (c,d) <> a+d=b+c foralla,b,c,d€N is an equivalence
relation.
Statement-2 (R): The union of two equivalence relations is an equivalence relation.
Ans. (c)
SOLUTION — Statement-1 is true. (See Example 11 on page 1.18 of class XII book)
Statement-2 is false, because R={(a, a) (b,b),(c, c), (a,b), (b, a)} and, S=({(a, a), (b, 5), (c, ©),
(b, c), (c, b)} are equivalence relations on set A = {a, b, c}.But, R U Sis not an equivalence relation
on A, because (a,b) € R US, (b,c) ERUSbut (a,c) ER US.
EXAMPLE 27 Statement-1 (A): If R is an equivalence relation on a set A, then R ~1 is also an
equivalence relation.
Statement-2 (R): R=R7~} iff R is a symmetric relation.
Ans. (b)
SOLUTION Both statements are true. (See Theorem 3 on page 1.25 and illustration 5 on page 13
of class XII book) =XAMPLE31_A general election of Lok Sabha is a gigantic exercise. About 911 million people were
eligible to vote and voter turnout was about 67%, the highest ever.
ONE — NATION
ONE - ELECTION
FESTIVAL OF
DEMOCRACY
GENERAL ELECTION -
LL
2019 MY WOICE
Fig. 1.1 Lt Ibe the set ofall citizens of India who were eligible to exercise their voting right in general election helg
in 2019. A relation 'R’ is defined on 1 as follows:
R=((Vj,V2):Vp V2 €! and both use their voting right in general election - 2019}
(@) Two neighbours X and Y €I. X exercised his voting right while Y did ni
election - 2019. Which of the following is true?
(a) (X,Y)eR (vb) (Y,X) eR ()(% eR (d) (X,Y) ¢R
(ii) Mr. 'X’ and his wife 'W' both exercised their voting right in general election - 2019. Which of the
following is true?
(a) both (X, W) and (W,X) ER (b) (X, W) ER but (w, X)eR
(c) both (X, W) and (W, X) €R (d) (W, X) R but (X,W) ¢R
(ii) Three friends F, Fy and Fy exercised their voting right in general election - 2019, then which of the
following is true?
(a) (Fi, Fy) R, (Fy, Fz) €R and (Fy, Fz) €R (b) (Fy, Fy) ER, (Fy, F3) € Rand (F,, Fy) €R
(© (AR) eR, (Ry, B) eR and (Fs, Fz) €R (d) (Fy, Fe) €R, (Fy, F3) # Rand (F,, F;) 2R
(iv) The above defined relation R is
(a) Symmetric and transitive but not reflexive (b) Universal relation
(c) Equivalence relation (d) Reflexive but not symmetric and transitive.
(v) Mr. Shyam exercised his voting right in General Election - 2019, then Mr. Shyam is related to
which of the following?
(a) All those eligible voters who cast their votes (b) Family members of Mr. Shyam
(©) All citizens of India (a) Eligible voters of India
SOLUTION (i) Ans. (d): Given that X exercised his voting right while Y did not cast her vote.
This means both X and Y did not use their voting right (X, Y) ¢ R.
(ii) Ans. (a): Given that Mr. X and his wife W both exercised their voting right. Therefore,
(XW) eR. Since, R is symmetric. Therefore, (W, X) € R. Hence, (X, W) €R and(W, X) =
(iii) Ans. (a): Each one of three friends F,, Fy and F3 exercised his voting right. Therefore,
(Fy, Fh) €R, (Fy, F3) €R and (F,, F3) eR.
Ans. (c): Relation R is reflexive, symmetric and transitive. Hence, it is an equivalence
relation.
iat cast her vote in general
() Ans. (a): Mr. Shyam exercised his voting right in the general election. Therefore, be
related to ail those eligible voters who cast their votes. Hence, option (a) is correct.
EXAMPLE32 Sherlin and Danju are playing Lud ¢ Covid-19. While rolling the dice
: ying Ludo at home during Covi he dice
‘SHerti’s sister Raji observed and noted the possible outcomes of the throw every time belongs 15
{1, 2, 3,4, 5,6). Let A be the set of players while B be the set ofall possible outcomes.
Fig. 1.2 A=(S,D}, B=(1, 2, 3,4,5,6)
(i) Leta relation on set B be defined by R =((x, y):y is divisible by x}. Then, R is
(a) Reflexive and transitive but not symmetric (b) Reflexive and symmetric and not transitive
(©) Not reflexive but symmetric and transitive (d) Equivalence
(i) Raji wants to know the number of relations on set B. The number is
(a) 2 (b) 2% (©) 36 (d) 12
(ii) Let R be the relation on B defined by R ={(1, 2), (2, 2), (1, 3), (3, 4), (3, 1), (4, 3), (, 5)}. Then
Ris
(a) symmetric (b) reflexive (c) transitive (d) none of these three
(iv) Raji wants to know the number of relations possible from A to B. How many relations are possible?
(a) 6 (b) 26 (©) 6! (d) 2
(v) Leta relation on B be defined by R = ((1, 1), (1, 2), (2,2), (3, 3), (4, 4), (6,5), (6, 6)}, then R is
(a) symmetric (b) reflexive and transitive
(c) transitive and symmetric (d) equivalence
SOLUTION (i) Ans. (a): We observe the following properties of R: Reflexivity: For any
x€B=(1, 2, 3, 4,5, 6), xis divisible by itself ite, (x, x) € R.So, R is reflexive.
Symmetry: We find that 2 divides 6 but 6 does not divide 2. This means that (2,6) ¢R but
(6,2) €R.So, R is not symmetric.
Transitivity: Let x, y,z € Bbe such that
(x, y) €R and (y,2) eR
= __ yis divisible by x and zis divisible by y = zis divisible by x = (x,2)¢R
So, Ris transitive. Hence, R is reflexive and transitive but not symmetric.
(i) Ans. (b): Set Bhas 6 elements. Therefore, 2°** = 2% relations can be defined on set B.
(ii) Ans. (d): We find that (1, 1), @, 3) ¢R.So, R is not reflexive.
Clearly, (1, 2) € R but (2, 1) ¢ R.So, R isnot symmetric. We find that(1, 3) ¢ R and (3, 4) R but
(1, 4) €R.So, R is not transitive. Hence, R is neither reflexive, nor symmetric nor transitive.
(iv) Ans, (d): A has 2 elements, B has 6 elements. Therefore, Ax B has 12 elements. Hence,
number of relations from A to Bis 2”,
(¥) Ans. (b) Clearly, the identity relation on Bis a subset of R.So, R is reflexive. We observe
that (1, 2) eR but (2, 1) ¢ R.So, R is not symmetric. Clearly, R is transitive.
EXAMPLE33, An organization conducted bike race under 2 different categories — boys and girls. Totally
there were 250 participants. Among all of them finally three from Category 1 and two from Category 2
were selected for the final race. Ravi forms two sets B and G with these participants for his college project.
Let B = (by, by, bg} G = (gy, go) where B represents the set of boys selected and G the set of girls who were
selected for the final race.
Fig. 1.3 Ravi decides to explore these sets for various types of relations and functions
(Ravi wishes to form all the relations possible from B to. How many such relations are possible?
(@) 28 ) 2 (0 (a) 23
(ii) Let R bea relation on Badefined by R ={(x, y) : x and yare students of same sex}, Then this relation
Ris
(a) equivalence 7 (b) reflexive only
(0) reflexive and symmetric but not transitive (d) reflexive and transitive but not symmetric
(iii) How many reflexive relations are defined on G?
(a) 2 (b) 4 (c) 3 (a) 16
(av) The number of non-reflexive relations on B is
(a) 448 (b) 444 (c) 64 (d) 512
(v) The number of equivalence relations on G is
@4 (b) 2 3 (@) 16
[CBSE 2923]
SOLUTION (i) Ans. (a): B has 3 elements and G has 2 elements. Therefore, Bx G has 3x2=6
elements. Total number of relations from B to G is the number of subset of Bx G, which is 2°.
(ii) Ans. (a): The relation R on Bis reflexive, symmetric and transitive, because all students in B
are of the same sex. Hence, R is equivalence relation.
(ii) Ans. (b): The number of reflexive relations on a set consisting of n elements is 2""-).
Therefore, number of reflexive relations on G is 27"! = 4.
(iv) Ans. (@): The number of non-reflexive relations on a set consisting of m elements is
2" -2""-)) Therefore, the number of non-reflexive relations on Bis 2? -2° = 448.
(v) Ans. (b): The equivalence relations on G are the identity relation and the universal relation.
Hence, the required number is 2.
EXAMPLE 34_ Students of Grade 9, planned to plant saplings along straight lines, parallel to each
other to one side of the playground ensuring that they had enough play area. Let us assume that they
planted one of the rows of the saplings along the line y =x—A4. Let L be the set of all lines om the
ground and R be a relation on L.
Fig. 1.4
Answer the following using the above information.
(i) Let relation R be defined by R ={(L, yo Ly wher
R rly): mre Ly, Ly € L) then Ris
(a) an equivalence relation na ae reflexive
(c) only reflexive (d) symmetric but not transitive.
(i) Let R =U(Ly La) Ly A Ly where Ly, Le L. Then which ofthe following i true? (a) R is symmetric but neither reflexive nor transitive.
(©) R is reflexive and transitive but not symmetric.
(©) R is reflexive but neither symmetric nor transitive.
(d) Risan equivalence relation.
(iii) Let R ={(Ly, La): Ly és parallel to Ly) be a relation on L. If (Ly, La) € R and Ly:y = 3x—2, then
which of the following can be Ly?
(a) y=2x+3 ( y=3xt11 — (d) y=-3x42
(iv) Let R=((Ly,Lp):Ly 1 Ly, where Ly, Ly €L) be a relation on L. If (Ly,Ly)€R and
Ly: 2x-3y+1=0, then which of the following can be Ly?
(a) 2x4 3y+1=0 (b) 3x4+2y+5=0 (c) 2x-3y+7=0 (d) x+3y41=0
(v) Let R ={(Ly, Lp) : Ly | Ly, where Ly, Ly € L} be an equivalence relation on L. Then, the equivalence
class representing y = 2x +1 is
(a) {y=2x-+c:cisa real number) (b) ly =2x-+¢;c is an integer)
(©) (y=2x+c:cisa natural number) — (d) (2y=x+c:c is a real number}
SOLUTION (i) Ans. (a): Rflexvity: Let be an arbitrary line in L. Since every line is parallel to
itself. therefore, I|| l. Thus, (I, 1) € R for all! ¢ L.So, R is reflexive.
Symmetry: Let ly, ly €L such that (, ) € R. Then, (hh, b) €R => hy => hil (ah) eR-
Thus, (Ih, Ip) € R= (, h) €R for all h, ly €L.So, R is symmetric.
Transitivity: Let ly, Ip, Iz € L such that (Jy, lp) €R and (Ip, 13) €R. Then,
Aland lls > hllls > (hg) eR.
Thus, (Ih, fy) €R and (h, 13) €R = (h, lg) € R. So, R is transitive. Hence, R is an equivalence
relation on L.
(ii) Ans. (a): Reflexivity: Any line in L cannot be parallel to itself. So, R is not reflexive.
Symmetry: Let ly, Ip € L be such that (hb) eR>h Lh => h Lh= (hh) eR.
So, R is symmetric.
Transitivity: Let ly, ly, 1 € L be such that
(hb) €R and (h, 13) ER h Lb andh 11; > hls (1s) €R
So, R is not transitive. Hence, R is symmetric only.
(iii) Ans. (c): Itis given that(L;, L2) € R ie. Ly is parallel to Lz and Ly:y = 3x-2. Therefore, Ly is
a line parallel to L;.Clearly, y = 3x + 11 is parallel to Ly. Hence, Ly :y = 3x+11.
(iv) Ans. (b): It is given that (Ly, Lp) € R i.e. Ly is perpendicular to Ly and L 3y+1=0.
Therefore, Ly is any line perpendicular to 2x - 3y +1 = 0.Clearly, 3x+ 2y +5 = Ois perpendicular
to Ly. Hence, Ly : 3x +2y+5 =0.
(v) Ans. (a): The equivalence class representing y = 2x +1 is the family of all lines parallel to
y=2x+1.Clearly, y = 2x + represents family of lines parallel to y = 2x + 1. Hence, the required
equivalence class is {y = 2x + ¢: cis any real number}.
‘Mark the correct alternative in each of the followin:
1. Let R be a relation on the set N given by R = (a, b):a=b - 2,b > 6}. Then,
~~ @ (4) eR () (3,8) eR (c) (6,8) €R (d) (8,7)€R 2. Which of the following is not an equivalence relation on Z?
Ga) aRb eo a+bisaneven integer (b) @Rb <> a~bis an even integer
(©) aRbesach (4) aRbea=b
3, Consider the set A =(1, 2}. The relation A which is symmetric but neither reflexive nor
transitive is
@1G0,22) &) 0 (© (4,2)) (4) ((1,2),,1)}
4. Therelation R defined on the set A ={1, 2, 3, 4, 5) by R =((a,b);| ab?) <16), isgivenby
=
(@) ((1,0,(2,1,(3,1),(4,0(2, 3) &) (2, 2), (3, 2), (4, 2), (2, 4)
(©) ((3, 3), (4, 3,6, 4), (3, 4} (d) none of these
5. Let R be the relation over the set of all straight lines in a plane such that LRhahLh.
— Then, R is
(a) symmetric (b) reflexive
(c) transitive (d) an equivalence relation
6. IfA=(a,b, d, then the relation R ={(b, o)} on Ais
— (a) reflexive only (b) symmetric only
() transitive only (d) reflexive and transitive only
7. Let A=(2,3,4,5,..., 17, 18}. Let '=' be the equivalence relation on A x A, cartesian product
— of Awith itself, defined by(a,b) ~(c, d) iffad =bc. Then, the number of ordered pairs of the
equivalence class of (3, 2) is
(a) 4 () 5 () 6 (d) 7
8, Let A = (1,2, 3}. Then, the number of relations containing (1, 2) and (1, 3) which are
= reflexive and symmetric but not transitive is
@1 (b) 2 ©3 (d) 4
(3. The relation ‘R’ in Nx N such that (a,b) R (c,d) < a+d=b + cis
(a) reflexive but not symmetric (b) reflexive and transitive but not symmetric
(©) an equivalence relation (d) none of these
10. IfA=({1, 2,3}, B= {1,4, 6,9} and R isa relation from A to B defined by ‘xis greater than y’
The range of R is
@) (1,4,6,9} () {4,6,9} (© 1) (a) none of these
11. A relation Ris defined from (2, 3, 4,5) to (3, 6, 7, 10) by :x R y < xis relatively prime © 4
Then, domain of R is
(@) (2,3,5) ) (3,5) (©) (2,3,4) (@) 23,45)
12. Arelation $ from C to R is defined by x $y < | x| = y. Which one is correct?
(2) (2+ 31613 (b) 3.9(-3) (©) A+) 62 (d) igt
13. Let R bea relation on N defined by x + 2 y =8.The domain of R is
(@) (2,4,8) () (2,4,6,8) (0) (2,4, 6) (a) (12.3.4)
14, Risarelation from (11,12, 13} to (8, 10, 12} defined by y =x ~ 3. Then, Ris
(a) {(8, 11), (10, 13)) (b) (11, 8), (13, 10))
(©) {(10, 13), (8, 11), (8, 10)} (d) none of these
35, Let R =((a, 4), (b,b),(c, ¢,(a,b)} be a relation on set A =|(a,b, ch. Then Ris
(a) identity relation (b) reflexive
(©) symmetric i
(d) equivalence '
36, Let A= (1, 2,3) and R= ((1, 2), (2, 3), (1, 3)} bea relation on A. Then, Ris
(a) neither Teflexive nor transitive (b) neither symmetric nor transitive
(c) transitive (d) none of these 17, If Ris the largest equivalence relation on a set A and Sis any relation on A, then
7 (a) ics (b) SCR () R=S (d) none of these
18, IfR isa relation on the set A = (1, 2,3, 4,5, 6, 7, 8, 9] givenby x Ry © y= 3x, thenR=
~ €@) (G,1, 6,2), 8,2), 9, 3)} () (3,1), 6,2), 9, 3)}
(©) {, 1), 2, 6), (3, 9)} (d) none of these
19. IFR isa relation on the set A =(1, 2, 3} given by R =((1, 1), (2, 2),(3, 3)}, then R is
— (a) reflexive (b) symmetric (c) transitive (d) all the three options
20. If A={a,b, c,d}, then a relation R = (a,b), (b, a), (a, a)}on A is
— (@) symmetric and transitive only (b) reflexive and transitive only
(©) symmetric only (d) transitive only
21. IfA = (1, 2, 3}, then a relation R = {(2, 3)) on Ais
~ (a) symmetric and transitive only (b) symmetric only
(©) transitive only (d) none of these
22. Let R be the relation on the set A = {1, 2, 3, 4} given by
R=, 2), (2, 2), (1,1), (4, 4), (1, 3), (3, 3), (3, 2)}. Then,
(a) Ris reflexive and symmetric but not transitive
(b) Ris reflexive and transitive but not symmetric
(©) Ris symmetric and transitive but not reflexive
(@) Ris an equivalence relation
23, The number of possible reflexive relations on a set consisting of 3 elements is.
(a) 512 (b) 64 (©) 256 (a) 128
24. The relation R= {(1, 1), (2, 2), (3, 3)} on the set {1, 2, 3} is
—~ (a) symmetric only (b) reflexive only
(©) an equivalence relation (A) transitive only
25. Sis relation over the set R of all real numbers and it is given by (a,b) << ab >0.
Then, Sis
(a) symmetric and transitive only (b) reflexive and symmetric only
(©) antisymmetric relation (d) an equivalence relation
26. Inthe set Z of all integers, which of the following relation R is not an equivalence relation?
(@) xRy:ifxsy (b) xRy:ifx =y
() xR
x-yisaneveninteger (d) x Ry: if x sy (mod 3)
ee The number of possible symmetric relations on a set consisting of 4 elements is
(a) 512 (b) 1024 (c) 256 (a) 32
28. The smallest equivalence relation (i. the relation with the least number of elements)
defined on the set {4, 5) is
(a) {} (b) {(4,5)) (©) (44),5,5)) @) (45), 6,4)
29. Let A ={x, y, 2}. The relation on A which is not an equivalence relation is
(a) ((x, 2), (y, y), (2) (b) (Cx, 99, (y, Ye 2). (Ye DE
(©) (x, 2, (y, y), @,2) (y, 2), 2 W)} (A) ((x, 9), (ve Wh .
30, LetT be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as
Rb if ais congruent tob for all a,b eT. Then, R is
(a) reflexive but not symmetric (b) transitive but not symmetric
(©) equivalence (d) none of these
51. Consider a non-empty set consisting of children ina family and a relation R defined as aR
if ais brother of b. Then, R is (a) symmetric but not transitive (b) transitive but not symmetric
(c) neither symmetric nor transitive (d) both symmetric and transitive
32. Forreal numbers xand y, define x R yiffx—y+ ¥2is an irrational number. Then the relation
Ris
(a) reflexive (b) symmetric (c) transitive (d) none of these
33. Let A =(3, 5}. Then the number of reflexive relations on A is
2 (b) 4 () 0 (d) 8
[CBSE 2023)
34, Let R be a relation in the set N given by R =((a,b):a=b-2,b >6)}.Then
= @EBNER WG 8ER —((3,8)ER —(d) (2, ER
{CBSE 2023)
Each of the following questions contains STATEMENT-1 (Assertion) and STATEMENT-2
(Reason) and has following four choices (a), (b), (c) and (4), only one of which is the correct
answer. Mark the correct choice.
(a) Statement-1 is true, Statement-2 is true; Statement-2 is a correct explanation for statement-1
(b) Statement-1 is true, Statement-2 is true; Statement-2 is not a correct explanation for
statement-1.
(©) Statement-1 is true, Statement-2 is false. .
(d) Statement-1 is false, Statement-2 is true.
35, Statement-1(A): Let A and Bbe two sets having m and n elements respectively, then the
~ number of relations form A to Bis 2””.
Statement-2(R): A relation from A to Bis a subset of Ax B.
36, Statement-1 (A): Let A be a set consisting of n elements. The number of reflexive
relations on A is 27"),
Statement-2(R): A relation on set A is a non-empty subset of Ax A.
|37, Statement-1 (A): The number of reflexive relations on set A ={1,2, 3.43382”
Statement-2 (R): ee ae of reflexive relations on a set A consisting of elements
antn-1),
38, Statement-1(A): The number of reflexive relations on a set A consisting of elemen's
gon,
Statement-2(R): A relation R on set A is reflexive if (a, a) € R for alla f(x) =c0s3x+.cos(-4x) = cos 3x+.cos4x => (3) =c0833 +008 2n=0+1=1
EXAMPLE4 If f(x) =cos [e] x + cos [-e] x, then 3) 5
1 1
(a) 1 (b) 0 © ny (d) a
Ans. (d)
SOLUTION We havee ~ 2.71
(2%) = 00s [e] x + cos [-e]x = cos 2x + cos (-32) = cos2x+ cos 3x
® By og 3B __ 1
> 3)nonk sont
EXAMPLES Let f :[2, 00) + R be the function defined by f(x) =x? —4x +5. Then the range of fis
(aR (b) f1, ») (©) [4, «) (d) B,~)
Ans. (b) INCERT EXEMPLAR]
SOLUTION We have, f(x) = 1? -4x +5 =(x-2)? +1
Now, xe[2,0) = 1-220 = (x-2)? +121 = f(a)21 = f(x) fl, «)
Hence, range(f) =[1, «).
ALITER We have, f(x) =x? -4x+5_ for alll x €[2, «)
> fi(x)=2x-420 forall x €[2, 0)
> f(x) is increasing function on [2, ©) => Range (f) =[f(2), f(«)) =[1, «)
EXAMPLE 6 Let: R > R be defined by f(x) = x? + 1. Then, pre-images of 17 and —3, respectively, are
(@) 64,4) (b) (3, 31,6 (©) (4,4), 6 (a) 4, 4), -2,3
mes (0) {NCERT EXEMPLAR]
SOLUTION Let the pre-images of 17and-3bea andb respectively, This means that the images
of and b are respectively 17 and - 3.
ie. f(a) =17 and f(b) = -3.
= 241217 and 6? +1=-3 => a=44 and b? +1 =~ 3is not possible for any € R.
Thus, the pre-images of 17 and ~ 3 are {~4, 4) and respectively. EXAMPLE7 Let N be the set of natural numbers and the function f : N -» N be defined by f(n) =2n+ 3
‘Sor alln e N. Then, fis
(a) surjective (b) injective (c) bijective (d) none of these
Ans. (b) INCERT EXEMPLAR}
SOLUTION Letm,neN be such that f(m) = f(n). Then,
fim) =f(n) > 2m+3=2n+3=>m=n
So, f :N - Nis injective.
Let nbe any natural number. Then, n21 => 222 => 2n+325 = f(n)25
Thus, range (f) = 6, 7, 9,..] # Co-domain = N. So, f :N ~> Nis not surjective,
EXAMPLES The equivalent definition of f : R -{0) -> R given by fo) tli
(@)_ f(x) =0 for all x € R10} (b) f(x) = -2 for all x eR -(0}
0,
© foy={ 3" rao (@) fe -{ pea
Ans. (c)
SOLUTION We know that: [sl={_* 225
fay Fad <0, x90
Iz] ]#-C4) veo
x
EXAMPLE If f(x) =4x3 + 322 + 3144, then x3f ‘a
x
2
@ fa f()-S+3 4642 287(L)-4e ace ae ear? =o
EXAMPLE 10 Let f : R > R be defined as f(x) = 2x +| x|, then f(2x) + f(-2)~ (2) =
(a) 2x (b) 2] x| (0) -2x (a) -21 x1
Ans. (b)
SOLUTION f(2x) + f(-x) ~ f(x) = 2 (2x) +| 2x|-+(-2x) +|-x] (2x +13)
= 4x +2|2x|-2x4] x] -2x-[x]=2/ a1
EXAMPLE 11 Let f : R -+ R be defined by f(x) = for all x eR. Then, f is
——— x
(a) one-one (b) onto (©) bijective (A) not defined
Ans. (d) [NCERT EXEMPLAR]
SOLUTION We find that f(x) is not defined at x = 0.So, option (d) is correct. EXAMPLE? Let f:R-(0 ~ R be defined by f(x) = 2. Then fis
(a) one-one (b) onto (©) bijective (d) not defined
Ans. (a)
SOLUTION For any x, y € R -(0}, we find that: fax) fly t= => x =y. So, f is one-one.
x
Sie
Forany x €R-(0) f(x) =y=> Lays x=}, since x # 0. So, y takes all real values except 0. So,
y
Range (f) = R -(0) # co-domain. Hence f is not onto.
EXAMPLE 13 Let A =(0, 1) and N be the set of natural numbers. Then the mapping f : N -» A defined
Byte) 0, f(a =1forallnN, is
(a) one-one (b) onto (©) a bijection (d) one-one but not onto
Ans. (b) [NCERT EXEMPLAR]
SOLUTION The mapping f relates all odd natural numbers to 0 and all even natural numbers
to 1. So, it is not one-one. But, it is onto because range (f) =(0, 1) = A.
RXAMPLEM4 Let A ={1, 2, 3,......,n} and B =(a, b}. Then the number of surjections from A into B is
(a) "P, (b) 2"-2 (©) 2"-1 (d) none of these
Ans. (b) [INCERT EXEMPLAR]
SOLUTION Each element of set A can be mapped to either a orb i.e. in two ways and there aren
elements in A.So, total number of functions from A to B is 2”. Out of these only two functions are
into one in which all elements of A are mapped to a and the other under which all elements are
mapped to b. Hence, the total number of onto functions is 2" -2.
a
ALITER Total number of onto function = }° (-1)?-" 7¢, 2" =— 701 + 2C, x2" =2"-2
r=1
EXAMPLE 15 If the set A contains 5 elements and set B contains 6 elements, then the number of one-one
‘mappings from A to B is
(a) 720 (b) 120 oe (a) 56
Ans. (a)
SOLUTION The number of one-one mappings is equal to the number of ways of arranging 6
elements in B by taking 5 at a time, which is equal to °C; x5! =720.
EXAMPLE16 Ifthe set A contains 5 elements and set B contains 6 elements, then the number of one-one
and onto mappings from A to B is
(a) 720 (b) 120 0 (d) none of these
Ans. (c) (NCERT EXEMPLAR]
SOLUTION We find that the set B has more elements than the set A.So there cannot be an oxto
mapping from A to B. Hence, the number of one-one onto mappings is zero.
Which of the following functions from Z to Z is a bijection?
(b) g(x)=x+2 (©) f(x) =2x41 dd) f(xpexP 4d
Ans. (b)
SOLUTION f:Z -»Z given by f(x) =x° is an injective map but it is not surjective, because
range (f) ={0, +1, + 8, + 27,..) # Z (Co-domain). So, option (a) is not correct.
Function g: Z -» Z given by g(x) = x+2is one-one, because g(x) = g(y) => x+2=y+2> X=Y-
Itis also onto, because for any every y € Z (Co-domain) there exists y-2 ¢Z (domain) such that
S(y-2) =y.So, gis a bijection. Function h: Z > Z given by h(x) = 2x +1 is one-one, because
h(x) =h(y) > 2x+1=2y+l a x=y.
Itis not onto, because even integers in co-domain do not have there pre-images in the domain.
$:Z > Z given by $(x) = x? +1is many-one, because $(-2) = $(2).S0, option (d) is incorrect. Each of the following examples contains STATEMENT-1 (Assertion) and STATEMENT-2
(Reason) has following four choices (a), (b), (c) and (d), only one of which is the correct answer.
Mark the correct answer.
(a) Statement-1 is true, Statement-2 is true; Statement-2 is a correct explanation for Statement-1.
(b) Statement-1 is true, Statement-2 is true; Statement-2 is not a correct explanation for
Statement-1.
(c) Statement-1 is true, Statement-2 is false.
(4) Statement-1 is false, Statement-2 is true.
EXAMPLE 25 Statement-1 (A): If A and B are two sets having 3 and 5 elements respectively, then the
total number of functions that can be defined from A to B is
Statement-2(R): A function from set A to set B relates elements of set A to elements of
set B, Ans. (c)
SOLUTION A function from set A to Brelates every element of set A toa unique element in set B,
Consequently, statement-2 is not true.
Since, each element of set A can be associated to any one of five elements in B and there are 3
elements in set A.
Total number of functions from A to B=5x5x5=5°
So, statement-1 is true.
EXAMPLE 26 Statement-1(A): If two set X and Y contain 3 and 5 elements respectively, then 5c, «3!
one-one functions can be defined from X to Y.
Statement-2 (R): A one one function from X to Y relates different elements of set X to
different elements of set Y.
Ans. (a)
SOLUTION A one-one function from set X to set Y associates distinct elements of X to distinct
elements of Y. This can be done in 5C3 x 3! ways. Hence, 2c, x 3! one-one functions can be
defined from X to Y. So, statements-1 & 2 are true and statement-2 is a correct explanation for
statement-1.
EXAMPLE 27 Statement-1(A): Let A and B be two sets having m and n elements respectively such that
m Bisasurjection, then every element in B has a pre-image in A.
Ans. (d)
SOLUTION Since Bhas more elements than A. So,m elements in set A can be related to at most m
elements in B. Consequently, remaining (n — m) elements in B will not have their pre-images in A.
So, it is not possible to define an onto function from A to B. Hence, statement-1 is a false.
However, statement-2 is true. EXAMPLE 36 In two different societies, there are some school going students including boys as well as
girls. Raman forms two sets with these students as his college project. Let A ={a,, ay, @3, a4, a5} and
B=(by, by, bz, by}, where a;' s andb;'s are school going students of first and second society respectively.
Using the above information, answer the following questions:
(i) The mapping f =((41, 6), (42, 3), (a3, bo), (a4, bg), (45, b4)} associating students of first
society to the students of second society is
(a) one-one but not onto (b) only onto but not one-one
(c) one-one and onto both (d) neither one-one nor onto
(ii) The number of functions from A to B is
(a) 20 (b) 54 «4 (a) 5,
(iii) The number of functions from B to A is
(a) 20 (b) 54 () # (a) 5Py
(iv) The number of one-one functions from A to B is
(@) 5% (b) 54 © 4 (a) 0
(v) The number of onto function from A to B is
(a) 240 (b) 480 (c) 1024 (d) 512 SOLUTION (i) Ans. (b): We observe that f(a4) = f(as) =by and range (f) = B =co-domain.
So, f is many one onto function.
(ii) Ans. (c); Each element in A can be mapped to any element in B. So, each element in A canbe
mapped in 4 ways. There are 5 elements in A.So, number of functions from A to Bis 4°.
(ii) Ans. (b): The number functions from B to A is (n(A))""®) j,e.54.
(iv) Ans. (d): Set A has more elements than set B. So, one-one functions cannot be defined from
AtoB.
4
(v) Ans.(a): Number of onto functions from A to B= 5) (-1)4-? 4¢,75 = 240.
rel
EXAMPLE 37 _ An organization conducted bike race under 2 different categories — boys and girls. Totally
there were 250 participants. Among all of them finally three from Category 1 and two from Category 2
‘were selected for the final race. Ravi forms two sets B and G with these participants for his college project.
Let B = (by, by, ba} G = [gy 89} where B represents the set of boys selected and G the set of girls who were
selected for the final race.
Fig. 2.5
Ravi decides to explore these sets for various types of relations and functions
Ravi wishes to form all the relations possible from B toG. How many such relations ae posible?
(a) 26 ) 2 © 0 (a) 23
(Gi) Ravi wants to know among those relations,
how many functions can be formed from B to G?
(a) 2? (b) 22
© ? (a 23
(il) Let FB > G be defined by f =((by, gy) (bo. 82), (ba, gh then fis
(a) injective (b) surjective
(c)_neither surjective nor injective (d) surjective and injective
(iv) Ravi wants to find the number of injective functions from B to G. How many numbers of injective
{functions are possible?
(a) 0 (b) 21 (©) 3!
(v) The number of surjective functions from B to G is
(d) OF fa) 8 (b) 6 (© 4 (a) 64 [CBSE 2023]
SOLUTION (i) Ans. (a): Number of relations from B to G = 23%? = 29,
(i) Ans. (d): Number of functions from B to G = (n(G)}"") =23
(ii) Ans. (b): We observe that f(b,) = f(b3) = g, and range (f) =G (co-domain). Therefore, f is
surjective but not injective.
(iv) Ans. (a): We find that set B has more elements than set G.So, a one-one function cannot be
defined from B to G.
2
(v) Ans. (b): The number of surjections from B toG is ¥° (-1)2"f r32c, =-2+29 =6
fel
EXAMPLE 38 Raji visited the exhibition along with her family. The exhibition had a huge swing, which
attracted many children. Raiji found that the swing traced a parabolic path given by y = x2.
: Fn - a
Se a
Answer the following questions using the above information.
(i) Let f :R + R be defined by f(x) = 3? is
(a) neither surjective nor injective (b) surjective
(0) injective (d) bijective
(ii) Let f :N +N be defined by f(x) = 2? is
(a) surjective but not injective (b) surjective
(6). injective (A) bijective
(ii) Let f (1,2, 3,..) 411, 4, 9, «4 be defined by f(x) =x? is
(a) bijective (b) surjective but not injective
(c)_ injective but surjective (d) neither surjective nor injective
(iv) Let f:N > N be defined by f(x) = x, Range of the function among the following is
(a) {1,4,9, 16, ...) (b) (1,4, 8,9, 10,...1(¢) (1,4, 9, 15, 16...(d) (1,4, 8, 16, ...} EXAMPLE 39_ Port Blair, the capital city of Andaman and Nicobar Islands is directly connected to
Ghennai and Vishakapatnam via ship route. The ships sail from Chennai/Vishakapatnam to Port Blair
and vice versa, Swaraj Dweep and Shaheed Dweep are two popular tourist islands in Andaman Islands
One has to take a ferry from Port Blair to reach these islands. There are ferries that sail frequently between
the three islands - Port Blair (PB), Swwaraj Dwweep (SwD) and Shaheed Dweep (ShD). Shown below is a
schematic representation of the ship routes and ferry routes.
A Visakhapatnam
Visahkapatnam Hale C
Kahit isahkapatnam
ran waa Port Blair
Vijawwada Bhimavaram Shahees
Guntur
Ongale
reg _
Nayagarh
Nelion
ee
Channa
aed
Fig. 2.7
X is the set of all 5 places and Y is the set of 3 places in Andaman Islands. That is,
X={C, V, PB, SwD, ShD} and Y = (PB, SwD, ShD}.
A relation R defined on the set X is given by,
R =((x1, x2): there is a direct ship or direct ferry from x, to Xp)-
A function f : Y + X is defined by, f(PB) = V, f(SwD) = PB, f(ShD) = SwD. (i) List all the elements of R, (Gi) Is the relation R symmetric? Give a valid reason.
(iii) Is the relation R transitive? Give a valid reason.
SOLUTION (i) R ={(C, PB), (PB, C), (V, PB), (PB, V), (PB, SwD), (SwD, PB), (PB, ShD),
(ShD, PB),(SwD, ShD), (ShD, SwD)
(i) We find that
(x1, x2) ER
= There is direct ship or ferry from x, to x)
> There is direct ship or ferry from xp to x => (x2,%) €R
So, Ris a symmetric relation.
(iii) We observe that there is direct ship from Chennai to Port Blair and there is direct ferry from
Port Blair to Swaraj Dweep. But, there is no direct ship or ferry from Chennai to Swaraj Dweep
ie. (C, PB) € R and (PB, SwD) € R, but (C, SwD) ¢ R. Hence, R is not transitive.
(iv) The function f:y -» X can be represented by Venn diagram as ¥
shown in Fig. 2.8.
Clearly, f : y > Xis a one-one function but it is not onto asC and ShD
do not have their pre-images under f.
‘Mark the correct alternative in each of the following:
_1. The function f : N + N given by f(x) = 3xis
(a) one-one and onto (b) one-one but not onto
(c) many one onto (d) many one into
_2. The function f: R > R given by f (x) =2x-3is
(a) one-one onto (b) many-one onto
(c) one-one into (d) many one into
3. Let f:R + R be defined by f(x) =x*. Then, f is
(b) many-one onto
(d) many one into
(a) one-one onto
(c) one-one but not onto
4. Which of the following function from R to R is one-one function?
(@) fix) =e* @) s@)=e —(O Ma)=siny —(€) Ha) =cose
5. The range of the function f: R -» R given by f(x) =x~[s]is
@) (0,11 () Rk (©) R-Z (@) (0.1)
6 Let f:R -» R be a function defined by f(x) =x? +1, then f is
7 (a) injective but not surjective (b) surjective but not injective
(6) bijective (d) neither injective nor surjective
2. Iff :13, ©) Bgiven by f(x) =x” ~6x + 14 is a bijection, then Bis equal to (@) 13.) (b) B,) 96% aoe
8. Let A=(1,2, 3,4) and B=(x,y,2,,u,0}. Then, the number of one-one functions from 4,
Bis
4
(a) 15 (b) 24 (c) 360 (a) iD
9. Let A= {1, 2,3, 4, 5) and B = (2, 4}. Then, the number of onto functions from A to B is
(a) 30 (b) 32 (©) 2% (4) 10
® ees
~ if xis even .
10. Let f :Z + Z be given by f(x) =4 2 . Then f is
ie 0, if x is odd
(a) one-one but not onto (b) onto but not one-one
(c) one-one and onto (d) neither one-one nor onto
11, Which of the following function from A =(x R :~1 Sx <1} to itself are bijections?
(@) fQ) =x () f(x) =sin eT (©) f(x) = sin * (4) none of these
12. Let f :[-1, 1] > [+1, 1] be defined by f(x) =x| x|.Then, f is
(a) abijection (b) an injection only
(©) asurjection only (a) neither an injection nor a surjection
13. The function f : R + R defined by f(x) =(x=1) (x-2) (x—3) is
(a) one-one but not onto (b) onto but not one-one
(©) both one-one and onto (a) neither one-one nor onto
14. If f:R > Ris given by f(x) = 3x5, then f-1(x)
_ 1 ae x45
(a) is given by ares. (b) is given by aon
(©) does not exist because f is not one-one (A) does not exist because f is not onto
15. If the function f : R -> R be such that f(x) =x—[2], where [x] denotes the greatest integer
less than or equal to x, then f(x) is
(a)
1
Pa (b) [x]-x (c) not defined (a) none of these
16. If the set A contains 7 elements and the set B contai
one-one functions from A to B is
(a) c, (&) Mcp x71 () 7°
17. Let f:R -{2} ~ Rbe defined by f(x) = 2 Then,
7
‘ins 10 elements, then the number of
(a) 107
@ MA=f) ©) MG)=-/0) © ffey=-—) (@ P= 50)
18. Let f:R ~ R be given by f(x) =x -3. Then, f-lis given by
(a) vx+3 (b) vx+3 (©) x+V3 (a) none of these
19. If f:R > Ris given by f(x) =x° + 3, then f(x) is equal to
@ 23-3 49 | a-aY9 HH”
20. Let f(x) = x° be a function with domain (0, 1, 2, 3}, Then the domain of fis (a) (3,2,1,0) (b) {0,-1,-2,-3} (©) {0,1,8,27) — (d) (0,-1,-8,-27}
21. Let f(x) =x? and g(x) = 2". Then, the solution set of the equation fog(x) = gof() is
fa) R (b) {0} (c) (0,2) (d) none of these
a total number of functions from set A = {1, 2, 3} to the set B=(x, y,z, His
(a) 34 (vb) 43 (c) 3x4 (a) 234
23. If f:R — (0, ») is given by f(x) = 3°, then f(x) =
(a) 3* () x3 (©) log3x (d) log, 3
24, Iff:R > Ris defined by f(x) =2x~3, then f(f(x)) is equal to
(a) 2x+3 (b) 3x+2 (c) 4x49 (d) 4x-9
25, If the mappings f:{1, 2, 3,4) > (2,5,7,9} and g:(2,5,7,9 >[1, 2,4) are given by
f =((1, 9), (2,7), (3,5), (4, 2)} and g = ((2, 1), (5, 2), (7, 1) (9, 4)}, then fog =
(a) {(2,9), 5, 7), (7, 9), (9 2)) (b) {(2,7), G, 3), (7, 2), (9,
(©) (0,4), 2,1),3,2), 4, DI (d) none of these
26. Let f(x) = ea x #-1.Then, for what value of a is f(f(x)) =x?
(@)1 (b) -1 (©) 0 (d) none of these
27. fA -{o, ree x and f : A B, defined as f(x) = sin 2x is a surjection, then B =
(@) {oa 3} () {0-193 © {oa} (a) none of these
28. If f(x) =ax +b, 9(x) =cx +d, then fog(x) =(gof) (x) iff
(a) f(@ =o) ) f® =8(0 © f=) @) fO=3a)
2. If ¢= ((1, 1), (2,3), (3, 5), (4, 7)) is described by the formula g(x) = ax +B, then (ct, B) =
(a) (2,1) (b) (2,-1) © 1) @) (2-1)
30. Let f be an injective map with domain (x, y, 2 and range {1, 2, 3} such that exactly one of the
following statements is correct and the remaining are false: f(x) =1, f(y) #1 f() =2
Then, f =
(a) {(x, 2), (y, 1), @, 3)} (b) {(x, 1), (y, 2), @ 3)}
(©) {(x, 3), (y, I, @ 2) (d) {(x, 2), (y, 3, @ DI}
31. Let there bea set Sconsisting ofnelements. Then, the number of functions from Sx Sto Sis
(a) n@ (b) 1" mn (@)
32. Two finite sets A and B have n and 2 elements respectively. The total number of relations
from A to Bis 56 more than the total number of function from A to B. Then the value of ris
(a) 3 (b) 5 () 7 (d) 9 40. Statement-1(A): Let A and B be two finite sets having m and n elements respectively
a such that m Bis a one-one function iff distinct elements of set A
are mapped to distinct elements of set B.
41. Statement-1 (A):
Let A and B be two finite sets having m and n elements respectively.
Then, the number of functions from A to B isn”.
Statement-2(R): _ Every function from set A to set B is a subset of A x B.
42, Statement-1 (A):
A function f : A + B cannot be an onto function, if (A)