Abdullah Rahman

Relation -CH-1

Relation: A relation R from a non-empty set A to non-empty set B is a subset of A × B ,

R={ ( a , b ) :a ∈ A , b∈ B∧( a ,b ) ⊆ A × B }

The first element of ordered pair is domain and second element of ordered pair is range of the
relation.
Total number of relation from set A to Set B consisting of m and nelements is 2mn
Example: let A= { 1 , 2 }∧B= {a }

A × B= { ( 1 ,a ) , ( 2 , a ) }

Now subsets of A × B , R1= {(1 , a) }, R2= {(2 , a) }, R3= { ( 1 ,a ) ,(2 , a) } , R 4= ∅

Hence, no. of subsets = 22=4

Here each subset is a relation. Hence, the no of relation = 2no . of ordered pairs
1. Relation on a set: A relation on a set A is a subset of A × A
2. ∅ ( ∅ )∧ A × A ( universal set ) , which contain all the elements of A × A are subsets of A × A so
they are also relation on set A.
3. ∅ is called empty relation.
4. A × A is Universal relation
Let A = { 3 , 4 }

A × A={ 3 , 4 } × { 3 , 4 }={ ( 3 , 3 ) , ( 3 , 4 ) , ( 4 , 3 ) , ( 4 , 4 ) }

Subset, R1= { ( 3 ,3 ) }, R2= { ( 3 , 4 ) } , R3= { 4 , 3 } , R4 ={ ( 4 , 4 ) } , R5 ={ ( 3 , 3 ) , ( 3 , 4 ) }

R6 ={ ( 3 , 3 ) , ( 4 , 3 ) } , R 7= {( 3 , 3 ) , ( 4 , 4 ) } , R8 ={ ( 3 , 4 ) , ( 4 , 3 ) } ,

R9 ={ ( 3 , 4 ) , ( 4 , 4 ) } , R10= { ( 4 ,3 ) , ( 4 , 4 ) }

R11 ={ ( 3 , 3 ) , (3 , 4 ) , ( 4 ,3 ) }, R12= {( 3 , 3 ) , ( 4 ,3 ) , ( 4 , 4 ) } ,

R13= { (3 , 4 ) , ( 4 ,3 ) , ( 4 , 4 ) } , R14= { ( 4 , 4 ) , ( 3 ,3 ) , ( 3 , 4 ) } ,

R15= { (3 ,3 ) , ( 3 , 4 ) , ( 4 , 3 ) , ( 4 , 4 ) } , R 16=∅
2
Hence, no. of relation = 22 =16
2
Therefore, number of relation on a set A consisting of n elements = 2n

Type of Relation on a set.

(i) R = ∅ Empty relation
Let A={ 1 ,2 } ∧B={ 3 ,5 }
Let R={ ( a , b ) :a ∈ Aand b ∈ B , a+bis odd } is an empty relation.
(ii) Universal relation: R = A × A ,
A relation R on a set is called universal relation if each element of A is related to every
element in A. that is it contains all the subsets of A × A . R15 in the above example.

1
 Abdullah Rahman
Relation -CH-1

(iii) Identity Relation: A relation R on a set A is said to be identity relation on A, if

R={ ( a , b ) :a ∈ A∧b ∈ A where a=b }
Thus , for Identity Relation, R={ ( a , a ) : ∀ a ∈ A }. It is denoted as I A on set A
Let A={ 1 ,2 , 3 }
I A= { ( 1, 1 ) , ( 2, 2 ) , ( 3 ,3 ) }

In an identity relation on a set A, every element of A is should be related to itself only

Reflexive. Symmetric, Transitive Relations:
1. Reflexive: A relation R on a set A is said to be reflexive if aRa ∀ a ∈ A
⇒ ( a , a ) ∈ R for ∀ a ∈ A
Example . The relation ‘ ¿ ' on Z is reflexive on Z for all a ∈ Z , a=a
Let A={ 1 ,2 , 3 } and
R1= { ( 1, 1 ) , ( 2, 2 ) , ( 3 ,3 ) } ,
R2= { ( 1, 1 ) , ( 2, 2 ) , ( 3 ,3 ) , ( 1 , 2 ) , ( 2 , 1 ) , ( 1 , 3 ) },
R3= { ( 2 ,2 ) , ( 2 ,3 ) , ( 3 , 2 ) , ( 1 , 1 ) }
Her, R1 and R2 are reflexive relation on A and R3 is not as ( 3 , 3 ) ∉ A × A
2. Symmetric: A relation R on a set A is said to be symmetric relation
if aRb ⇒ bRa i.e., ( a , b ) ∈ R ⇒ ( b , a ) ∈ R , for all a , b ∈ A
3. Transitive: A relation R on a set A is said to be Transitive relation, if
( i ) ( a , b ) ∈ Rand (b , c)∉ R
( ii ) ( a , b ) ∈ Rand ( b , c ) ∈ R ⇒ ( a , c ) ∈ R , for all a , b , c ∈ A
Example 1: Let R = { ( 2 , 3 ) , ( 4 , 5 ) , ( 7 , 8 ) }
Solution: R is transitive, ∵ ( a , b ) ∈ Rand (b , c )∉ R
Example 2: Let R = { ( 2 , 4 ) , ( 4 , 5 ) , ( 2, 5 ) }
Solution R is transitive, ∵ ( a , b ) ∈ Rand ( b , c ) ∈ R ⇒ ( a , c ) ∈ R , for all a ,b ,c ∈ given set .
Example 3: Let R = { ( 1 , 2 ) , ( 2 , 4 ) ,(2 ,1) ( 4 , 5 ) , ( 2 ,5 ) , }
Solution R is not transitive, ∵ ( 1, 2 ) ∈ Rand ( 2 , 1 ) ∈ R but(1, 1)∉ R
Equivalence Relation: A relation R in a set A is said to be an equivalence relation if R is
reflexive, symmetric and transitive.
Example 2: Let T be the set of all triangles in a plane with R a relation in T given by
R = {(T 1 , T 2) : T 1 is congruent to T 2 }. Show that R is an equivalence relation.
Solution: R is reflexive, since every triangle is congruent to itself.
Further, (T 1 , T 2 ) ∈ R ⇒ T 1 is congruent to T 2 ⇒ T 2 is congruent to T 1 ⇒ (T 1 , T 2 ) ∈ R.
Hence, R is symmetric.
Moreover, (T 1 ,T 2 ), (T 2 , T 3 ) ∈ R ⇒ T 1 is congruent to T 2 and T 2 is congruent to T 3
⇒ T 1 is congruent to T 3 ⇒ (T 1 , T 3 ) ∈ R.
Therefore, R is an equivalence relation.
Example 3 Let L be the set of all lines in a plane and R be the relation in L defined as
R = {(L1, L2): L1 is perpendicular to L2. Show that R is symmetric but neither reflexive nor
transitive.
Solution R is not reflexive, as a line L1 cannot be perpendicular to itself,
i.e., ( L1 , L1) ∉ R.

2
 Abdullah Rahman
Relation -CH-1

R is symmetric as ( L1 , L2) ∈ R
⇒ L1 is perpendicular to L2 ⇒ L2is perpendicular to L1 ⇒ ( L1 , L2 ) ∈ R.
R is not transitive.
Indeed, if L1 is perpendicular to L2 and L2 is perpendicular to L3, then
L1 can never be perpendicular to L3. In fact, L1 is parallel to L3.
i.e., ( L1 , L2) ∈ R, ( L2 , L3 ) ∈ R but ( L1 , L3 ) ∉ R.

Example 4 Show that the relation R in the set {1, 2, 3} given by

R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)} is reflexive but neither symmetric nor transitive.
Solution: R is reflexive, since (1, 1), (2, 2) and (3, 3) lie in R. Also, R is not symmetric,
as (1, 2) ∈ R but (2, 1) ∉ R. Similarly, R is not transitive, as (1, 2) ∈ R and (2, 3) ∈ R
but (1, 3) ∉ R.
Example 5: Show that the relation R in the set Z of integers given by
R = {(a, b): 2 divides a – b} is an equivalence relation.
Solution: R is reflexive, as 2 divides (a – a) for all a ∈ Z.
Further, if (a, b) ∈ R, then 2 divides a – b. Therefore, 2 divides b – a.
Hence, (b, a) ∈ R, which shows that R is symmetric.
Similarly, if (a, b) ∈ R and (b, c) ∈ R, then a – b and b – c, are divisible by 2.
Now, a – c = (a – b) + (b – c) is even.
So, (a – c) is divisible by 2. This shows that R is transitive.
Thus, R is an equivalence relation in Z.
Equivalence classes. Let A be a non-empty set and R be an equivalence relation on set A .Let a
be an element of A . The set of all elements of A which are related to a is denoted by [ a ] and is
called equivalence class containing a
∴ [ a ] = { x : x ∈ A , xRa i .e . ( x , a ) ∈ R }
Number of relation on set A × A which are Reflexive and symmetric.
Consider the table of A × A of set A containing n elements
If A={ a1 , a2 , a3 , a4 , a5 , … … … . a5 }then A × A
A× A a1 a2 a3 a4 …….. an
a1 (a 1 , a1 ¿ (a 1 , a2 ¿ (a 1 , a3 ¿ (a 1 , a 4 ¿ ….. (a 1 , a n ¿
a2 (a 2 , a1 ¿ (a 2 , a2 ¿ (a 2 , a3 ¿ (a 2 , a 4 ¿ …… (a 2 , a n ¿
a3 (a 3 , a 1 ¿ (a 3 , a 2 ¿ (a 3 , a 3 ¿ (a 3 , a 4 ¿ ……. (a 3 , a n ¿
a4 (a 4 , a1 ¿ (a 4 , a2 ¿ (a 4 , a3 ¿ (a 4 , a4 ¿ ……. (a 4 , an ¿
. . …
. .
. .
an an, a1¿ an, a2¿ an, a3¿ an, a4 ¿ (a n , a n ¿

Total number of elements in ordered pair = n2, Element of the type ( a i , ai ¿ = n

Leaving the elements of the type ( a i , ai ¿ the number of elements left = n2 −n

3
 Abdullah Rahman
Relation -CH-1

Number of pairs with reverse order which are on each side of the opposite side of main
2
n −n
diagonal is
2
Number of relation R on set A consisting of n elements
 R is subset of A × A which is n2 elements
 Each element has two choices to appear in R either it be there or not
Since, there are two choices for every element to be there or not be there

2
Hence the number of relation = 2n

Number of Reflexive relation on Set A

For relation to be reflexive n−pair ( a i , ai ¿ 1 ≤i ≤ n must be there in R

Now the remaining (n 2−n) elements have two choices either they will be there or will
not be there.
2
Hence, the total number of reflexive relation is 2(n −n )

Number of symmetric relation on set A

(i) A={ a1 , a2 , a3 , a4 , a5 , … … … . a5 }
(ii) For relation to be symmetric n−pair
( a i , ai ¿ 1 ≤i ≤ n have two choice to appear
in R either be there or not which is equal to
n
2
2
n −n
(iii) elements which are on the either side
2
of main diagonal elements have two choices
2
n −n
to appear in R, either be there or not be there, which is equal to 2 2

2
n −n
(iv) Now , other have only one choice to appear in R if any element of one side of main
2
diagonal is present.
So the total number of symmetric relation will be product of choices of (ii) and (iii)
= 2n ×2 2 = 2n +( 2 ) = 2 2
2 2 2
n −n n −n n +n

Example: How many relation are there in set A = { a , b , c }.How many of them are (i ) reflexive
and (ii) symmetric.
Solution: Total number of elements in A is 3
3
Hence, Number of relation in set A = 23 =2 9=512
2
Number of reflexive relation = 2(n −n )=2n (n−1) =23 ×2=26 =64
n (n +1) 3×4
Number of symmetric relation = 2 =2 =2 =64 2 2 6

Very short answer type questions on relation. (carrying 2marks each)

4
 Abdullah Rahman
Relation -CH-1

1. Check if the relation R defined on R in the set A= { 1 , 2, 3 , 4 } defined as

R = { ( a ,b ) : a∣b } is (i) is symmetric. (ii) Transitive.
2. Let A= { 1 , 2, 3 , 4 } . Let R be the equivalence relation on A × A defined by ( a , b ) R ( c , d ) iff
a+ d=b+ c Find the equivalence class (1,3)
Solution: [ ( 1 ,3 ) ] ={ ( x , y ) ∈ A × A : x+ 3= y +1 } = { ( x , y ) ∈ A × A : y=x +2 }
= { ( 1 , 3 ) , (2 , 4 ) }
3. An equivalence relation R in set A divides it into equivalence classes A1 , A2 , A 3 , what is the
value of A1 ∪ A 2 ∪ A 3 , and A1 ∩ A 2 ∩ A 3
Solution: A1 ∪ A 2 ∪ A 3= A and A1 ∩ A 2 ∩ A 3= ∅
4. Let R be the relation in the set Z of integers given by R = { ( a ,b ) :2∣( a−b ) } show that R is
transitive. Write the equivalence class [0]. CBSE 2020
Short answer type questions on relation. (carrying 3 marks each)
5. Check whether the relation R defined on set A = { 1 , 2, 3 , 4 ,5 , 6 } as R={ ( a , b ) :b=a+1 } is
reflexive, symmetric or transitive. CBSE2019
6. Show that R the relation in the set Z of integers given by R = { ( a ,b ) :2∣( a−b ) } is equivalence
relation. CBSE 2019
7. Show that relation S in the set A= { x ∈ Z :0 ≤ x ≤ 12 } given by
R = { ( a ,b ) : a , b ∈ Z ,|a−b|is divisible by 3 } is an equivalence relation.
8. Show that relation R on R defined as R={ ( a , b ) :a ≤ b } is reflexive and transitive but not
symmetric.
Long Answer type (4) marks
9. Let N denotes the set of all natural numbers and R be relation on N × N defined by
(a, b) R(c, d) if ad ( b+ c )=bc (a+ d). Show that R is equivalence relation. CBSE 2015
Solution: Here R is a relation defined as
R={(a , b), (c ,d )¿: ad (b+ c)=bc (a+d )}

Reflexivity: By commutative law under addition and multiplication

b+ a=a+b ∀ a , b ∈ N and ab=ba ∀ a , b ∈ N

ab (b+ a)=ba( a+b) ∀ a , b∈ N

⇒ (a , b)R (a , b) Hence, R is reflexive.

Symmetry: Let (a ,b) R(c , d)

(a ,b) R(c , d)⇒ ad (b+c )=bc (a +d )

⇒ bc (a+d )=ad (b+c )

⇒ cb(d + a)=da(c+ b)¿ [By commutative law under addition

⇒(c , d)R ¿Hence, R is symmetric.

5
 Abdullah Rahman
Relation -CH-1

Transitivity: Let (a ,b) R(c , d) and (c , d) R(e , f )

Now, (a ,b) R(c , d) and (c , d) R(e , f )

⇒ ad ( b+ c )=bc ( a+d ) and cf ( d+ e )=de ( c+ f )

b+ c a+ d d +e c+ f
⇒ = and =
bc ad de cf

1 1 1 1 1 1 1 1
⇒ + = + and + = +
c b d a e d f c

Adding both, we get

1 1 1 1 1 1 1 1
⇒ + + + = + + +
c b e d d a f c

1 1 1 1 e+ b f + a
⇒ + = + ⇒ =
b e a f be af

⇒ af (b+ e)=be (a+ f )⇒(a ,b) R(e , f )[c , d ≠ 0]

10. Show that the relation R in the set N × N defined by (a, b) R(c, d) if a 2+ d 2=b2 +c 2
∀ a , b , c , d ∈ N is an equivalence relation.
11. Given a non-empty set X, define the relation R in P(X) as follows for
A,B∈ P ( X ) , ( A , B ) ∈ Riff A ⊂ B . Prove that R is reflexive, transitive and not symmetric.
Solution: let A ∈ P ( X ) . then A ⊂ A
⇒ ( A , A ) ∈ R Hence, R is reflexive.
Let A , B ,C ∈ P ( X ) such that (A, B) ,(B,C) ∈ R
⇒ A ⊂ B , … (i) and B⊂C … ( ii )
From ( i )∧( ii ) ⇒ A ⊂ C
⇒( A , C )∈ R
Hence , R is transitive
∅ , X ∈ P ( X ) such that ∅ ⊂ X . Hence , ( ∅ , X ) ∈ R
But X is not a⊂of ∅ which implies that ( X , ∅ ) ∉ R
Thus R is not symmetric.
Case Study Relation and function.

CASE STUDY 1:
A general election of Lok Sabha is a
gigantic exercise. About 911 million
people were eligible to vote and voter
turnout was about 67 % , the highest
ever Let I be the set of all citizens of
India who were eligible to exercise
their voting right in general election
held in 2019.

6
 Abdullah Rahman
Relation -CH-1

A relation ' R ' is defined on I as follows:

R={(V 1 , V 2):V 1 , V 2∈ I and both use their voting right in general election −2019 }

1 Two Neighbours X and Y ∈ I . X exercised his voting right while Y did not cast her vote in
general election −2019. Which of the following is true?
a. (X , Y )∈ R b. (Y , X )∈ R c. (X , X )∉ R d. (X , Y )∉ R
Solution: Two neighbours X and Y∈ I since X exercised his voting right while Y did not
cast the vote therefore, (X , Y )∉ R option (d) is correct.
2 Mr.' X ' and his wife ' W 'both exercised their voting right in general election −2019 , Which
of the following is true?
a. both (X , W ) and (W , X )∈ R b. (X , W )∈ R but (W , X )∉ R
c. both (X , W ) and (W , X )∉ R d. (W , X )∈ R but (X , W )∉ R
Solution: Since, Mr X and His wife cast their votes, both (X , W ) and (W , X )∈ R
Hence, correct option is (a)
3 Three friends F 1 , F 2 and F 3 exercised their voting right in general election-2019, then which
of the following is true?
a. (F 1 , F 2)∈ R ,(F 2 , F 3)∈ R and (F 1 , F 3)∈ R
b. (F 1 , F 2)∈ R ,(F 2 , F 3)∈ R and (F 1 , F 3)∉ R
c. (F 1 , F 2)∈ R ,(F 2 , F 2)∈ R but (F 3 , F 3)∉ R
d. (F 1 , F 2)∉ R ,(F 2 , F 3)∉ R and (F 1 , F 3)∉ R
Solution: Since, friends F 1 , F 2 and F 3 exercised their voting right in general election-2019
then . (F 1 , F 2)∈ R ,(F 2 , F 3)∈ R and (F 1 , F 3)∈ R Hence, correct option is (a)
4 The above defined relation R is
a. Symmetric and transitive but not reflexive
b. Universal relation
c. Equivalence relation
d. Reflexive but not symmetric and transitive
This relation is equivalence relation. Hence, correct option is ( c )
5 . Mr. Shyam exercised his voting right in General Election - 2019, then Mr. Shyam is related
to which of the following?
a. All those eligible voters who cast their votes
b. Family members of Mr.Shyam
c. All citizens of India
ANSWERS

1 (d) (X , Y )∉ R 2.(a) both (X , W ) and (W , X )∈ R

3.(a) (F 1 , F 2)∈ R ,(F 2 , F 3)∈ R and ( F 1 , F 3 ) ∈ R 4.(c) Equivalence relation
5.(a) All those eligible voters who cast their votes
CASE STUDY 2
Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice,

7
 Abdullah Rahman
Relation -CH-1

Sherlin's sister Raji observed and noted the possible outcomes of the throw every time
belongs to set {1 , 2 ,3 , 4 , 5 ,6 } . Let A be the set of players while B be the set of possible
outcomes.

A={S , D}, B={1 , 2 ,3 , 4 ,5 , 6 }

1 Let R : B→ B be defined by R={(x , y): y is divisible by x } is

a. Reflexive and transitive but not symmetric
b. Reflexive and symmetric and not transitive
c. Not reflexive but symmetric and transitive
d. Equivalence
2 Raji wants to know the number of functions from A to B. How many number of
functions are possible?
a. 6 2 b.26 c. 6 ! d. 212
3. Let R be a relation on B defined by R={(1, 2), (2 ,2),(1 ,3) ,(3 , 4),(3 , 1), (4 ,3),(5 , 5)}.
Then R is
a. Symmetric b. Reflexive c. Transitive d. None of these three

4. Raji wants to know the number of relations possible from A to B. How many numbers of
relations are possible?
a. 6 2 b. 26 c. 6 ! d. 212

5 Let R : B→ B be defined by R={(1, 1),(1, 2), (2 ,2) ,(3 , 3),(4 , 4 ),(5 ,5),(6 , 6)} , then R
is
a. Symmetric b. Reflexive and Transitive
c. Transitive and symmetric d. Equivalence
ANSWERS
1. (a) Reflexive and transitive but not symmetric
2. (a) 6 2
3. (d) None of these three
4. (d) 212
5. (b) Reflexive and Transitive

8
 Abdullah Rahman
Relation -CH-1