Title: Relation and Function

Chapter: Relation and Function

Approximate Time to Complete (to be filled by student): ________________________
Total Marks Scored:
Worksheet Compiled By: Prashant Jain (PJ Sir)

 Attempt the worksheet in one go. See answers in one go at the end.
 All questions carry 4 marks for positive and -1 if you leave and -2 if you attempt
incorrectly.
 All proving or show questions (if done correctly) are of 4 marks. There is no negative
marking.
 If you cheat in worksheet then you are only cheating and such sinners do not get
selection in JEE so for your own sake refrain from cheating.
 Maintain the solutions of this worksheet and share the link of solution pdf in the
tracker if you want to be monitored.

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

Example # 4 : 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)}.

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
Solution: The relation R3 is identity 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

Example # 5 : Which of the following are reflexive relations on set A = {1, 2, 3}.
R1 = {(1, 1), (2, 2), (3, 3), (1, 3), (2, 1)}, R2 = {(1, 1), (3, 3), (2, 1), (3, 2)}..

Solution : R1 is a reflexive relation on set A.

R2 is not a reflexive relation on A because 2  A but (2, 2)  R2.

Example # 6 : Prove that on the set N of natural numbers, the relation R defined by x R y  x is less than y is
transitive.
Solution : 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.

Example # 7 : 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.

Solution : Since a relation R in T is said to be an equivalence 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.

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

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

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

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
Self Practice Problem :
(5) 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 prove that R is a symmetric relation on L.

(6) 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. Prove that R is an equivalence relation.

Exercise – I
Section (A) : Types of Relation
1. Identify the type of relation among reflexive, symmetric and transitive.
(i) R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)} on set A = {1, 2, 3}.
(ii) P = {(x, y) | x2 + y2 = 1, x, y  R}

2. Prove that the relation ''less than'' in the set of natural number is transitive but not reflexive and
symmetric.

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

(i) R = {(p, q), (q, r), (p, r) (p, p)}
(ii) R = {(p, p), (q, q), (r, r) (q, p)}
(iii) R = {(p, p), (q, q), (r, r)}
(iv) R = {(p, p), (q, q), (r, r), (p, q), (q, r), (p, r)}
(v) R = {(p, p), (q, q), (r, r), (p, q), (q, p)}

4. Let R be a relation on the set N be defined by {(x, y)| x, y  N, 2x + y = 41}. Then prove that R is neither
reflexive nor symmetric and nor transitive.

5. Let n be a fixed positive integer. Define a relation R on the set of integers Z, aRb n|(a – b). Then prove
that R is equivalence

6. Let S be a set of all square matrices of order 2. If a relation R defined on set S such that
AR B AB = BA, then identify the type of relation of R (A, B S) among reflexive, symmetric and
transitive.

Section (B) : Types of Relation

1. The relation R defined in N as aRb b is divisible by a is
(A) Reflexive but not symmetric (B) Symmetric but not transitive
(C) Symmetric and transitive (D) Equivalence relation

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) Equivalence relation

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

(A) x R1y  x2 = y2 (B) x R2y  x  y (C) x R3y  x | y (x divides y) (D) x R4y  x < y

4. Let R1 be a relation defined by R1 = {(a, b)| a  b ; a, b  R} . Then R1 is

(A) An equivalence relation on R (B) Reflexive, transitive but not symmetric
(C) Symmetric, Transitive but not reflexive (D) Neither transitive nor reflexive but symmetric

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
5. Let L denote the set of all straight lines in a plane. Let a relation R be defined by R ,, L.
The R is
(A) Reflexive (B) Symmetric (C) Transitive (D) equivalence relation

6. Let S be the set of all real numbers. Then the relation R =

{(a, b) : 1 + ab > 0} on S is
(A) Reflexive and symmetric but not transitive
(B) Reflexive, transitive but not symmetric
(C) Symmetric, transitive but not reflexive
(D) Reflexive, transitive and symmetric

7. Consider the following :

1. If R = {(a, b)  N × N : a divides b in N} then the relation R is reflexive and symmetric but not
transitive.
2. If A = {1, 2, 3, 4, 5, 6} and R = {(S1, S2) : S1, S2 are subsets of A, S1  S2}, then the relation R is
not reflexive, not symmetric and not transitive.
Which of the statements is/are correct?
(A) 1 only (B) 2 only (C) Both 1 and 2 (D) Neither 1 nor 2

8. 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) Symmetric only (B) Transitive only (C) Reflexive only (D) Equivalence only

9. 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 R is
(A) Symmetric only (B) Transitive only (C) Reflexive only (D) Equivalence only

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

(A) Reflexive (B) symmetric (C) Transitive (D) Equivalence

11. Let S be a set of all square matrices of order 2. If a relation R defined on set S such that
AR B AB = O, where O is zero square matirx of order 2, then relation R is (A, B S)
(A) Reflexive (B) Transitive (C) Symmetric (D) Not equivalence

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
 Answer Key
Section (A) : Types of Relation
1. (i) Reflexive and transitive but not symmetric.
(ii) neither reflexive nor transitive but it is symmetric

3. (iii) & (v)

6. Reflexive and symmetric but not transitive

Section (B) : Types of Relation

1. (A) 2. (C) 3. (A) 4. (B) 5. (B)
6. (A) 7. (B) 8. (D) 9. (D) 10. (B)
11. (D)

Solution
Section (A) : Types of Relation
1. (i) For Reflexive
R  {(1,1) (2, 2) (3, 3)}
For symmetric (1, 2)  R but (2, 1)  R Not symmetric
for transitive (1, 2), (2, 3)  R  (1, 3)  R
so transitive
(ii) Obviously, the relation P is neither reflexive nor transitive but it is symmetric,
because x2 + y2 = 1  y2 + x2 = 1.

2. x < y, y < z  V x, y, z  N
x < z—
 xRy, yRz  xRz,  Relation is transitive,
 x < y does not give y < x.
Relation is not symmetric.
Since x < x does not hold, hence relation is not reflexive.

3. (i) (q, q )  R (ii) (p, q)  R (iv) (q, p)  R

Not reflexive not symmetric not symmetric

41
4. 2x + x = 41  x=  N  R is not reflexive
3
2x + y = 41   2y + x = 41  R is not symmetric
2x + y = 41 and 2y + z = 41  4x – z = 41  (x, z) R
 R is not transitive

5. aRb  n|(a – b) a, b  Z
n  +
(i) aRa  n|(a – a)  so R is reflexive
(ii) aRa  n|(a – b) = n|(b – a)  R is symmetric
(iii) aRb  n|(a – b) and n|(b – c) 
   n|(a – b) + (b – c)  n|(a – c)  R is transitive

6. Reflexive Relation :-
A.A = A.A for A  S , so Relation is Reflexive Relation
Symmetric Relation :-
A.B = BA  BA = AB  A,BS, so Relation is Symmetric Relation
Transitive Relation :-
AB = BA, BC = CB  AC = CA Not True,  A,B,CS

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
 1 2 1 0 2 3
for example A   , B    , C  AB = BA, BC = CB but AC  CA
1 3   0 1 4 5
so Relation is not Transitive Relation

Section (B) : Types of Relation

1. For any a  N, we find that a is divisible by a, therefore R is reflexive but R is not symmetric, because
aRb does not imply that bRa.

2. Since x | x, therefore R is not reflexive. Also x < y does not imply that y < x, So R is not symmetric. Let
xRy and yRz. Then x < y and y < z  x < z i.e., xRz. Hence R is transitive.

3. xR2y  x > y is not symmetric relation

xR3y  x / y is not symmetric relation
xR4y  x < y is not symmetric relation
xR1y  x2 = y2 is reflexive, symmetric and transitive so equivalence relation

4. For any a  R, we have a  a, Therefore the relation R 1 is reflexive but it is not symmetric as (2, 1)  R1
but
(1, 2)  R1. The relation R1 is transitive also, because (a, b)  R1, (b, c)  R1 imply that a  b and b  c
which is turn imply that a  c  (a, c) R1.

5. Here R     

Hence R is symmetric.

6. 1 + a.a = 1 + a2 > 0,  aS,  (a, a)  R

 R is reflexive
(a, b)  R  1 + ab > 0  1 + ba > 0  (b, a)  R
 R is symmetric.
 (a, b) R and (b, c)  R need not imply (a, c)  R
Hence, R is not transitive.

7. 1. R is not symmetric so it is incorrect.

2. S1  S2 so not reflexive
Let S1 = {1, 2, 3} & S2 = {1, 2}
it satisfies the condition
S1  S2  S2  S1
 So non symmetric.
let S1 = {1, 2}, S2 = {4, 5}, S3 = {1, 2, 3}
as S1  S2 and S1  S3 S1 S 3
so non transitive.

8. We have (a, b)R (a, b) for all (a, b)  N × N

Since a + b = b + a. Hence, R is reflexive.
R is symmetric for all (a, b), (c, d)  N × N we have (a, b) R (c, d) 
  a+d=b+c
 c+b=d+a  (c, d) R (a, b).
(a, b)R (c, d) and (c, d)R (e, f)
a + d = b + c and c + f = d + e,
 a+d+c+f=b+c+d+ea+f=b+e
 (a, b) R (e, f)  R is transitive
Thus, (a, b) R (c, d) and (c, d) R (e, f)  (a, b) R (e, f)

9. 1 || 2  R is reflexive.
1 || 2  2 || 1  R is symmetric.
1 || 2  2 || 3  1 || 3  R is transitive.

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222
10. R = {(x, y) ; x, y  A , x + y = 5} A = {1, 2, 3, 4, 5}
R = {(1 ,4), (2, 3), (3, 2), (4, 1)}
R is symmetric but neither reflexive nor transitive.

11. Reflexive Relation :-

A.A  0 for A  S so Relation is not Reflexive Relation
Symmetric Relation :-
A.B = 0  BA = 0 Not True  A,BS
0 0  0 0 
for example A   , B   AB = 0 but BA  0
2 0 0 2 
Transitive Relation :-
AB = 0, BC = 0  AC = 0 Not True,  A,B,CS
1 2 0 0  2 3
for example A   , B  , C  AB = 0, BC = 0 but AC  0
3 4  0 0  4 5

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: 75970-84242, 95490-43333/2222