Maths IIT-JEE ‘Best Approach’ MCSIR Relation

KEY CONCEPTS (RELATION)

ORDERED PAIR :
A pair of objects listed in a specific order is called an ordered pair. It is written by listing the two objects
in specific order separating them by a comma abd enclosing the pair in parantheses.
In the ordered pair (a, b), a is called the first element and b is called the second element.
Two ordered pairs are set to be equal if their corresponding elements are equal. i.e.
(a, b) = (c, d) if a = c and b = d.

CARTESIAN PRODUCT :
The set of all possible ordered pairs (a, b), where a  A and b  B i.e. {(a, b) ; a  A and b  B} is
called the cartesian product of A to B and is denoted by A × B. Usually A × B  B × A.
Similarly A × B × C = {(a, b, c) : a  A, b  B, c  C} is called ordered triplet.

RELATION:
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. The subsets is derived by describing a relationship between the
first element and the second element of ordered pairs in A × B e.g. if A = {1, 2, 3, 4, 5, 6, 7, 8}
and B = {1, 2, 3, 4, 5} and R = {(a, b) : a = b2, a  A, b  B} then R = {(1, 1), (4, 2), (9, 3)}.
Here a R b  1 R 1, 4 R 2, 9 R 3.

NOTE :
(i) 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 i.e. number of relations from A to B is
2mn.
(ii) A relation R from A to A is called a relation on A.

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 of coordinates of the
ordered pairs belonging to R is called to domain of R, while the set of all second components of corrdinates
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.

TYPES OF RELATIONS :
In this section we intend to define various types of relations on a given set A.
(i) 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.

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 2
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
(ii) 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.

(iii) 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.

(iv) 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.
Note : Every identity relation is reflexive but every reflexive relation in not identity.

(v) 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  b R a for all a, b  A.

(vi) 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

(vii) 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  A

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 3
Maths IIT-JEE ‘Best Approach’ MCSIR Relation

SOLVED EXAMPLES
1. Which of the following are identity relations on set A = {1, 2, 3}.
R1 = {(1, 1), (2, 2)}, R2 = {(1, 1), (2, 2), (3, 3), (1, 3)}, R3 = {(1, 1), (2, 2), (3, 3)}.
Sol. The relation R3 is idenity relation on set A.
R1 is not identity relation on set A as (3, 3)  R1.
R2 is not identity relation on set A as (1, 3)  R2

2. Prove that on the set N of natural numbers, the relation R defined by x R y  x is less than y is transitive.
Sol. Because for any x, y, z  N, x < y and y < z  x < z  x R y and y R z  x R z.
So, R is transitive.

3. Let T be the set of all triangles in a plane with R a relation in T given by R = {(T1 , T2) : T1 is congruent
to T2}. Show that R is an equivalence relation.
Sol. Since a relation R in T is said to be an equivalenece relation if R is reflexive, symmetric and transitive.
(i) Since every triangle is congruent to itself
 R is reflexive

(ii) (T1 , T2)  R

 T1 is congruent to T2
 T2 is congruent to T1
 (T2, T1)  R
Hence R is symmetric

(iii) Let (T1, T2)  R and (T2, T3)  R

 T1 is congruent to T2 and T2 is congruent to T3
 T1 is congruent to T3
 (T1, T3)  R
 R is transitive
Hence R is an equivalence relation.

4. Show that the relation R in R defined as R = {(a, b) : a  b} is transitive.

Sol. Let (a, b)  R and (b, c)  R
 (a  b) and b  c  a  c
 (a, c)  R
Hence R is transitive.

5. Show that the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is symmetric.
Sol. Let (a, b)  R [ (1, 2)  R]
 (b, a)  R [ (2, 1)  R]
Hence R is symmetric.

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 4
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
6. Three relation R1, R2 are 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 relation 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.

7. Prove that the relation 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  N, 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  Z
 b – a = n(– p)
 b – a is divisible by n [ p  Z – p  Z]
 (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  Z
(b, c)  R  (b – c) is divisible by n.
 b – c = nq for some q  Z
 (a, b)  R and (b, c)  R.
 a – b = np and b – c – nq
 (a – b) + (b – c) = np + nq
 a – c = n(p + q)
 a – c is divisible by n [ p, q  Z p + q = Z]
 (a, c)  R
Thus, (a, b)  R and (b, c)  R  (a, c)  R for all a, b, c Z. So, R is transitive relation in Z.

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 5
Maths IIT-JEE ‘Best Approach’ MCSIR Relation

8. Show that the relation triangle 1 is congruent to triangle 2 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.
Reflexive : For each triangle  S, we have   ()  R for all  S R is reflexive on S.
Symmetric : Let   S such that (1, 2) R.
Then, (1, 2)  R 1 2  (2, 1)  R. So, R is symmetric on S.
Transitive : Let   S such that (1, 2) R and (2, 3)  R.
Then, (1, 2)  R and (2, 3)  R 1 2 and 2 3 1 3 13)  R.
So, R is transitive on S.
Hence, R being reflexive, symmetric and transitive, is an equivalence relation on S.

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 6
Maths IIT-JEE ‘Best Approach’ MCSIR Relation

EXERCISE - I
1. If R is a relation from a finite set A having m elements to a finite set B having n elements, then the number
of relations from A to B is-
(A) 2mn (B) 2mn –1 (C) 2mn (D) mn

2. In the set A = {1, 2, 3, 4, 5}, a relation R is defined by R = {(x, y) | x, y A and x < y}. Then R is-
(A) Reflexive (B) Symmetric (C) Transitive (D) None of these

3. For real numbers x and y, we write x R y x – y + 2 is an irrational number. Then the relation R is-
(A) Reflexive (B) Symmetric (C) Transitive (D) none of these

4. Let X = {1, 2, 3, 4} and Y = {1, 3, 5, 7, 9}. Which of the following is relations from X to Y-
(A) R1 = {(x, y) | y = 2 + x, x X, y Y} (B) R2 = {(1, 1), (2, 1), (3, 3), (4, 3), (5, 5)}
(C) R3 = {(1, 1), (1, 3), (3, 5), (3, 7), (5, 7)} (D) R4 = {(1, 3), (2, 5), (2, 4), (7, 9)}

5. Let L denote the set of all straight lines in a plane. Let a relation R be defined by R  ,
, L. Then R is-
(A) Reflexive (B) Symmetric (C) Transitive (D) none of these

6. Let R be a relation defined in the set of real numbers by a R b 1 + ab > 0. Then R is-
(A) Equivalence relation (B) Transitive
(C) Symmetric (D) Anti-symmetric

7. Which one of the following relations on R is equivalence relation-

(A) x R1y |x| = |y| (B) x R2 y  x  y (C) x R3y x | y (D) x R4 y x < y

8. Two points P and Q in a plane are related if OP = OQ, where O is a fixed point. This relation is-
(A) Reflexive but symmetric (B) Symmetric but not transitive
(C) An equivalence relation (D) none of these

9. The relation R defined in A = {1, 2, 3} by a R b if |a2 – b2| 5. Which of the following is false-
(A)R ={(1, 1), (2, 2), (3, 3), (2, 1), (1, 2), (2, 3), (3, 2)
(B) R–1 = R
(C) Domain of R = {1, 2, 3}
(D) Range of R = {5}

10. Let a relation R is the set N of natural numbers be defined as (x, y) R if and only if x2 – 4xy + 3y2 = 0
for all x, y N. The relation R is-
(A) Reflexive (B) Symmetric (C) Transitive (D) An equivalence relation

11. Let A = {2, 3, 4, 5} and let R = {(2, 2), (3, 3), (4, 4), (5, 5), (2, 3), (3, 2), (3, 5), (5, 3)} be a relation
in A. Then R is-
(A) Reflexive and transitive (B) Reflexive and symmetric
(C) Reflexive and antisymmetric (D) none of these

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 7
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
12. If A = {2, 3} and B = {1, 2}, then A × B is equal to-
(A) {(2, 1), (2, 2), (3, 1), (3, 2)} (B) {(1, 2), (1, 3), (2, 2), (2, 3)}
(C) {(2, 1), (3, 2)} (D) {(1, 2), (2, 3)}

13. Let R be a relation over the set N × N and it is defined by (a, b) R (c, d) a + d = b + c. Then R is-
(A) Reflexive only (B) Symmetric only (C) Transitive only (D) An equivalence relation

14. Let N denote the set of all natural numbers and R be the relation on N × N defined by (a, b) R (c, d) if
ad (b + c) = bc(a + d), then R is-
(A) Symmetric only (B) Reflexive only (C) Transitive only (D) An equivalence relation

15. If A = {1, 2, 3}, B = {1, 4, 6, 9} and R is a relation from A to B defined by 'x is greater than y'. Then
range of R is-
(A) {1, 4, 6, 9} (B) {4, 6, 9} (C) {1} (D) none of these

16. Let L be the set of all straight lines in the Euclidean plane. Two lines 1 and 2 are said to be related by the
relation R if 1 is parallel to 2. Then the relation R is-
(A) Reflexive (B) Symmetric (C) Transitive (D) Equivalence

17. A and B are two sets having 3 and 4 elements respectively and having 2 elements in common. The
number of relations which can be defined from A to B is-
(A) 25 (B) 210 – 1 (C) 212 – 1 (D) none of these

18. For n, m N, n|m means that n is a factor of m, the relation | is-
(A) reflexive and symmetric (B) transitive and symmetric
(C) reflexive, transitive and symmetric (D) reflexive, transitive and not symmetric

19. Let R = {(x, y) : x, y A, x + y = 5} where A = {1, 2, 3, 4, 5} then

(A) R is not reflexive, symmetric and not transitive
(B) R is an equivalence relation
(C) R is reflexive, symmetric but not transitive
(D) R is not reflexive, not symmetric but transitive

20. Let R be a relation on a set A such that R = R–1 then R is-

(A) reflexive (B) symmetric (C) transitive (D) none of these

21. Let x, y I and suppose that a relation R on I is defined by x R y if and only if x y then
(A) R is partial order relation (B) R is an equivalence relation
(C) R is reflexive and symmetric (D) R is symmetric and transitive

22. Let R be a relation from a set A to a set B, then-

(A) R = A B (B) R = A B (C) R A × B (D) R B × A

23. Given the relation R = = {(1, 2), (2, 3)} on the set A = {1, 2, 3}, the minimum number of ordered pairs
which when added to R make it an equivalence relation is-
(A) 5 (B) 6 (C) 7 (D) 8

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 8
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
24. Let P = {(x, y) | x2 + y2 = 1, x, y R} Then P is-
(A) reflexive (B) symmetric (C) transitive (D) anti-symmetric

25. Let X be a family of sets and R be a relation on X defined by 'A is disjoint from B'. Then R is-
(A) reflexive (B) symmetric (C) anti-symmetric (D) transitive

26. In order that a relation R defined in a non-empty set A is an equivalence relation, it is sufficient that R
(A) is reflexive (B) is symmetric
(C) is transitive (D) possesses all the above three properties

27. If R be a relation '<' from A = {1, 2, 3, 4} to B = {1, 3, 5} i.e. (a, b) R iff a < b, then ROR–1 is-
(A) {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)}
(B) {(3, 1), (5, 1), (3, 2), (5, 2), (5, 3), (5, 4)}
(C) {(3, 3), (3, 5), (5, 3), (5, 5)}
(D) {(3, 3), (3, 4), (4, 5)}

28. If R is an equivalence relation in a set A, then R–1 is-

(A) reflexive but not symmetric (B) symmetric but not transitive
(C) an equivalence relation (D) none of these

29. Let R and S be two equivalence relations in a set A. Then-

(A) R S is an equivalence relation in A (B) R S is an equivalence relation in A
(C) R – S is an equivalence relation in A (D) none of these

30. Let A = {p, q, r}. Which of the following is an equivalence relation in A ?

(A) R1 = {(p, q), (q, r), (p, r), (p, p)} (B) R2 = {(r, q) (r, p), (r, r), (q, q)}
(C) R3 = {(p, p), (q, q), (r, r), (p, q)} (D) none of these

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 9
Maths IIT-JEE ‘Best Approach’ MCSIR Relation

EXERCISE II
1. Let R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} be a relation on the set A = {1, 2, 3, 4}. The relation R is-
[AIEEE - 2004]
(A) transitive (B) not symmetric (C) reflexive (D) a function

2. Let R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3, 12), (3, 6)} be relation on the set
A = {3, 6, 9, 12). The relation is- [AIEEE - 2005]
(A) rflexive and transitive only (B) reflexive only
(C) an equilvalence relation (D) reflexive and symmetric only

3. Let W denote the words in the English dictionary. Define the relation R by : R = {(x, y) W × W| the
words x and y have at least one letter in common}. Then R is- [AIEEE - 2006]
(A) reflexive, symmetric and not transitive (B) reflexive, symmetric and transitive
(C) reflexive, not symmetric and transitive (D) not reflexive, symmetric and transitive

4. Let R be the real line. Consider the following subsets of the plane R × R. [AIEEE - 2008]
S = {(x ,y) : y = x + 1 and 0 < x < 2)} T = {(x, y) : x – y is integer}. Which one of the following is true?
(A) neither S nor T is an equivalence relation on R
(B) both S and T are equivalence relations on R
(C) S is an equivalence relation on R but T is not
(D) T is an equivalence relation on R but S is not

5. Consider the following relations :-

R = {(x, y) | x, y are real numbers and x = wy for some rational number w} ;
m p
S = {( , ) | m, n, p and q are integers such that n, q  0 and qm = pn}.
n q

Then : [AIEEE - 2010]

(A) R is an equivalence relation but S is not an equivalence relation
(B) Neither R nor S is an equivalence relation
(C) S is an equivalence relation but R is not an equivalence relation
(D) R and S both are equivalence relations

6. Let R be the set of real numbers.

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. [AIEEE - 2011]
(A) Statement-1 is true, Statement-2 is false.
(B) Statement-1 is false, Statement-2 is true
(C) Statement-1 is true, Statement-2 is true; Statement-2 is a correct explanation for Statement-1
(D) Statement-1 is true, Statement-2 is true; Statement-2 is not a correct explanation for Statement-1.

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 10
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
7. Consider the following relation R on the set of real square matirces of order 3.
R={(A, B)|A = P–1 BP for some invertible matrix P}.
Statement - 1 : R is an equivalence relation.
Statement - 2 : For any two invertible 3 × 3 martices M and N, (MN)–1 = N–1M–1
[AIEEE - 2011]
(A) Statement-1 is false, statement-2 is true.
(B) Statement-1 is true, statement-2 is true; Statement-2 is correct explanation for statement-1.
(C) Statement-1 is true, statement-2 is true; Statement-2 is not a correct explanation for statement-1.
(D) Statement-1 is true, statement-2 is false.

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 11
Maths IIT-JEE ‘Best Approach’ MCSIR Relation

ANSWER KEY

EXERCISE–I

1. (A) 2. (C) 3. (A) 4. (A) 5. (B) 6. (C) 7. (A)

8. (C) 9. (D) 10. (A) 11. (B) 12. (A) 13. (D) 14. (D)
15. (C) 16. (D) 17. (D) 18. (D) 19. (A) 20. (B) 21. (A)
22. (C) 23. (C) 24. (B) 25. (B) 26. (D) 27. (C) 28. (C)
29. (B) 30. (D)
EXERCISE–II

1. (B) 2. (A) 3. (A) 4. (D) 5. (C) 6.(A) 7. (C)

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 12
Maths IIT-JEE ‘Best Approach’ MCSIR Relation

SOLUTIONS
EXERCISE 1
1. (A) The number of relations from A to B = 2mn
( A has m elements & B has n elements)

2. (C)  A = {1, 2, 3, 4, 5}
 R = {(x, y) | x, y  A and x < y}
 R = {(1, 2), (1, 3), (1, 4), (1, 5), (2, 3), (2, 4), (2, 5), (3, 4), (3, 5), (4, 5)}
 (1, 1)  R
So, relation R is not Reflexive.
 (1, 2)  R while, (2,1)  R
So, given relation R is not symmetric.
 (1, 2), (2,3)  R
 (1, 3)  R
Similarly, for other Combinations
So, given relation R is Transitive.

3. (A)

 xRyx–y+ 2 is an irrational no.

Reflexivity :
For x R x  x – x + 2 = 2 is an irrational no.
So, given relation is Reflexive.
Symmetricity :
 xy x–y+ 2 is an irrational no.

( 2 , 1)  R

(1, 2 ) R
So, given relation is not symmetric.
Transitivity

(2 2 , 1), (1, 3 2 )  R

But 2 
2,3 2  R

Since,

2 2  3 2  2 is a rational no.
So, Not Transitive.

4. (A)
 x= {1, 2, 3, 4}
y = {1, 3, 5, 7,9}

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 13
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
R1 ={(x, y) | y = 2 + x, x  X, y  Y}
 R1 = {(1, 3), (3, 5)}
 (5, 5)  R2
While, 5  X
So, R2 is not a relation from X to Y.
 (5, 7)  R3
While, 5  X
So, R3 is not a relation from X to Y.
 (7, 9)  R4
 7X
So, R4 is not a relation from X to Y.

5. (B)
Reflexivity:
 R  
This is not true.
So, given R is not Reflexive.
Symmetry :
R
R
So, given R is Symmetric.
Transitivity;
R
R
R: not true,
So, given R is not Transitive.

6. (C)
 a R b  1 + ab > 0
Reflexivity:
a R a  1 + a2 > 0
This is true  a  R
So, given relation is reflexive.
Symmetry :
 a R b  1 + ab > 0
 b R a  1 + ba > 0 : True ( ab = ba)
So, given relation is symmetric.
Transitivity.
 (1, 0)  R
(0, –1)  R
While, (1, –1)  R ( 1 + 1 × (–1) = 0)
So, given relation is not Transitive.
Ans. (C) symmetric

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 14
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
7. (A)
x R1 y  | x | = | y |
Reflexivity : x R1 x  | x | = | x |
Symmetry : x R1 y  | x | = | y |
|y|=|x|
 y R1 x
So, Symmetric
Transitivity :
x R1 y  | x | = | y |
y R1 z  | y | = | z |
 |x|=|z|
 x R1 z
 R is equivalence relation on R.
x R2 y  x  y
2 R2 1  2  1
While, 1 R2 2  1  2 : False
So, not symmetric,
x R3 y  x | y
1 R3 2  1 | 2
While, 2 R3 1  2 | 1, False
So, not symmetric.
x R4 y  x < y
1 R4 2  1 < 2
2 R4 1  2 < 1, False
So, not symmetric.
Hence, Option (A) is Correct.

8. (C)
 Two points P and Q in a plane
are related if OP = OQ, where O is a fixed point.
Reflexivity :
OP = OP, True
Symmetricity :
 OP = OQ
 OQ = OP True
Transitivity :
 OP = OQ
& OQ = OR
 OP = OR True
So, given relation is an equivalence relation,

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 15
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
9. (D)
A = {1, 2, 3}
by a R b is | a2 – b2|  5
 R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3), (3,2)}
Domain of R = {1, 2, 3}
R–1 = {(1, 1), (2, 2), (3, 3), (2, 1), (1, 2), (3, 2), (2, 3)}
=R
 R–1 = R
So, (D) is False.

10. (A)
 x2 – 4xy + 3y2 = 0
 x2 – xy – 3 xy + 3y2 = 0
 x (x – y) – 3y (x – y) = 0
 (x – y) (x – 3y) = 0
 x = y or, x = 3y
R = {(1, 1), (2, 2), (3, 3), (4, 4), ..... (3, 1), (6, 2), (9, 3), (12, 4), .......}
Reflexivity :
(1, 1), (2, 2), (3, 3), (4, 4), .....  R
So, it is reflexive.
Symmetry :
 (3, 1)  R
But (1, 3)  R
So, not Symmefric.
Transitivity :
 (9, 3), (3, 1)  R
but (9, 1)  R
So, not Transitive.

11. (B)
 A = {2, 3, 4, 5}
& R = {(2, 2), (3, 3), (4, 4), (5, 5), (2, 3), (3, 2), (3, 5), (5, 3)}
Reflexivity :
 (2, 2), (3, 3), (4, 4), (5, 5),  R
So, it is Reflexive.
Symmetricity :
 (2, 3), (3, 2)  R
(3, 5), (5, 3)  R
(2, 2), (3, 3), (4, 4), (5, 5)  R
So, it is Symmetric.

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 16
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
Transitivity :
 (5, 3), (3, 2)  R
 (5, 2)  R
So, it is not Transitive.

12. (A)
 A = {2, 3}
B = {1, 2}
 A × B = {(2, 1), (2, 2), (3, 1), (3, 2)}
13. (D)
 (a, b) R (c, d)  a + d = b + c
Reflexivity :
(a, b) R (a, b)  a + b = b + a True
Symmetricity :
(a, b) R (c, d)  a + d = b + c
(c, d) R (a, b)  c + b = d + a
a+d=b+c True
Transitivity :
(a, b) R (c, d)  a + d = b + c ...(i)
(c, d) R (e, f)  c + f = d + e ....(ii)
From (i) + (ii), we get.
a+d+c+f=b+c+d+e
 a+f=b+e
 (a, b) R (e, f)
So, it is transitive.
So, (D) An Equivalence relation.

14. (D)
 (a, b) R (c, d)  a d (b + c) = bc (a + d)

1 1 1 1
   
c b d a
Reflexivity :
(a, b) R (a, b)  a b (b + a) = ba (a + b) True
Symmetry :
(a, b) R (c, d)  a d (b + c) = b c (a + d)
 c b (d + a) = da (c + b)
 (c, d) R (a, b)
So, It is symmetric.
Transitivity
(a, b) R (c, d)  a d (b + c) = bc (a + d)

1 1 1 1
    .....(i)
c b d a
(c, d) R (e, f)  cf (d + e) = de (c + f)

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 17
Maths IIT-JEE ‘Best Approach’ MCSIR Relation

1 1 1 1
    .....(ii)
e d f c
From (i) + (ii), we get

1 1 1 1 1 1 1 1
      
c b e d d a f c

1 1 1 1
   
b e a f

eb f a
 
be af
 af (b + e) = be (a + f)
 (a, b) R (e, f)
So, it is transitive.
Hence, given relation is an equivalence relation.

15. (C)
 A = {1, 2, 3}
B = {1, 4, 6, 9 }
R = {(2, 1), (3, 1)}
 Range of R = { 1 }

16. (D)
(l1, l2)  1 || 2
Reflexivity :
(1, 1)  1 | | 1
So, Reflexive.
Symmetry :
(1, 2)  1 | | 2
 2 | | 1
2, 1)
So, symmetric.
Transitivity :
(1 ,2)  1 | | 2
(2 ,3)  2 | | 3
 1 | |2 &2 | | 3
 1 | |3
 (1 | |3)  R
So, Transitive.
Hence, it is equivalence Relation.

17. (D)
 n (A) = 3
n (B) = 4
Let A = {a, b, c} & B ={a, b, d, e}

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 18
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
 A × B = { (a, a), (a, b), (a, d), (a, e), (b, a), (b, b), (b, d), (b, e), (c, a), (c, b), (c, d), (c, e) }
All elements of A × B are different
Hence, the no of relations from A to B is 23 × 4
i.e, 212

18. (D)
For n, m  N
n | m means that n is a factor of m.
Reflexivity
n | n means that n is a factor of n. n  N
So, it is Reflexive.
Symmetricity
n | m : n is a factor of m.
For n  m, m is not a factor of n.
So, it is not symmetric.
Transitivity :
n | m : n is a factor of m
m | k : m is a factor of k.
n | k : n is a factor of k.
So, it is Transitive.

19. (A)
 R = { (x, y) : x, y  A, x + y = 5}
Where A = {1, 2, 3, 4, 5}
 R = {(1, 4), (4, 1), (2, 3), (3, 2)}
Reflexivity :
 (1, 1)  R
So, not Reflexive.
Symmetricity :
 (1, 4), (4, 1)  R
Also, (2, 3), (3, 2)  R
So, it is symmetric.
Transitivity :
 (1, 4), (4, 1)  R
But, (1, 1)  R
So, Not Transitive.

20. (B)
If R = R–1
Then R is Symmetric.

21. (A)
Reflexivity
xRx xx True.
Anti-symmetricity :

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 19
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
xRyxy ......(i)
yRxyx .....(ii)
From (i) & (ii)
x=y
So, Anti symmetric
Transitivity :
xRy  xy .....(i)
yRz  yz .....(ii)
From (i) & (ii) x  z
So, x R z,
So, Transitive
Hence,
Given relation is a partial order relation.

22. (C)
R is a relation from A to B,
If R  A × B

23. (C)
 A = {1, 2, 3}
 A × A = {(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)}
For Reflexive
At least, (1, 1), (2, 2), (3, 3)  R
For symmetric,
If (1, 2)  R
Then (2, 1) Should be in R.
Sinilarly, for (2, 3)  R,
Then (3, 2) should be in R.
For Transitive
If (1, 2), (2, 3)  R
Then (1, 3) should be in R.
For equivalence relation.
(1, 1), (2, 2), (3, 3),
(1, 2), (2, 1)
(2, 3), (3, 2)
(1, 3), (3, 1)
So, the minimum no of ordered pairs which when added to R make it an equivalence relation = 9– 2 = 7

24. (B)
 (x, y) | x2 + y2 = 1
 y2 + x2 = 1
 (y, x)
So, Symmetric.

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 20
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
25. (B)
Let A1 = {1, 2}
A2 = {3, 4}
& A3 = {1, 5}
Reflexivity
AA=A
Need not Empty.
So, not Reflexive
Symmetricity:
If A  B = 
Then Surely, B  A = 
So, Symmetric
Transitivity
Take A1 = {1, 2}
A2 = {3, 4}
A3 = {1, 5}
 A1  A2 = 
A2  A3 = 
But A1  A3 = {1} 
So, Not Transitive

26. (D)
If R is reflexive, symmetric and transitive on A,
then R is called an Equivalence relation on A.

27. (C)
 A = {1, 2, 3, 4}
B = {1, 3, 5}
Here
R = {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)}
R – 1 = {(3, 1), (5, 1), (3, 2), (5, 2), (5, 3), (5, 4)}
ROR–1
R–1 R
B A B

1
1 1
2
3 3
3
5 5
4

 ROR–1 = {(3, 3), (3, 5), (5, 3), (5, 5)}

28. (C)
If R is an equivalence relation.
Then R–1 is also an equivalence relation.

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 21
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
29. (B)
If R and S be two equivalence relation in a set A,
Then R  S is an equivalence relation in A.

30. (D)
 A = {p, q, r}
 (q, q)  R1
So, Not reflexive.
Hence, Not Equivalence relation.
 (p, p)  R2
So, not Reflexive
Hence, not equivalence relation.
and  (p, q)  R3
But (q, p)  R3
So, Not symmetric
Hence, Not equivalence relation.

Exercise 2
(Previous Years JEE Main Questions)

1. (B)
Given R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} be a relation on the set A = {1, 2, 3, 4}.
(A) Since, (1, 3)  R and (3, 1)  R but (1, 1)  R. So, R is not transitive.
(B) Since, (2, 3)  R but (3, 2)  R. So, R is not Symmetric.
(C) Since, (1, 1), (2, 2), (3, 3), (4, 4)  R. So, R is not reflexive.
(D) Since, (2, 4)  R and (2, 3)  R So, R is not a function.

2. (A)
Since, for every element of A there exist elements (3, 3) (6, 6), (9, 9), (12 12)  R  R is reflexive relation.
Now (6, 12)  R but (12, 6)  R, so it is not a symmetric relation.
also, (3, 6), (6, 12)  R  (3, 12)  R.
 R is transitive relation.

3. (A)
Let W = {CAT, TOY, YOU, ......}
Clearly, R is reflexive and symmetric but not transitive.
[Since CATRTOY, TOYRYOU CAT
T
RYOU]

4. (D)
Since, (1, 2)  S but (2, 1)  S
 S is not symmetric.
Hence, S is not an equivalence relation.
Given, T = {(x, y) : (x – y)  I}
Now, x – x = 0  I, it is reflexive relation
Again now, (x – y)  I

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 22
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
 y – x  I, it is symmetric relation.
Let x – y = I1 and y – z = I2
Now, x – z = (x – y) + (y – z)= I1 + I2  I
 T is also transitive.
Hence, T is an equivalence relation.

5. (C)
Since, the relation R is defined as
R = {(x, y) | x,y are real numbers and
x = wy for some rational number w}
(i) Reflexive xRx  x = wx
 w = 1  Rational number
 The relation R is reflexive.
(ii) Symmetric xRy yRx as 0R1
 0 . (1) but 1R0  1 = w. (0),
Which is not true for any rational number.
 The relation R is not symmetric
Thus, R is not equivalence relation.
Now, for the relation S is defined as

 m p  
S   ,   m, n , p and q  integers
 n q  

such that n, q  0 and qm = pn}

m m
(i) Reflexive R  mn = mn (True)
n n
 The relation S is reflexive.

m p
(ii) Symmetric R  mq = np
n q

p m
 np = mq  R
q n

 The relation S is symmetric.

m p p r
(iii) Transitive R and R
n q q s

 mq = np and ps = rq
 mq . ps = np. rq
 ms = nr

m r
 
n s

m r
 R
n s
 The relation S is transitive.
 the relation S is equivalence relation.

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 23
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
6. (A)
Statement I A = {(x, y)  R × R : y – x is an integer}
Reflexive
xRx : (x – x) is an integer.
i.e., True
 Reflexive
Symmetric
xRy : (x – y) is an integer.
 –(y – x) is an integer.
 (y – x) is an integer.
 yRx  Symmetric
Transitive
xRy and yRz
 (x – y) is an integer and (y – z) is an integer.
 (x – y) + (y – z) is an integer
 (x – z) is an integer
 xRz  Transitive
 Equivalence Relation
Statement 2 B = {(x, y)  R × R : x = y for some rational number }.
If =1
xRy : x = y (To check equivalence)
Reflexive :
xRx : x = x (True)
 Reflexive
Symmetrics
xRy : x = y  y = x  yRx
 Symmetric
Transitive
xRy and yRz
 x = y and y = z  x = z
 xRz  Equivalence
 Both are true but statement II is not correct explanation of Statement I.

7. (C)
Given,
R = {(A, B) | A = P–1 BP for some invertible matrix P}
To check equivalence
(i) Reflexive
ARA  A = p–1 AP, which is true only, if P = I
Since, A = p–1 BP for some invertible matrix P.
 We can let P = I
 ARA  A = I–1 AI
A = A,  Reflexive
Note Here, due to some invertible matrix P is used ( Reflexive) but if for all invertible matrix is used. Then, R is not
reflexive.)

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 24
Maths IIT-JEE ‘Best Approach’ MCSIR Relation
(ii) Symmetric
ARB  A = P–1 BP
 PAP–1 = P(P–1 BP) P–1
 PAP–1 = (PP–1) B(PP–1)
 B = PAP–1
Since, for some invertible matrix P.
 We can let R = P–1
 B = (P–1) AP
 BRA  Symmetric.
(iii) Transitive
ARB and BRC
A = P–1 BP
and B = P–1 CP
 A = P–1 (P–1 CP) P
= (P – 1)2 C(P)2
 ARC, for some P2 = P  Transitive
 R is equivalence.
 Both statements are true but second is not the correct explanation of first.

Get 10% Instant Discount On Unacademy Plus [Use Referral Code: MCSIR] 25