CHAPTER

RELATION

REVISION OFKEY CONCEPTS AND FORMULAE

1. Let Aand Bbe two non-empty sets. The set of all ordered pairs of the form (a, b) such that
aeA andbeBiscalled the cartesian product of set Awith set Band is denoted by Ax B.
i.e. Ax B={(a, b):aeA, be B
Note that Bx A=(6, a) :b e B, a e A) and AxB=¢, if A=¢or B=
Ifset Ahas melements and set Bhas nelements, then the setAx B has mn elements.
2. Let A and Bbe two sets. Then a relation R from set A to set Bis a subset of Ax B.
IfA and Bare finite sets consisting of mand nelements respectively, then Ax Bhas mn
ordered pairs and hence 2 relations can be defined from Ato B.
The set of first comnponents of the ordered pairs belonging to R is called the domain of R
and the set of second components of the ordered pairs belonging to Ris called the range of
relation R

ie. Domain (R)=(a:(a, b) e R] and Range (R) =(b:(a, b) e R}

Clearly, Domain (R)cA and Range (R) c B.
A relation from Bto Aobtained by interchanging the components of ordered pairs of a
relation R from A to Bis called the inverse of relation R and is denoted by R
ie. R-={(6, a):(a, b) e R}.
Clearly, Domain (R) =Range (R) and Range (R ) =Domain (R):
A relation from a non-empty set Ato itself i.e. a subset of A x A is called a relation on set A.
Let A be non-empty set. Then cAxA is called the void or empty relation on A and
AxAcAxA is called the universal relation on A.
3. IDENTITY RELATION Let A be a set. Then, the relation I ={(a, a) :ae A) iscalled the identity
relation on A.
i.e. a relation I onAis called the identity relation if every element of Ais related to itself
only.
4. REFLEXIVE RELATION Arelation Ron a set Ais said to be a reflexive relation ifevery element of Ais
related to itself.
Thus, R is reflexive on set A iff (a, a) e R for all ae A. The identity relation on a set A is
always reflexive but a reflexive relation on A need not be the identity relation.
5, SYMMETRIC RELATION A relation R on a set A is said to be a symmetric relation iff
(a, b) eR (6, a) eR for alla, be A. i.e. aRb’ bRa for all a, beA.
The identity and the universal relations on a set are symmetric relations.
A relation R on a set A is symmetric iff R = R
 MATHEMATICS-X
transitive
1.2 set A1s a relation if
bRc’ aRc for all a,
non-empty
relation R on a and b, cEA.
RELATIONS A ceR. ie. aRb
6. TRANSITIVE (a,c) eRfor all a, b, relatione
b) e Rand (b, c) eR’ set are transitive
(a, on a non-void
universal relations
identity and the non-void set Ais said to be an antisymmetric
The relation Ron a
A
RELATION A.
R’a=b forall a, b e
ANTISYMMETRIC
7.
relation if(a, b) e R
and (b, a) e to be an equivalence relation on Aifitis:
RELATION Arelation
Ron asetAis said
EQUIVALENCE
8.
eRforall a eA.
() reflexive ie. (a, a) eR’ (b, a) e Rforall a, b e A and,
b) b, ce A.
() symmetric i.e. (a, e Rand (b, c) e R (a, c) eR for all a,
(i) transitive i.e. (a, b) a set A, partitions the
set Ainto pairwise
disjoint
equivalence relation R defined on determined by relation R.
An called equivalence classes
subsets. These subsets are element a eA is
denoted by
la] ie.
A related to an
The set of all
elements of
correspondng to every element in &
equivalence class and
la<=(xe A:(x, a) e R). This is an equivalence classes are
either identical or disjoint.
class. Any two
there is an equivalence
classes forms a partition of set A.
The collection of all equivalence n distinct elements. Then. eve.
a finite set consisting of
9. Let A ={a, ag, a3, .., 4l behave at leastnordered pairs (41, ay), (a2, ag) , (4n 4) and any
reflexive relation on A must
pairs from the remaining n-n ordered pairs. So, the least number of
number of ordered
Every equivalence relation onA isreflexiye
ordered pairs in a reflexive relation on Ais n.
more ordered pairs.
therefore, every equivalence relation has n or
set are respectively the smallest and
10. The identity relation and the universal relation on a
largest equivalence relations on it.
consisting of n
11. Let there be N ordered pairs in an equivalence relations on afinite set A
elements. Then, n sNSn.
has
12. Let A =(a,ay, ag, .., 4) be a finite set consisting of ndistinct elements. Then, AxA
following n ordered pairs:

Any reflexive relation on set Amust have n

ordered pairs in the diagonal in the ap
arrangement and any number of ordered pairs
from the remaining (n-n) ordered pairs.
This can be done in gn-n ways. So, the
number of reflexive relations on Ais2-n
RELATIONS 1.3

In a symmetric relation on Athere can be any number of ordered pairs from the ordered
pairs lying on or below the diagonal in the above arrangement. The number of these
n-n n+n
ordered pairs is
2
+n=
2
Anynumber of ordered pairs can be chosen from these
n+n 2+n
ordered pairs in 2 2 ways.So, the number of symmetric relations on Ais 2 2 .
SOLVED EXAMPLES

MULTIPLECHOICE QUESTIONS (MCQs)

EXAMPLE 1 Let Rbe a eflexive relation on aset Aand I be the identity relation on A. Then,
(a) R=I (b) RcI (c) IcR (d) RI
Ans. (c)
sOLUTION The identity relation is always a reflexive relation but a reflexive relation need not
be the identity relation. Forexample, 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)).
EXAMPLE 2 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 Risnot reflexive because I ¢ R. We find that (2, 3) e R but (3, 2) R.So, Ris not
symmetric. We also observe that (1, 3)e Rand (3, 1) e Rbut (1, 1) e R. So, Ris not transitive.
EXAMPLE 3 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
(c) reflexive and transitive only (d) an equivalence relation
Ans. (c)
SOLUTION We find that the identity relation I on Ais a subset of R. So, it is reflexive on A. We
also observe that (6, 12) eR but (12, 6) e R. Therefore, Ris not symmetric. It can be checked that
Ris transitive. Hence, R is reflexive and transitive only.
EXAMPLE 4 Let Rbe arelation on the set Ngiven by R=((a, b) :a =b-2, b>6}. Then,
(a) (2, 4) eR (b) (3, 8) eR(c) (6,8) R e ( d ) (8,7) e R
Ans. (c) [NCERT]
SOLUTION If a=6and b =8, then a =b-2 and b>6. Therefore, (6, 8) e R. So, option (c) is
correct.

EXAMPLE5 Let A={1, 2, 3) and consider the relationR={(1,1), (2, 2), (3, 3), (1,2), (2, 3), (1, 3)}.
Then R is
(a) reflexive but not symmetric (b) reflexive but not transitive
(c) symmetric and transitive (d) neither symmetric nor transitive.
Ans. (a) [NCERT EXEMPLARI
sOLUTION We find that A ={1, 2, 3} and (1, 1), (2, 2), (3, 3) eR.So, R is reflexive. Clearly,
(1, 2)e R but (2, 1) eR. So,Ris not symmetric. Ris a transitive, because (1, 1) eR and (1,2) eR
»(1,2) e R; (2, 2) e R and (2, 3) eR ’ (2, 3) e R;(1, 2) e R and (2, 3) eR (1, 3) e R;
(1, 2) e Rand (2, 2) eR ’ (1, 2) e R; (2, 3) e R and (3, 3) eR (2, 3) e R; (1, 3) eR and
(3, 3) e R»(1,3) e R. Hence, R is reflexive and transitive but not symmetric.
EXAMPLE6 Ifa relation Ron the set A ={1,2, 3) be defined by R =(1, 2)), then R is
(a) reflexive (b) transitive (c) symmetric (d) none of these
Ans. (b) INCERT EXEMPLAR]
1.4 MATHEMATICS-XI|

SOLUTION Given that A=(1,2, 3). Therefore, for relation R to be reflexive,

it should contain
R but (2, 1) R.So, itis
(,1), (2, 2) and (3, 3). But, it does not. So, itis not reflexive. Since (1, 2) e any other ordered
not symmetric. R is transitive as it contains (1, 2)only and does not contain
pair beginning with 2.
EXAMPLE7 Let A =(1,2, 3). Then the number of relations containing (1, 2) and (1,
3) which are
reflexive and symmetricbut not transitive is
(a) 1 (b) 2 (c) 3 (d) 4
[NCERT EXEMPLAR]
Ans. (a)
which is reflexive and
SOLUTION The smallest relation R containing (1, 2) and (1, 3)
is not transitive as
symmetricis R =((1, 1), (2, 2), (3, 3), (1, 2), (1, 3), (2, 1), (3, 1). Clearly, it (3,
(2, 3) or 2), thenR is not
(3, 1), (1, 2) e R but (3, 2) R. Ifwe add one of the ordered pairs
symmetric. So, to make it symmetricwe have to add both (2, 3) and
(3,2) to R1. The new relation
is the largest relation i.e. the universal relation on Awhich is reflexive,symmetric and transitive.
Hence, there is only one relation R which is reflexive and symmetric
but not transitive.
EXAMPLE 8 The maxinmum number of equivalence relations on the set A =(1,2,3} is
(c) 3 (d) 5
(a) 1 (b) 2
Ans. (d)
[NCERT EXEMPLAR]
identity relation
SOLUTION The smallest equivalence relation on A =(1, 2, 3) is the
also add (2, 1) to make the
I ={(1,1), (2, 2), (3, 3)). If we add ordered pair (1, 2) to Ia we must obtained is transitive
relation symmetric. The relation R, ={(1, 1),(2, 2), (3, 3), (1, 2), (2, 1)} so
also and hence it is an equivalence relation on A. Similarly,by adding (2, 3) (3, 2) to I , we obtain
R ={(1, 1), (2, 2), (3, 3), (2, 3),(3, 2)} an equivalence relation on A. By adding (1,on3)A.and (3, 1) to
relation If we add
I , we obtain R ={(1, 1), (2, 2), (3, 3), (1, 3), (3, 1)) as an equivalence symmetric
(1,2) and (2, 3), then we must also add (2, 1), (3, 2) (1, 3) and (3, 1) to make the relation 5
and transitive. The relation so obtained is the universal relation. Hence, in all there are
equivalence relation on set A =(1,2,3).
EXAMPLE9 Let A ={1,2,3). Then the number of equivalence relations containing (1, 2) is
(a) 1 (b) 2 nd (c) 3 (d) 4
Ans. (b) [NCERT, CBSE 2020]
sOLUTION As discussed in Example 8, the equivalence relations containing (1,2) are
I) (1,1),(2, 2),(3,3), (1,2),(2, 1) and (i) {(1, 1),(2, 2),(3,3). (1, 2),(2, 1), (1, 3),(3, 1),(2,3), (3, 2).
EXAMPLE 10 Let us define a relation Son set R of all real numbers by the rule aRb ifa zb. Then, Rs
(a) an equivalence relation (b) reflexive, transitive but not symmetric
(c) symmetric, transitive but not reflexive (d) neither transitive nor reflexive but symmetric
Ans. (b) [NCERT EXEMPLARI

SOLUTION For any aeR, a2ais true. Therefore, (a, a) e Sfor all a e R. So, Sis reflexive.
Let a, b,ceR such that(a, b) e Sand (b, c) e S. Then,
a2b andb c ’ a2c ’ (a, c) e S
So, S is transitive on R.
Sis not symmetric because7 3but 3 7 ie. (7,3)e Sbut (3, 7) eS.
Hence, Sis reflexive and transitive but not symmetric.
EXAMPLE 11 Let Rbe a relation on the set N of naturalnumbers defined by nRn iffn divides m. Then, Ris
(a) reflexive and symmetric (b) transitive and symmetric
(c) equivalence (d) reflexive, transitive but not symmetric.
Ans. (d) [NCERT EXEMPLAR)
RELATIONS 1.5

SOLUTION For any natural number n, ndivides itself is true. Therefore, ndivides nfor allneN
and hence (n, n) eR for all n e N. So, R is reflexive. We know that 2 divides 6 but 6 does not
divide 2i.e. (2, 6) e R but(6, 2)e R. So,Ris not symmetric.
Let m,n, peN such that m, neR and (n, p) e R. Then,
(m, n) e Rand (n, p) eR mdivides nand ndivides p ’ mdivides p (m, p) eR
So, R is transitive. Hence, option (d) is correct.
EXAMPLE 12 Let Ldenote the set of allstraight lines ina plane. Let a relationR be defined by lRm ifflis
perpendicular to mfor all l, meL. Then Ris
(a) reflexive (b) symnetric (c) transitive (d) none of these
Ans. (b) [NCERT EXEMPLARJ
SOLUTION Astraight line in a plane cannot be perpendicular to itself. Therefore, (!, I) e Rfor
any le L. So, R is not reflexive.
Let (l, m) e R. Then, 1lmmll» (m, ) eR. So, Ris symmetric.
Now, let , m,n e Lsuch that (!, m) eR and (m, n) e R. Then,
1I m and mln ’lis parallel to n’ (,n) 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
(c) symmetric, but neither reflexive nor transitive (d) 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) eR,(2, 1) eR but(1,1) R.
EXAMPLE 14 IfA =(1, 2, 3), then which of the following relations are equivalence relation on A?
(a) RË={(1, 1),(2,2), (3, 3)) (b) Rz =(1,1), (2,2), (3, 3), (1,2),(2, 1)
(c) Rg ={(1, 1), (2, 2), (3, 3), (2, 3), (3, 2)} (d) R, R and R3
Ans. (d)
SOLUTION Relation Ris the identity relation on Aand hence it is an equivalence relation on set
A. Relations R, and Rg are also equivalence relations on A. Hence, option (d) is correct.
EXAMPLE 15 For any two real numbers a and b, we define aRb iff sina+ cosb =1. The relation Ron
the set R of all real numbers is
(a) reflexive but not symmetric (b) symmetric but not transitive
(c) transitive but not reflexive (d) an equivalence relation
Ans. (d)
SOLUTION For any real number a, we have
sina +cos a=1 ’ aRa for all aeR
So, R is reflexive.
For any a, b e R, we find that
aRb sin'a+ cosb=1’1-cosa+1-sinb=1’ sin2b+ cos? a=l bRa
So, Ris symmetric.
For any a, b,c e R,we find that
aRb and bRc’ sin a+ cos?b =1,sinb+ cos? c=1
’ sina+ cos?b +sinb+ cosc =1+1 > sin²a+ cos? c-1 > aRe
So, R is transitive. Hence, R is an equivalence relation.
 1.6 MATHEMATICS-XI
EXAMPLE16 Let Sbe the set of allreal numbers. Then the relationR((a, b) :1 + ab >0} on S is
(a) refleive and symmetric but not transitive. (b) reflexive and transitive butnot symmetric
(c) symmetric, transitive but not reflexive (d) reflexive, transitive and symmetric
Ans. (a)
Rfor all a eS.
SOLUTION For any ae S, we find that 1 +axa=1+a>0. Therefore, (a, a) e
So R is reflexive on S.
S.
Let a, be Ssuch that (a, b) eR1+ab>0’1+ba >0’ (b,a) e R. So,R is symmetricon
33 3 3
We find that
(GeR and (eR but(R as 1 0s, Ris not
+
transitive.
set of prime numbers less
EXAMPLE 17 IfA is the set of even natural numbers less than 8 and B is the
than 7, then the number of relations from Ato Bis (d) 29-1
(a) 2 (b) 92 () 32
Ans. (a)
3=9elements.
SOLUTION Itis given that A=(2, 4, 6) and B=(2, 3,5). Therefore, AxB has 3x
Hence, number of relations from A to Bis 2.
EXAMPLE 18 Let Wdenote the set of all words in the English dictionary. Define
the relation R by
relation R on W is
R=((x, y) eWx W:the words xand y have at least one letter in common}. The
(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 wordxin set W, x and x have all letters in common. Therefore, (x, x) eR.
Thus, (x, )eR for all x e W.So, R is reflexive on W.
Let (x,y) eR. Then,
(x, y) e R ’ Words x and y have at least one letter in common.
’ Words y and x have at least one letter in common (V,) eR
So, Ris 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.
EXAMPLE 19 Let Rbe a relation on the set Z of integers given by aRb > a=2b for some integer k.
Then, R is
(a) reflexive but not symmetric (b) symmetric and transitive but not reflexive
(c) reflexive and transitive but not symmetric (d) anequivalence relation
Ans. (d)
SOLUTION For any integer a,we can writea=2a. Therefore, aRa. Thus,aRa for allae Z. So, Ris
reflexive.
Let be Z such that
aRb ’ a=2-bfor some integer k b=27afor some integer k ’ bRa
Thus, aRb» bRafor all a, b e Z. So, Ris symmetric.
Let a, b, ceZ such that aRb andbRc.Then,
aRb ’ a=2-b and bRe’ b=2'cfor some k, leZ.
aRb and bRe» a=2'b and b=2'c a=2ktc> aRe
So, R is transitive. Hence, R is an equivalence relation.
RELATIONS 1.7

EXAMPLE 20 fR is arelation Z(set of all integers) defined by xRy if |x-y| <1, then Ris
(a) reflexive and symmetric (b) reflexive and transitive
(c) symmetric and transitive (d) an equivalence relation
Ans. (a)
SOLUTION Reflexivity: Let x be any integer. Then, | x-x =0<1 ’ xRx.
Thus, xRx for all xe Z. So, Ris reflexive.
Symmetry: Let x,y e Z such that
xRy >|*-yl<1» |-(y-)|<1 |y-x|<1 » yRx
Thus, xRy’ yRx for all x, y e Z. So, Ris symmetric.
Transitivity: We find that
and

So, R is not transitive.

EXAMPLE 21 The number of reflexive relations on a set Aconsisting of n elements is equal to
(a) z2 (b) n2 (c) 27(7-1) (d) n-n
Ans. (c)
SOLUTION Let A ={a,a,.., a,} be the set consisting of n elemnents. Then, each reflexive
relation onAmust have following nordered pairs: (41, a), (az, az),.. (an, 4,) and any number
of orderedpairs from the remainingn -n=n(n-1) ordered pairs. Any number of ordered pairs
from n(n-1) ordered pairs can be chosen in
na-DCo +nn-VC,+ n(n- DC, t..+ n(n-DChn-1) =2 mn-)ways
Hence, the number of reflexive relations on A is 2n(n-),
EXAMPLE 22 Let Rbe a reflexive relation on afinite set A
having n-elements and let there be mordered
pairs in R. Then,
(a) m 2 n p (b) msn (c) m=n (d) none of these
Ans. (a)
SOLUTION Asmentioned in Example 21, every reflexive relation on A must have nordered
pairs (a1, aq), (ag, ay) ., (4y an).So, the number of ordered pairs in Ris greater than or equal
to nie. m 2n.
EXAMPLE 23 The number of symmetric relations on set A ={1, 2, 3, 4) is
(a) 20roebl (b) 2° ) 212 (d) 216
Ans. (a)
n(7+1)
SOLUTION The number of symmetric relations on a set consisting of n elements is 2 2
Here, n=4. So, the number symmetric relations on set Ais 22*=20,
ASSERTION-REASON BASED MCQs
Each of the following examples contains STATEMENT-1 (Assertion) and STATEMENT-2
(Reason) and has the following four choices (a), (b), (c) and (d), only one of which is the correct
answer. Mark the correct choice.
(a) Statement-1 and Statement-2 are true; Statement-2 is a correct explanation for
Statement-1,
(b) Statement-1 and Statement-2 are true; Statement-2 is not a correct explanation for
Statement-1,
 MATHEMATICS-XI
1.8

(c) Statement-1 is True, Statement-2 is False.

(d) Statement-1 is False,Statement - 2 is True
relation R defined by
EXAMPLE1 Statement-1 (ASsertion): On the set Z of all odd integers e Zis an equivalence
(a, b) e R a-bis even for all a, b
relation.
and transitive, then it is
Statement-2 (Reason): Ifarelation R on a set A is symmetric
relation, because
reflexive and hence an equivalence
(a, b) e R’ (b, a) eR
(By symmetryl
transitivity]
:. (a, b) e Rand (b, a) eR’ (a, a) e R(By
Ans. (c)
statement-2 is a false. Because, relationR= {(a, a))
SOLUTION Clearly, statement-l is true. But,
defined on A = fa, b} is symmetric and transitive but
it is not reflexive.
on the set NxN defined by
EXAMPLE 2 Statement-1 (Assertion): The relation R c, de N is an
(a, b) R (c,d) > a + d =b+ c for all a, b,
equivalence relation.
is an
Statement-2 (Reason): The intersection of two equivalence relations on a set A
equivalence relation.
Ans. (b)
SOLUTION See Example 11 on page 1.18 and Theorem
1 on page 1.24 of class XII book.
EXAMPLE3 Statement-1 (Assertion): The relation R 0n the set NxN defined by
(a, b) R (c, d) a+ d =b +c for all a, b, c, d e N is an
equivalence relation.
Statement-2 (Reason): The union of two equivalence relations is an equivalence
relation.
Ans. (c)
SOLUTION Statement-1 is true. (See Example 11 on page 1.18of class XII book)
Statement-2 is false, because R=(a, a) (6, ), (c, c), (a, b), (o, a)) and, S=(a, a), (b, b). (c, c),
(6, c),(c, b)} are equivalence relations on set A- la, b, c}. But, RUSis not an equivalence relation
on A, because (a, b) e RUS, (6,c) eRuSbut (a, c) eRUS.
EXAMPLE4 Statement-1 (Assertion): fR is anequivalence relation on a set A, then Ris also an
equivalence relation.
Statement-2 (Reason): R=Riff Ris asymmetric relation.
Ans. (b)
SOLUTION Both statements are true. (See Theorem3 on page 1.25 and illustration5 on page 1.3
of class XI book)
EXAMPLE5 Let Rbe the set of real numbers.
Statement-1 (Assertion): relation
A={(*,ony)R.eRxR:y-xis an integer) is an equtvalence
Statement-2 (Reason): B={(x, y)¬RxR:x=a yfor some rational number a) is an
equivalence relation on R.
Ans. (c)
SOLUTION Reflexivity: For any x e R, we havex-x=0, which is an integer
(x,x) eA for allxeR A is reflexive relation on R.
Symmetry: Let (x, y) e A. Then,
x-y is an integer y-x is an integer ’ (y, x) eA
A is symmetric relation on R.
RELATIONS 1.9

Transitivity: Let (x, y) eA and (y, z) e A. Then,

X-yisan integer and y -z is an integer x-zis an integer ’ (x, z) eA
A is a transitive relation on R.
Hence, Ais an equivalence relation on R. So, statement-1 is true.
We find that: 0=0 x 2, where Ois a rational number ’ (0, 2) e B
But, 2 ax 0for any rational number a. Thus, (0, 2) e Bbut (2, 0) e B.
So, Bis not an equivalence relation on R. Hence, statement-2 is not true.
EXAMPLE 6 Consider the following relation R on the set of real square matrices of order 3.
R=((A, B):A=P BP for some invertible matrix P)
Statement- (Assertion): Ris an equivalence relation.
Statement-2 (Reason): For any two invertible 3x 3 matrices M and N
(MN) =N M-1
Ans. (a)
SOLUTION Reflexivity of R: For any square matrix Aof order 3, we find that
A =IAI, where I is invertible ’ (A, A) eR. So, Ris reflexive.
Symmetry of R: Let (A, B) eR. Then,
A= P BP for some invertible matrix P
B=PAP'=(P'AP'for some invertible matrix P-1
(B, A) e R
So, R is symmetric.
Transitivity of R: Let (A, B) eR and (B, C) e R. Then,
A =PBP and BQ'cO for some invertible matricesP and Q
A=P (QcÌ)P A=(QP)C(QP) » (A,C) eR ’ R is transitive.
Hence, Risan equivalence relation. Consequently,statement-1 is correct. Clearly, statement-2 is
also true. Also, we have used this statement for proving the correctness of statement-1.
Hence, statement-2 is a correct explanation for statement-1
CASE STUDY BASED MCQs

EXAMPLE 1 Ageneral election of Lok Sabha is a giganticexercise.About 911million people were eligible
tovote and voter turnout was about 67%, the highest ever.

ONE-NATION
ONE-ELECTION
FESTIVAL OF
DEMOCRACY
GENERAL ELECTION - MY VOTE
2019 MY VOICE
Fig. 1.1
Let Ibe the set ofall citizens of Indiawho were eligible to exercise their voting right in general election held
in 2019. Arelation 'R' is defined on I as follows:
R=((V,, V):V, V, el and both use their voting right in general election -2019)