Class 12th

Relations & Functions

Q.1) Show that the relation 𝑅 in set 𝑍 given by 𝑅{(𝑎 , 𝑏) ∶ 2 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑎 – 𝑏} is an Equivalence relation.
Sol.1) We have, 𝑅 = {(𝑎 , 𝑏) ∶ 2 𝑑𝑖𝑣𝑖𝑑𝑒 𝑎 – 𝑏}
Symmetric :
let (𝑎 , 𝑏) ∊ 𝑅
⇒ 𝑎 – 𝑏 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 2
⇒ 𝑎 – 𝑏 = 2𝜆 …...{𝜆𝜖𝑍}
⇒ 𝑏 – 𝑎 = −2𝜆 which is also divisible by 2
⇒ (𝑏 , 𝑎) ∊
.
. . R is Symmetric
Reflexive :
for each 𝑎 ∊ 𝑍
⇒ 𝑎 – 𝑎 = 0 which is divisible by 2
⇒ (𝑎 , 𝑎) ∊ 𝑅
... R is Reflexive
Transitive :
let (𝑎, 𝑏) ∊ 𝑅 and (𝑏 , 𝑐) ∊ 𝑅
⇒ 𝑎 – 𝑏 = 2𝜆 and 𝑏 – 𝑐 = 2 𝑘 …..{𝜆, 𝑘𝜖𝑍}
Now , 𝑎 – 𝑐 = (𝑎 – 𝑏) + (𝑏 – 𝑐)
⇒ 𝑎 – 𝑐 = 2𝜆 + 2𝑘
⇒ 𝑎 – 𝑐 = 2(𝜆 + 𝑘)which is also divisible by 2
⇒ (𝑎 , 𝑐) ∊ 𝑅
... R is transitive
since 𝑅 is Symmetric , Reflexive and transitive
... 𝑅 is an Equivalence relation ans.
Q.2) Show that the relation R in the set A, 𝐴 = {𝑥 ∊ 𝑧 ∶ 0 ≤ 𝑥 ≤ 12} given by 𝑅 = {(𝑎, 𝑏) ∶ (𝑎 – 𝑏)
is multiple of 4} is an equivalence relation. Find the set of all the elements in set A which are related
to 1.
Sol.2) We have , 𝑅 = {(𝑎 , 𝑏) ∶ |𝑎 – 𝑏| is multiple of 4}
Symmetric :
let (𝑎, 𝑏) ∊ 𝑅
⇒ |𝑎 – 𝑏| is multiple of 4
⇒ |𝑎 – 𝑏| = 4𝜆 …...(𝜆𝜖𝑧)
⇒ |𝑏 – 𝑎| = 4𝜆 which is multiple by 4
⇒ (𝑏, 𝑎) ∊ 𝑅
... R is Symmetric
Reflexive :
for each 𝑎 ∊ 𝐴
we have, |𝑎 – 𝑎| = 0 which is multiple of 4
⇒ (𝑎 , 𝑎) ∊ 𝑅
... R is Reflexive
Transitive :
 let (𝑎 , 𝑏) ∊ 𝑅 and (𝑏 , 𝑐) ∊ 𝑅
⇒ |𝑎 – 𝑏| = 4𝜆 and |𝑏 – 𝑐| = 4𝑘 …..{𝜆, 𝑘𝜖𝑍}
⇒ (𝑎 – 𝑏) = ±4𝜆 and (𝑏 – 𝑐) = −4𝑘
Now , (𝑎 – 𝑐) = (𝑎 – 𝑏) + (𝑏 – 𝑐)
⇒ (𝑎 – 𝑐) = ±4𝜆 ± 4𝑘
⇒ (𝑎 – 𝑐) = ±4(𝜆 + 𝑘)
⇒ |𝑎 – 𝑐| = |𝜆 + 𝑘| which is multiple of 4
⇒ (𝑎 , 𝑐) ∊ 𝑅
... R is transitive
... R is an Equivalence relation
The elements which related to 1 are 1, 5, 9
... required set is {1, 5, 9} ans.
Q.3) Let R be a relation on the set “A” of ordered pairs defined by (𝑥 , 𝑦) 𝑅(𝑢 , 𝑣) if and only if 𝑥𝑣 = 𝑦𝑢.
Show that R is an equivalence relation.
Sol.3) Given : A → set of ordered pairs
(𝑥 , 𝑦) 𝑅(𝑢 , 𝑣) ⇒ 𝑥𝑣 = 𝑦𝑢
Symmetric :
let (𝑥 , 𝑦) 𝑅 (𝑢 , 𝑣)
⇒ 𝑥𝑣 = 𝑦𝑢 (Rough work)
⇒ 𝑣𝑥 = 𝑢𝑦 ((𝑢 , 𝑣) 𝑅(𝑥 , 𝑦))
⇒ 𝑢𝑦 = 𝑣𝑥 ⇒ (4 , 𝑣) 𝑅(𝑥 , 𝑦) (𝑢𝑦 = 𝑣𝑥)
... R is Symmetric

Reflexive :
for each (x , y) ∊ A
⇒ 𝑥𝑦 = 𝑦𝑥 {Rough work}
⇒ (𝑥 , 𝑦) 𝑅(𝑥 , 𝑦) {(𝑥 , 𝑦) 𝑅(𝑥𝑦)}
... R is Reflexive {𝑥𝑦 = 𝑦𝑥}

Transitive :
let (𝑥 , 𝑦) 𝑅(𝑢 , 𝑣) and (𝑢 , 𝑣) 𝑅(𝑎 , 𝑏)
⇒ 𝑥𝑣 = 𝑦𝑢 and 𝑢𝑏 = 𝑣𝑎
𝑢𝑏
⇒ 𝑥𝑣 = 𝑦𝑢 and 𝑣 = 𝑎
… . . {𝑅𝑜𝑢𝑔ℎ (𝑥 , 𝑦) 𝑅(𝑎 , 𝑏) , 𝑥𝑏 = 𝑦𝑎}
𝑢𝑏
⇒ 𝑥 ( )= yu
𝑎
⇒ 𝑥𝑏 = 𝑦𝑎
⇒ (𝑥 , 𝑦) 𝑅(𝑎 , 𝑏)
... R is transitive
since R is Symmetric , Reflexive as well as transitive
... R is an Equivalence relation ans.
Q.4) If 𝑅1 and 𝑅2 are equivalence relations in set A , show that 𝑅1 ∩ 𝑅2 is also on equivalence relation.
Sol.4) Given :- 𝑅1 and 𝑅2 are equivalence relations
Symmetric :
 let (𝑎 , 𝑏) ∊ 𝑅1 ∩ 𝑅2
⇒ (𝑎 , 𝑏) ∊ 𝑅1 and (𝑎 , 𝑏) ∊ 𝑅2
⇒ (𝑏 , 𝑎) ∊ 𝑅1 and (𝑏 , 𝑎) ∊ 𝑅2 ….{... R and R are symmetric relations}
⇒ (𝑏 , 𝑎) ∊ 𝑅1 ∩ 𝑅2
... 𝑅1 ∩ 𝑅2 is Symmetric
Reflexive :
for each 𝑎 ∊ 𝐴
we have, (𝑎 , 𝑎) ∊ 𝑅1 and (𝑎 , 𝑎) ∊ 𝑅2 … … … … . { 𝑅1 𝑎𝑛𝑑 𝑅2 𝑎𝑟𝑒 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒}
⇒ (𝑎 , 𝑎) ∊ 𝑅1 ∩ 𝑅2
... 𝑅1 ∩ 𝑅2 is Reflexive
Transitive :
let (𝑎 , 𝑏) ∊ 𝑅1 ∩ 𝑅2 and (𝑏 , 𝑐)𝑅1 ∩ 𝑅2
⇒ (𝑎 , 𝑏) ∊ 𝑅1 𝑎𝑛𝑑 (𝑎 , 𝑏) ∊ 𝑅2 𝑎𝑛𝑑 (𝑏 , 𝑐) ∊ 𝑅1 & (𝑏 , 𝑐) ∊ 𝑅2
⇒ (𝑎 , 𝑏) ∊ 𝑅1 𝑎𝑛𝑑 (𝑏 , 𝑐) ∊ 𝑅1 | (𝑎 , 𝑏) 𝑅 𝑎𝑛𝑑 (𝑏 , 𝑐) ∊ 𝑅2
⇒ (𝑎 , 𝑐) ∊ 𝑅 | (𝑎 , 𝑐) ∊ 𝑅2
… . {𝑅1 & 𝑅2 𝑎𝑟𝑒 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒}
⇒ (𝑎 , 𝑐) ∊ 𝑅1 ∩ 𝑅2
... 𝑅1 ∩ 𝑅2 is transitive
since 𝑅1 ∩ 𝑅2 is Symmetric , Reflexive as well as transitive
... 𝑅1 ∩ 𝑅2 is an Equivalence relation ans.
Q.5) 𝑅 is a relation on set 𝑁 given by 𝑎𝑅𝑏 ↔ 𝑏 is divisible by 𝑎; 𝑎. 𝑏 ∊ 𝑁check whether R is Symmetric ,
reflexive and transitive.
Sol.5) We have,𝑎𝑅𝑏 ↔ 𝑏 is divisible by 𝑎
Symmetric :
6
2𝑅6 ⇒ 6 is divisible by 2 ….{ = 3}
2
2 1
but 6𝑅2 ⇒ 2is not div by 6 .....{ = }
6 2
... R is not symmetric
Reflexive : for each 𝑎 ∊ 𝑁
a is always divisible by a
⇒ 𝑎𝑅𝑎
.
. . R is Reflexive
Transitive :
let 𝑎𝑅𝑏 and 𝑏𝑅𝑐
⇒ b is divisible by a and c is div by b
⇒ 𝑏 = 𝑎𝜆 and 𝑐 = 𝑏𝑘 ….{𝜆, 𝑘𝜖𝑁}
⇒ 𝑐 = (𝑎𝜆)𝑘 ….{.. . 𝑏 = 𝑎𝜆}
𝑐
⇒ = 𝜆𝑘
𝑎
clearly c is div by a
⇒ 𝑎𝑅𝑐
... R is transitive ans.
Q.6) R be relation in P(x) , where x is a non-empty set , given by
ARB if only if ACB , where A & B are subsets in 𝑃(𝑥). Is R is an equivalence relation on 𝑃(𝑥) ? Justify
 your answer.
Sol.6) Let ARB
⇒ 𝐴⊂𝐵
then it is not necessary that B is a subset of A
i.e. 𝐵 ⊄ 𝐴
⇒ BRA
... R is not symmetric and hence R is not an equivalence relation
eg. 𝑥 = {1,2,3}
𝑃(𝑥) = {{1}{2}{3}{1 , 2}{2 , 3}{1 , 3}{1 , 2 , 3}}
clearly {2} ⊂ {1,2}
between{1,2} ⊂ {2}
... R is not symmetric ans.
Q.7) Show that the relation R defined in the set A of all triangles as R -{(T1 , T2) : T1 is similar to T2} is
equivalence relation.
Consider three right angle triangles T1 with sides 3, 4, 5, T2 with sides 5, 12, 13 and T3 with sides 6, 8,
10. Which triangles among T1 , T2 and T3 are related ?
Sol.7) A → set of are triangles
𝑅 = {(𝑇1 , 𝑇2 ) ∶ 𝑇1 ∼ 𝑇2 }
Symmetric :
let (𝑇1 , 𝑇2 ) ∊ 𝑅
⇒ 𝑇1 ∼ 𝑇2
⇒ 𝑇2 ∼ 𝑇1
⇒ (𝑇2 , 𝑇1 ) ∊ 𝑅
... R is symmetric

Reflexive : for each triangle 𝑇 ∊ 𝐴

(𝑇, 𝑇) ∊ 𝑅
since every triangle is similar to itself
... R is reflexive
Transitive :
let (𝑇1 , 𝑇2 ) ∊ 𝑅 and (𝑇2 ∼ 𝑇3 ) ∊ 𝑅
⇒ 𝑇1 ∼ 𝑇2 𝑎𝑛𝑑 𝑇2 ∼ 𝑇3
⇒ 𝑇1 ∼ 𝑇3
⇒ 𝑇1 , 𝑇3 ) ∊ 𝑅
... R is transitive
and hence R is an equivalence relation
𝑇1 ∶ 3 , 4 , 5
𝑇2 ∶ 5 , 12 , 13
𝑇3 ∶ 6 , 8 , 10
3 4 5
clearly sides of triangles T1 and T3 are in equal proportion i.e = =
6 8 10
... T1 ∼ T3
⇒ T1 and T3 are related to each other ans.
Q.8) Check whether the relation R in R (real no's) define by 𝑅 = (𝑎, 𝑏): 𝑎 ≤ 𝑏 3 is reflexive, symmetric or
transitive.
Sol.8) Symmetric :
(1,2) ∊ 𝑅
as1 ≤ 23
but (2,1) ∉ 𝑅
since2 ≰ 13
... R is not symmetric
1
Reflexive : ∈ 𝑅
2
1 1
but ( , ) ∉ 𝑅
2 2
1 1 3
as ≰ ( )
2 2
... R is not reflexive
Transitive :
(9,4) ∈ 𝑅and(4,2) ∈ 𝑅
as 9 ≤ 43 and 4 ≤ 23
but(9,2) ∉ 𝑅
since 9 ≰ 23
... R is not transitive ans.
Q.9) 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
neither symmetric nor transitive.
Sol.9) We have,
𝐴 = {1,2,3}
𝑅 = {(1,1), (2,2), (3,3), (1,2), (2,3)}
since (1,2) ∊ 𝑅
but (2,1) ∉ 𝑅
... R is not Symmetric
(1,2) ∈ 𝑅and(2,3) ∈ 𝑅
but (1,3) ∉ 𝑅
... R is not transitive
for each 𝑎 ∊ 𝐴
(𝑎 , 𝑎) ∊ 𝑅 i.e. (1,1), (2,2), (3,3) ∊ 𝑅
... R is reflexive ans.
Q.10) Determine whether each of the following relations are reflexive, symmetric and transitive
(i) Relation in set A = {1,2,3,.......... 13,14} defined by 𝑅 = (𝑥, 𝑦): 3x– 𝑦 = 0.
(ii) Relation in N defined as 𝑅 = (𝑥, 𝑦): 𝑦 = 𝑥 + 5; 𝑥 < 4.
(iii) Relation in set A = {1,2,3,4,5,6} defined as 𝑅 = (𝑥, 𝑦): 𝑦is divisible by 𝑥 .
(iv) Relation in Z defined as 𝑅 = (𝑥, 𝑦): 𝑥– 𝑦is an integer.
(v) Relation in R (real nos) defined as 𝑅 = (𝑎, 𝑏): 𝑎 ≤ 𝑏 2 .
Sol.10) (i) 𝑅 = {(1,3), (2,6), (3,9), (4,12)} …...(𝑦 = 3x)
clearly (1,3) ∈ 𝑅 but(3,1) ∉ 𝑅
... not symmetric
1 ∈ 𝐴 but (1,1) ∉ 𝑅
... not reflexive
 (1,3) ∈ 𝑅and (3,9) ∈ 𝑅but(1,9) ∉ 𝑅
.
. . not transitive

(ii) 𝑅 = {(1,6), (2,7), (3,8)} … . . {. . . 𝑦 = 𝑥 + 5 𝑎𝑛𝑑 𝑥 < 4}

Do yourself

(iii) 𝑅 = {(1,1), (1,2), (1,3), (1,4), (1,5), (1,6), (2,2), (2,4), (2,6), (3,3), (3,6), (4,4), (5,5), (6,6)}. . . {. . . 𝑦 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 𝑥}

clearly for each 𝑎 ∊ 𝐴

(𝑎 , 𝑎) ∊ 𝑅 i.e. (1,1), (2,2), (3,3), (4,4), (5,5), (6,6) ∊ 𝑅
... R is reflexive
(1 , 2) ∊ 𝑅
but(2,1) ∉ 𝑅
since 1 in not divisible by 2
... R is not transitive
for each (𝑎 , 𝑏) and (𝑏 , 𝑐) ∊ 𝑅
clearly (𝑎 , 𝑐) ∊ 𝑅
... R is transitive

(iv) Symmetric let (𝑥, 𝑦) ∊ 𝑅

⇒ 𝑥 – 𝑦 = 𝜆 ….. where 𝜆→ integer
⇒ 𝑦 – 𝑥 = −𝜆 which is also an integer
⇒ (𝑦 , 𝑥) ∊ 𝑅
... R is Symmetric
Reflexive and transitive (Do yourself)

(v) give same examples as in case of 𝑎 ≤ 𝑏 3

It is neither symmetric, nor reflexive, nor transitive.