MATHS

1. Sets and Relation

COMPETITION WINDOW

_______________________Sets & Relations_____________________ 1

 MATHS

2 _____________________Sets & Relations_______________________

 MATHS

_______________________Sets & Relations_____________________ 3

 MATHS

4 _____________________Sets & Relations_______________________

 MATHS

_______________________Sets & Relations_____________________ 5

 MATHS
RELATIONS
INTRODUCTION :

F Let A and B be two sets. Then a relation R from A to B is a subset of ×A  B.

thus, R is a relation from A to B R A  B.
Ex.1 If A = {1, 2, 3} and B = {a, b, c}, then R = {(1, b), (2, c), (1, a), (3, a)} being a subset of A × B, is a relation from A to B.
Here (1, b), (2, c), (1, a) and (3, a) R, so we write 1 Rb, 2Rc, 1Ra and 3Ra. But (2, b)  R, so we write 2 R b

F Total Number of Realtions : Let A and B be two non-empty finite sets consisting of m and n elements respectively.
Then A × B consists of mn ordered pairs. So, total number of subsets of A  B is 2mn.
Number of Non-empty subsets 2mn–1

 Domain and Range of a relation : Let R be a relation from a set A to a set B. Then the set of all first components
or coordinates of the ordered pairs belonging to R is called to domain of R, while the set of all second components or
coordinates of the ordered pairs in R is called the range of R.
Thus, Dom (R) = {a : (a, b) R}
and, Range (R) = {b : (a, b)  R}
It is evident from the definition that the domain of a relation from A to B is a subset of A and its range is a subset of B.
Ex.2 Let A = {1, 3, 5, 7} and B = {2, 4, 6, 8} be two sets and let R be a relation from A to B defined by the phrase "(x, y) 
R x > y". Under this relation R, we have
3R2, 5R2, 5R4, 7R2, 7R4 and 7R6
i.e. R = {(3, 2), (5, 2), (5, 4), (7, 2), (7, 4), (7, 6)}
 Dom (R) = {3, 5, 7} and Range (R) = {2, 4, 6}
F Inverse Relation : Let A, B be two sets and let R be a relation from a set A to a set B. Then the inverse of R, denoted
by R–1, is a relation from B to A and is defined by
R–1 = {(b, a) : (a, b) R}
Clearly, (a, b) R (b, a) R–1
Also, Dom(R) = Range(R–1) and Range (R) = Dom (R–1)
Ex.3 Let A be the set of first ten natural numbers and let R be a relation on A defined by (x, y) R x + 2y = 10, i.e. R = {(x,
y) : x  A, y  A and x + 2y = 10}. Expre ss R and R –1 as sets of ordered pairs. Determine also
(i) domain of R and R–1 (ii) range of R and R–1

10  x
Sol. We have (x, y) R x + 2y = 10 y = , x, y A
2
where A = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}

10  1 9
Now, x = 1 y = = A.
2 2
This shows that 1 is not related to any element in A. Similarly we can observe. that 3, 5, 7, 9 and 10 are not related to
any element of A under the defined relation
Further we find that :
10  2
For x = 2, y = = 4  A  (2, 4) R
2
10  4
For x = 4, y = = 3  A  (4, 3) R
2
10  6
For x = 6, y = = 2  A (6, 2) R
2
10  8
For x = 8, y = = 1  A (8, 1) R
2
Thus R = {(2, 4), (4, 3), (6, 2), (8, 1)}
 R–1 = {(4, 2), (3, 4), (2, 6), (1, 8)}
6 _____________________Sets & Relations_______________________
 MATHS
Clearly, Dom(R) = {2, 4, 6, 8} = Range(R–1)
and Range (R) = {4, 3, 2, 1} = Dom(R–1)

TYPES OF RELATIONS :

In this section we intend to define various types of relations on a given set A.

(1) Void Relation : Let A be a set. Then  A × A and so it is a relation on A. This relation is called the void or empty
relation on A.

(2) Universal Relation : Let A be a set. Then A × A A × A and so it is a relation on A. This relation is called the universal
relation on A.

(3) Identity Relation : Let A be a set. Then the relation IA = {(a, a) : a A} on A is called the identity relation on A.
In other words, a relation IA on A is called the identity relation if every element of A is related to itself only.
Ex.4 The relation IA = {(1, 1), (2, 2), (3, 3)} is the identity relation on set A = {1, 2, 3}. But relations
R1 = {(1, 1), (2, 2)} and R2 = {(1, 1), (2, 2), (3, 3), (1, 3)} are not identity relations on A, because (3, 3) R1 and in R2 element
1 is related to elements 1 and 3.
(4) Reflexive Relation : A relation R on a set A is said to be reflexive if every element of A is related to itself.
Thus, R on a set A is not reflexive if there exists an element A A such that (a , a)  R.
Ex.5 Let A = {1, 2, 3} be a set. Then R = {(1, 1), (2, 2), (3, 3), (1, 3), (2, 1)} is a reflexive relation on A.
But R1 = {(1, 1), (3, 3), (2, 1), (3, 2)} is not a reflexive relation on A, because 2 A but (2, 2) R1.

Note : Every Identity relation is reflexive but every reflexive ralation is not identity.

(5) Symmetric Relation : A relation R on a set A is said to be a symmetric relation iff

(a, b) R (b, a) R for all a, b A
i.e. a R b bRa for all a, b, A.
Ex.6 Let L be the set of all lines in a plane and let R be a relation defined on L by the rule (x, y)  R
x is perpendicular to y. Then R is a symmetric relation on L, because L1 L2 L2 L1
i.e. (L1, L2) R (L2, L1) R.
Ex.7 Let A = {1, 2, 3, 4} and Let R1 and R2 be realtion on A given by R1 = {(1, 3), (1, 4), (3, 1), (2, 2), (4, 1)} and R2 = {(1, 1),
(2, 2), (3, 3), (1, 3)}. Clearly, R 1 is a symmetric relat ion on A. However, R 2 is not so, because
(1, 3) R2 but (3, 1) R2

(6) Transitive Relation : Let A be any set. A relation R on A is said to be a transitive relation iff
(a, b) R and (b, c) R (a, c) R for all a, b, c A
i.e. a R b and b R c  a R c for all a, b, c A
Ex.8 On the set N of natural numbers, the relation R defined by x R y x is less than y is transitive, because for any x, y, z 
N
x < y and y < z x < z x R y and y R z x R z
Ex.9 Let L be the set of all straight lines in a plane. Then the realtion 'is parallel to' on L is a transitive relation, because from
any 1, 2, 3 L.
1 | 2 and 2 | 3  1 | 3
(7) Antisymmetric Relation : Let A be any set. A relation R on set A is said to be an antisymmetric relation iff
(a, b) R and (b, a) R a = b for all a, b A
Ex.10 Let R be a relation on the set N of natural numbers defined by
x R y 'x divides y' for all x, y N

_______________________Sets & Relations_____________________ 7

 MATHS
This relation is an antisymmetric relation on N. Since for any two numbers a, b N
a|b and b|a a = b i.e. a R b and b R a a = b
(8) Equivalence Relation : A relation R on a set A is said to be an equivalence relation on A iff
(i) it is reflexive i.e. (a, a) R for all a A
(ii) it is symmetric i.e. (a, b) R (b, a) R for all a, b A
(iii) it is transitive i.e. (a, b) R and (b, c) R (a, c) R for all a, b, c A.
Ex.11 Let R be a relation on the set of all lines in a plane defined by (1, 2) R line 1 is parallel to line 2. R is an equivalence
relation.
Note : It is not neccessary that every relation which is symmetric and transitive is also reflexive.

(9) Partial Order Relation :

A relation R on set A is said to be an partial order relation on A if
(i) R is reflexive i.e. (a, a) R, a A
(ii) R is antisymmetric i.e. (a, b) R (b, a) R only Possible When a = b a, b A
(iii) R is transitive i.e. (a, b) R and (b, c) R (a, c) R a, b, c R
Ex.12 R be a relation on the set N of natural numbers defined by
x R y  'x divides y' x, y N then R is a partial order Relation.

8 _____________________Sets & Relations_______________________

 MATHS
SOLVED EXAMPLES
Ex.1 Three relation R1, R2 and R3 are defined on set A = {a, b, c} as follows :
(i) R1 = {a, a), (a, b), (a, c), (b, b), (b, c), (c, a), (c, b), (c, c)}
(ii) R2 = {(a, b), (b, a), (a, c), (c, a)}
(iii) R3 = {(a, b), (b, c), (c, a)}
Find whether each of R1, R2 and R3 is reflexive, symmetric and transitive.
Sol. (i) Reflexive : Clearly, (a, a), (b, b), (c, c) R1. So, R1 is reflexive on A.
Symmetric : We observe that (a, b)  R1 but (b, a) R1. So, R1 is not symmetric on A.
Transitive : We find that (b, c) R1 and (c, a) R1 but (b, a)  R1. So, R is not transitive on A.
(ii) Reflexive : Since (a, a), (b, b) and (c, c) are not in R2. So, it is not a reflexive realtion on A.
Symmetric : We find that the ordered pairs obtained by interchanging the components of ordered pairs in R2 are
also in R2. So, R2 is a symmetric relation on A.
Transitive : Clearly (c, a) R2 and (a, b) R2 but (c, b) R2. So, it is not a transitive relation on R2.
(iii) Reflexive : Since non of (a, a), (b, b) and (c, c) is an element of R3. So, R3 is not reflexive on A.
Symmetric : Clearly, (b, c) R3 but (c, b) R3 . so, is not symmetric on A.
Transitive : Clearly, (b, c) R3 and (c, a)  R3 but (b, a) R3. So, R3 is not transitive on A.

Ex.2 Prove that therelation R on the set Z of all integers defined by

(x, y) R x – y is divisible by n
is an equivalence relation on Z.
Sol. We observe the following properties
Reflexivity : For any a Z, we have
a – a = 0 = 0 × n a – a is divisible by n (a, a)  R
Thus, (a, a) R for all a  Z
So, R is reflexive on Z
symmetry : Let (a, b) R. Then,
(a, b) R (a – b) is divisible by n
 a – b = np for some p I
 b – a = n(–p)
 b – a is divisible by n [p I  –p  I ]
 (b, a) R
Thus, (a , b) R (b, a)  R for all a, b, Z
So, R is symmetric on Z.
Transitivity : Let a, b, c Z such that (a, b) R and (b, c) R. Then,
(a , b) R (a – b) is divisible by n
 a – b = np for some p I
(b, c) R (b – c) is divisible by n
 b – c = nq for some q I
 (a, b)  R and (b, c) R
 a – b = np and b – c = nq

_______________________Sets & Relations_____________________ 9

 MATHS
SOLVED EXAMPLES
 (a – b) + (b – c) = np + nq
 a – c = n(p + q)
 a– c is divisible by n [p, q I p + q = I]
 (a, c) R
Thus, (a, b) R and (b, c) R (a, c) R for all a, b, c Z. so, R is transitive realtion in Z.
Ex.3 Show that the relation is congruent to' on the set of all triangles in a plane is an equivalence relation.
Sol. Let S be the set of all triangles in a plane and let R be the relation on S defined by (1, 2) R triangle 1 is congruent
to triangle 2. We observe the following properties.
Reflexivity : For each triangle S, we have
   (, ) R for all S R is reflexive on S
Symmetry : Let 1, 2 S such that (1, 2) R. Then, (1, 2) R 1  2 2  1 (2, 1)  R
So, R is symmetric on S
Transitivity : Let 1,2, 3 S such that (1, 2) R and (2, 3) R. Then,
(1, 2) R and (2, 3) R 1  2 and 2  3   3 (1, 3) R
So, R is transitive on S.
Hence, R being reflexive, symmetric and transitive, is an equivalence relation on S.

Ex.4 Let R be the set of real numbers. [AIEEE–2011]

Statement-1:
A = {(x, y)  R × R : y – x is an integer} is an equivalence relation on R.
Statement-2:
B = {(x, y) R × R : x = y for some rational number } is an equivalence relation on R.
(1) Statement-1 is true, Statement-2 is false.
(2) Statement-1 is false, Statement-2 is true
(3) Statement-1 is true, Statement-2 is true; Statement-2 is a correct explanation for Statement-1
(4) Statement-1 is true, Statement-2 is true; Statement-2 is not a correct explanation for Statement-1.
Sol. St. 1 : Given A = {(x, y)  R × R : y – x is an integer}
For Reflexive : x R x  x – x = 0 (integer)
For Symmetric : x R y  y – x = I (integer)
 (x – y) = –I (integer)  y R x
so x R y  y R x
For Transitive : Let x R y and y R z
y – x = I1 and z – y = I2
(y – x) + (z – y) = I1 + I2
 (z – x) = I1 + I2 (integer)  xRz  R is transitive
 so it is equivalence relation.
St. 2 : B = (x, y)  R × R : x = y ( is rational)
For transitive : xRy and yRz
x = y and y = z
x y
  = and  =
y z
x
Multiply 2 = (rational)
z
but  may be rational or may not be so it is not transitive. Ans. (1)
Ex.5 Let a relation T be defined on N × N, where N is a set of natural numbers, as follows :

10 _____________________Sets & Relations_______________________

 MATHS
(a, b) T (c, d)  a + d = c + b,  a, b, c, d  N
prove that T is an equivalence relation on N × N.
Sol. For T to be equivalence relation, we have to prove that T is
(i) Reflexive (ii) Symmetric (iii) Transitive
(i) Reflexive : Let a, b  N, then
( a, b )  N × N  a+b=a+b
 (a, b) T (a, b)  a, b  N.
 T is reflexive
(ii) Symmetric : Let (a, b) T (c, d), then
(a, b) T (c, d)  a+d=c+b
 c+b=a+d
 (c, d) T (a, b)
 T is symmetric.
(iii) Transitive : Let (a, b) T (c, d) and (c, d) T (e, f), then
(a, b) T (c, d)  a+d=c+b
and (c, d) T (e, f)  c+f=e+d
 (a, b) T (c, d) ^ (c, d) T (e, f)
 (a + d) + (c + f) = (c + b) + (e + d)
 a+f=b+e
 a+f=e+b
 (a, b) T (e, f)
 T is transitive.
Ex.6. Prove that the relation R in the set N of natural numbers defined by
x R y  '(x – y) is divisible by 5 is an equivalence relation.
Sol. For proving the relation R an equivalence relation we shall prove that the relation R is reflexive, symmetric and transitive
in the set N.
(i) Reflexive : Let x  N, then
x  N  x–x=0
 x –x = 0 × 5
 x – x is divisible by 5
 xRx
 R is reflexive.
(ii) Symmetric : Let x R y & x, y  N, then
xRy  x – y is divisible by 5
 x – y = 5 × p where p  I
 y – x = 5 × (–p)
 y – x is divisible by 5 [p  I  –p  I ]
 yRx
 R is symmetric.
(iii) Transitive : Let x R y and y R z then
xRy  x – y is divisible by 5
 x – y = 5 × p, p  I
and yRz  y – z = 5q ; ( q  I )
 (x – y) + (y – z) = 5p + 5q
 x – z = 5(p + q)
 x – z is divisible by 5 [p  I, q  I  p + q  I]
 xRz
 R is transitive.
Thus R is reflexive, symmetric and transitive therefore R is an equivalence relation on the set N.
Ex.7 In the set N × N consider the relation R defined as
(a, b) R (c, d)  ad = bc; a, b, c, d  N
Show that this is an equivalence relation.
Sol. For proving the relation R on N × N to be an equivalence relation, we will prove that the relation R is reflexive, symmetric
and transitive.
_______________________Sets & Relations_____________________ 11
 MATHS
Reflexive : Let x, y  N, then
( x, y )  N × N  xy = yx, by commutativity in N
 (x, y) R (x, y)  (x, y)  N × N
 R is reflexive
Symmetric : Let (x, y) R (p, q) where x, y, p, q  N, then
(x, y) R (p, q)  xq = yp
 yp = xq
 py = qx [by commutativity in N]
 (p, q) R (x, y)
 R is symmetric.
Transitive : Let (x1, y1) R (x2, y2)  (x2, y2) R (x3, y3) wheree
(x1, y1) (x2, y2), (x3, y3) N × N, then
(x1, y1) R (x2, y2)  x1y2 = y1x2 ...(1)
 (x2, y2) R (x3, y3)  x2y3 = y2x3 ...(2)
Now x1y2 = y1x2
y2 x 3
 = y1 putting the value of x2 from (2).
y3
 x1y3 = y1x3 ...(3)
 (x1, y1) R (x3, y3)
Therefore R is transitive.
Hence the relation defined on N × N is an equivalence relation.
Ex.8 Let the relation R in the set of real numbers defined as aRb  1 + ab > 0. Show that the relation is reflexive and symmetric
but not transitive.
Sol. Reflexive : Let A be the set of real numbers and a  A, then
a  A  1 + a.a = 1 + a2 > 0 [ a2 > 0]
 aRa  a  A
 R is reflexive.
Symmetric : Let aRb then
aRb  1 + ab > 0
 1 + ba > 0 [ab = ba,  a, b  A]
 bRa
 R is symmetric.
Transitive : Let aRb and bRc ; then
aRb and bRc  1 + ab > 0 and 1 + bc > 0
1
If we take a = 1, b = and c = – 1, then
2

1 3 1
1+1. = > 0  1R
2 2 2

1 1 1
and 1+ (–1) = >0  R(– 1)
2 2 2
But 1 + 1(–1) = 0 not greater than 0 1 R (–1)

1 1
Hence 1 R and R(–1) does not  1 R (–1), thus
2 2
R is not transitive.
Hence R is reflexive, symmetric but not transitive.
Ex.9 A relation R on the set of non-zero complex numbers C0 is defined as
z1  z2
z1Rz2  is real show that R is an equivalence relation.
z1  z2
Sol. For proving the relation R an equivalence relation we shall prove that the relation R is reflexive, symmetric and transitive
in the set of non-zero complex number say C0.
(i) Reflexive : Let z  C0, then

12 _____________________Sets & Relations_______________________

 MATHS

zz
z  C0  = 0, which is real.
zz
 z R z  z  C0
 R is reflexive.
(ii) Symmetric : Let z1 R z2 where z1, z2  C0, then
z1  z2
z1 R z2  is real number,,
z1  z2

 z2  z1 
  z  z  is also a real number..
 2 1 

 z2 R z1
 R is symmetric.
(iii) Transitive : Let z1 R z2 and z2 R z3 where z1, z2, z3  C0, then
z1  z2
z1 R z2  is a real number..
z1  z2
 z1 – z2 and z1 + z2 are both real
z2  z3
z2 R z3  z2  z3 is a real number..
 z2 – z3 and z2 + z3 are both real.
Now z1 R z2, z1 R z3  z1 – z2, z1 + z2, z2 – z3, z2 + z3 are all real number
(z1  z2 )  (z2  z3 )
 is also a real number..
(z1  z2 )  (z2  z3 )

z1  z3
 is real  z1 R z3
z1  z3
 R is transitive.
Hence R is an equivalence relation.

Ex.10 Let the relation R be defined in the set of real number as follows :
(i) a R b  a  b (ii) a R b  |a| = |b|
Which of the above defined relation are equivalence relation.
Sol. Let A be the set of real numbers
(i) Reflexive : If a  A, then
a  A  a  a  aRa
 R is reflexive.
Symmetric : If a R b, then
aRb  a  b  b = a but b  a
does not imply b  a does not imply b R a
 R is not symmetric.
Transitive : If a R b & b R c, then
a R b and b R c  a  b and b  c
 ac  aRc
 R is transitive.
Hence R is reflexive and transitive but not symmetric.
Thus R is not an equivalence relation.
(ii) Reflexive : If a  A, then
a=a  |a| = |a|  a R a  a  A
R is symmetric.
Symmetric : If a R b, then
aRb  |a| = |b|  |b| = |a|  bRa
 R is symmetric.
Transitive : If a R b and b R c, then
a R b and b R c  |a| = |b| and |b| = |c|

_______________________Sets & Relations_____________________ 13

 MATHS

 |a| = |c|  aRc

 R is transitive.
 R is reflexive, symmetric and transitive.
Hence R is an equivalence relation.

Ex.11 If R and S are equivalence relation in a set X, prove that

(i) R  S is an equivalence relation in X.
(ii) R–1 and S–1 are equivalence relation in X.
Sol. (i) Given R and S equivalence relation in X.
 R  X × X and S  X × X
 R  S is also a relation in X.
Now we will prove R  S is an equivalence relation in X.
Reflexive : Let x  X, then
x  X  (x, x)  R and (x, x)  S
[R and S are Reflexive relations]
 (x, x)  R  S,  (x, x)  X × X
 R  S are Reflexive relation.
Symmetric : Let (x, y)  R  S, then
(x, y)  R  S  (x, y)  R and (x, y)  S
 (y, x)  R and (y, x)  S [R and S are symmetric relations]
 (y, x)  R  S
 R  S is an symmetric relation.
Transitive : Let (x, y)  R  S and (y, z)  R  S, then
(x, y)  R  S  (x, y)  R and (x, y)  S
and (y, z)  R  S  (y, z)  R and (y, z)  S
But R and S are equivalence relation therefore they are transitive also, therefore
(x, y)  R and (y, z)  R  (x, z)  R 

 (x, z)  R  S
(x, y)  S and (y, z)  S  (x, z)  S 

 (x, y)  R  S and (y, z)  R  S  (x, z) R  S
or R  S is transitive.
Hence R  S is an equivalence relation.
(ii) Because R is a relation in the set X.
 R  X × X
 R–1  X × X
 R–1 is also a relation in X.
Now we have to prove R–1 is an equivalence relation.
Reflexive : If x  X, then
x  X  (x, x)  R [ R is reflexive]
 (x, x)  R–1  x, x  X × X
 R–1 is reflexive.
Symmetric : If (x, y)  R–1, then
(x, y)  R–1  (y, x)  R
 (x, y)  R [ R is symmetric]
 (y, x)  R –1

 R–1 is reflexive.
Transitive : If (x, y)  R–1  (y, z)  R–1, then
(x, y)  R–1  (y, z)  R–1
 (y, x)  R  (z, y)  R
 (x, y)  R  (y, z) R [R is an equivalence relation]

14 _____________________Sets & Relations_______________________

 MATHS
 (x, z)  R
 (z, x)  R [R is symmetric]
 (x, z)  R–1
 R–1 is transitive.
Hence R–1 is an equivalence relation.
Similarly we can prove S–1 to be an equivalence relation.
Ex.12 Prove that a relation R defined in a set A is symmetric  R = R–1.
Sol. (a) First let R is symmetric then we have to prove that R = R–1
Let (x, y)  R then
(x, y)  R  (y, x)  R [R is symmetric]
 (x, y)  R–1 [By the definition of R–1]
 R  R–1 ......... (i)
–1
And (y, x) R  (x, y)  R
 (y, x)  R ( R is symmetric)
 R–1  R ..........(ii)
Hence from (i) and (ii) R = R –1

(b) Conversely let R = R–1, we have to prove that R is a symmetric relation.

Let (x, y)  R  ( x, y )  R–1 [R–1 = R]
 (y, x)  R (By the definition of R–1 )
 R is a symmetric relation.
Hence R is symmetric  R = R–1.

_______________________Sets & Relations_____________________ 15

 MATHS
(4) none of these
CLASSWORK 10. Let X = {1, 2, 3, 4} and Y = {1, 3, 5, 7, 9}. Which of
the following is relations from X to Y-
MHT-CET MCQ's
1. If A is any set, then- (1) R1  {(x, y) | y  2  x, x  X, y  Y}

(1) A  A '   (2) AA'  U (2) R 2  {(1,1), (2,1), (3,3), (4,3), (5,5)}

(3) AA'  U (4) none of these

(3) R 3  {(1,1), (1,3), (3,5), (3, 7), (5, 7)}
2. Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, A = {1, 2, 5},

B = {6, 7} then A  B ' is- (4) R 4  {(1,3), (2,5), (2, 4), (7,9)}

(1) B' (2) A (3) A' (4) B JEE-MAIN MCQ's

3. Let A and B be two sets in the universal set. Then
11. If A, B be any two sets, then (A  B) ' is equal to -
A – B equals-
(1) A ' B ' (2) A ' B '
(1) A  B ' (2) A ' B
(3) A  B (4) A  B
(3) A  B (4) none of these
12. If A and B are not disjoint, then n(A  B) is equal to-
4. If A and B be any two sets, then (A  B) ' is equal to
o
(1) n(A) + n(B)
(1) A ' B ' (2) A ' B '
(2) n(A) + n(B) – n(A  B)
(3) A  B (4) A  B
(3) n(A) + n(B) + n(A  B)
5. If A = {2, 4, 5}, B = {7, 8, 9} then n(A × B) is equal to-
(1) 6 (2) 9 (3) 3 (4) 0 (4) n(A).n(B)
13. Which of the following is a null set ?
6. Which of the following statements is true ?
(1) A = {x : x > 1 and x < 1]
(1) 3  {1, 3, 5} (2) 3  {1, 3, 5}
(2) B = {x : x + 3 = 3}
(3) {3}  {1, 3, 5} (4) {3,5}  {1, 3, 5} (3) C  {}
7. In the set A = {1, 2, 3, 4, 5}, a relation R is defined by
(4) D  {x : x  1and x  1}
R = {(x, y) | x, y  A and x < y}. Then R is-
(1) Reflexive (2) Symmetric 14. Which one of the following relations on R is equivalence
relation-
(3) Transitive (4) None of these
8. Let L denote the set of all straight lines in a plane. Let (1) x R 1 y | x || y | (2) x R 2 y  x  y
a relation R be defined by
(3) x R 3 y  x | y (4) x R 4 y  x  y
 R     ,  ,   L. Then R is.
15. If A = {1, 2, 3}, B = {1, 4, 6, 9} and R is a relation from
(1) Reflexive (2) Symmetric
A to B defined by ‘x is greater than y’. Then range of R
(3) Transitive (4) none of these is-
9. Let A = {2, 3, 4, 5} and let R = {(2, 2), (3, 3), (4, 4), (1) {1, 4, 6, 9} (2) {4, 6, 9}
(5, 5), (2, 3), (3, 2), (3, 5), (5, 3)} be a relation in A. Then (3) {1} (4) none of these
R is-
16. Let L be the set of all straight lines in the Euclidean
(1) Reflexive and transitive
plane. Two lines  1 and  2 are said to be related by the
he
(2) Reflexive and symmetric
relation R if  1 is parallel to  2 . Then the relation R is
(3) Reflexive and antisymmetric

16 _____________________Sets & Relations_______________________

 MATHS
(1) Reflexive (2) Symmetric (3) A = B (4) A = C

(3) Transitive (4) Equivalence 23. Let X = {1, 2, 3, 4, 5}. The number of different ordered
17. Let R = {(x, y) : x, y  A, x + y = 5} where A = {1, 2, 3, pairs (Y, Z) that can be formed such that Y  X,
4, 5} then
(1) R is not reflexive, symmetric and not transitive Z  X, and Y  Z is empty, is : [AIEEE - 2012]
(2) R is an equivalence relation (1) 53 (2) 52 (3) 35 (4) 25
(3) R is reflexive, symmetric but not transitive 24. Let R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} be a releation
(4) R is not reflexive, not symmetric but transitive on the set A = {1, 2, 3, 4}. The relation R is-
18. Let x, y  I and suppose that a relation R on I is defined [AIEEE - 2004]
by x R y if and only if x   y then
(1) transitive (2) not symmetric
(1) R is partial order ralation
(3) reflexive (4) a function
(2) R is an equivalence relation
25. Let R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9),
(3) R is reflexive and symmetric (3, 12), (3, 6)} be relation on the set A = {3, 6, 9, 12).
(4) R is symmetric and transitive The relation is- [AIEEE - 2005]

19. A and B are two sets having 3 and 4 elements (1) rflexive and transitive only
respectively and having 2 elements in common. The
number of relations which can be defined from A to B is- (2) reflexive only
(1) 25 (2) 210 – 1 (3) an equilvalence relation
12
(3) 2 – 1 (4) none of these (4) reflexive and symmetric only

20. Let P  {(x, y) | x 2  y 2  1, x, y R} Then P is.

(1) reflexive (2) symmetric

(3) transitive (4) anti-symmetric
PREVIOUS YEAR MCQ's
21. The set S : {1, 2, 3, ...., 12} is to be partitioned into
three sets A, B, C of equal size. Thus A  B  C  S,

A  B  B  C  A  C   The number of ways to

partition S is-

(1) 12!/3!(4!)3 (2) 12!/3!(3!)4

(3) 12!/(4!)3 (4) 12!/(3!)4

22. If A, B and C are three sets such that
A  B  A  C and A  B  A  C , then.

(1) B = C (2) A  B  

CLA SSWORK A NSWER K EY

Que. 1 2 3 4 5 6 7 8 9 10
A ns. 2 2 1 2 2 2 3 2 2 1
Que. 11 12 13 14 15 16 17 18 19 20
A ns. 2 2 1 1 3 4 1 1 4 2
Que. 21 22 23 24 25
A ns. 3 1 3 2 1
_______________________Sets & Relations_____________________ 17
 MATHS
JEE-MAIN MCQ's
HOMEWORK
11. If A  B , then A  B is equal to-
(1) A (2) B (3) A’ (4) B’
MHT-CET MCQ's
12. If A and B are any two sets, then A  (A  B)
1. If A and B are two sets, then   (   B) ' isequal
equal to-
to-
(1) A (2) B (3) A’ (4) B’
(1) A (2) B
(3)  (4) none of theseTwo  1 
13. If Q   x : x  , where y  N  , then -
2. sets A, B are disjoint iff-  y 
(1)   B   (2)   B  
(1) 0  Q (2) 1  Q
(3)   B   (4)   B  
2
3. If A and B are two sets, then   B    B iff- (3) 2  Q (4) Q
3
(1) A  B (2) B  A
14. Let A = {p, q, r}. Which of the following is an
(3) A = B (4) none of these equivalence relation in A ?
4. Which of the following is a null set ? (1) R1 = {(p, q), (q, r), (p, r), (p, p)}
(1) {0} (2) R2 = {(r, q) (r, p), (r, r), (q, q)}
(2) {x : x > 0 or x < 0} (3) R3 = {(p, p), (q, q), (r, r), (p, q)}
(3) {x : x2 = 4 or x = 3} (4) none of these
(4) {x : x2 + 1 = 0, x  R} 15. Given the relation R = = {(1, 2), (2, 3)} on the set
5. If R is a relation from a finite set A having m A = {1, 2, 3}, the minimum number of ordered
elements to a finite set B having n elements, then pairs which when added to R make it an equivalence
the number of relations from A to B is- relation is-
(1) 2mn (2) 2mn –1 (1) 5 (2) 6 (3) 7 (4) 8
(3) 2mn (4) mn 16. If R is an equivalence relation in a set A, then R–1 is-
6. For real numbers x and y, we write x R (1) reflexive but not symmetric
(2) symmetric but not transitive
y  x  y  2 is an irrational number. Then
(3) an equivalence relation
the relation R is- (4) none of these
(1) Reflexive (2) Symmetric .17 Let X be a family of sets and R be a relation on X
(3) Transitive (4) none of these defined by ‘A is disjoint from B’. Then R is-
7. Let R be a relation defined in the set of real numbers (1) reflexive (2) symmetric
by a R b  1  ab  0 . Then R is (3) anti-symmetric (4) transitive
(1) Equivalence relation (2) Transitive 18. In order that a relation R defined in a non-empty
3) Symmetric (4) Anti-symmetric set A is an equivalence relation, it is sufficient that R
8. Two points P and Q in a plane are related if (1) is reflexive
OP = OQ, where O is a fixed point. This relation (2) is symmetric
is- (3) is transitive
(1) Reflexive but symmetric (4) possesses all the above three properties
(2) Symmetric but not transitive 19. If R be a relation ‘<‘ from A = {1, 2, 3, 4} to B =
(3) An equivalence relation {1, 3, 5} i.e. (a, b)  R iff a < b, then ROR–1 is-
(4) none of these (1) {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)}
9. The relation R defined in A = {1, 2, 3} by a R b if (2) {(3, 1), (5, 1), (3, 2), (5, 2), (5, 3), (5, 4)}
(3) {(3, 3), (3, 5), (5, 3), (5, 5)}
| a 2  b 2 | 5 .Which of the following is false- (4) {(3, 3), (3, 4), (4, 5)}
(1) R ={(1, 1), (2, 2), (3, 3), (2, 1), (1, 2), (2, 3), (3, 2) 20. Let R and S be two equivalence relations in a set
(2) R = R A. Then-
(3) Domain of R = {1, 2, 3} (1)
(4) Range of R = {5}
R  S is an equivalence relation in A
10. Let a relation R is the set N of natural numbers be (2) R  S is an equivalence relation in A
defined as (x, y)  R if and only if x2 – 4xy + 3y2 = 0 (3) R – S is an equivalence relation in A
for all x, y  N. The relation R is- (4) none of these
(1) Reflexive
(2) Symmetric
(3) Transitive PREVIOUS YEAR MCQ's
(4) An equivalence relation
21. Let W denote the words in the English dictionary. Define

18 _____________________Sets & Relations_______________________

 MATHS
the relation R by : R = {(x, y)  W × W| the words x Statement-2 is a correct explanation for
and y have at least one letter in common}. Statement-1
Then R is- [AIEEE - 2006] (4) Statement-1 is true, Statement-2 is true;
(1) reflexive, symmetric and not transitive Statement-2 is not a correct explanation for
(2) reflexive, symmetric and transitive Statement-1.

(3) reflexive, not symmetric and transtive 24. Consider the following relation R on the set of real square
matirces of order 3.
(4) not reflexive, symmetric and transitive
R={(A, B)|A=P–1 BP for some invertible matrix P}.
22. Consider the following relations :-
Statement - 1:
R = {(x, y) | x, y are real numbers and x = wy for
some rational number w} ; R is an equivalence relation.
Statement - 2:
m p
S  {( , ) | m, n, p and q are integers such that For any two invertible 3 × 3 martices M and N,
n q
(MN)–1 = N–1M–1 [AIE E E - 2011]

n, q  0 and qm = pn}. (1) Statement-1 is false, statement-2 is true.

Then : [AIEEE - 2010] (2) Statement- 1 is true , statement - 2 is true ;

Statement - 2 is correct explanation for
(1) R is an equivalence relation but S is not an equivalence
relation statement-1

(2) Neither R nor S is an equivalence relation (3) Statement- 1 is true, statement - 2 is true ; Statement-
2 is not a correct explanation for statement-1.
(3) S is an equivalence relation but R is not an equivalence
relation (4) Statement-1 is true, statement-2 is false.

(4) R and S both are equivalence relations 25. If R  {(x, y) : x, y  Z, x 2  3y 2  8} is relation

23. Let R be the set of real numbers. on the set of integers Z, then the domain of R-1 is:
Statement - 1 : (1) {-2, -1, 1, 2} (2) {-1, 0, 1}
A = {(x, y)  R × R : y – x is an integer} is an equivalence
(3) {-2, -1, 0, 1, 2} (4) {0, 1}
relation on R. [AIEEE - 2011]

Statement - 2 :

B = {(x, y)   R × R : x =  y for some rational number

 } is an equivalence relation on R.
(1) Statement-1 is true, Statement-2 is false.

(2) Statement-1 is false, Statement-2 is true

(3) Statement-1 is true, Statement-2 is true;

H OM EWO RK A NSWER K EY
Que. 1 2 3 4 5 6 7 8 9 10
A ns. 3 3 3 4 1 1 3 3 4 1
Que. 11 12 13 14 15 16 17 18 19 20
A ns. 1 1 2 4 3 3 2 4 3 2
Que. 21 22 23 24 25
A ns. 1 3 1 1 2
_______________________Sets & Relations_____________________ 19