RELATIONS

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 is reflexive ⇔ (𝒂, 𝒂) ∈ 𝑹, for all 𝒂 ∈ 𝑨.
NOTE: A relation R on a set A is not reflexive if there exists an element 𝒂 ∈ 𝑨 such that(𝒂, 𝒂) ∉ 𝑹.
Symmetric relation:
A relation R on a set A is said to be Symmetric iff (𝒂, 𝒃) ∈ 𝑹 ⇒ (𝒃, 𝒂) ∈ 𝑹, for all 𝒂, 𝒃 ∈ 𝑨.
Transitive relation:
A relation R on a set A is said to be transitive iff (𝒂, 𝒃) ∈ 𝑹 𝒂𝒏𝒅 (𝒃, 𝒄) ∈ 𝑹 ⇒ (𝒂, 𝒄) ∈ 𝑹, for all 𝒂, 𝒃, 𝒄 ∈ 𝑨.
Equivalence relation:
Let A be a non-empty set, then a relation R on set A is said to be an equivalence relation if it is
 Reflexive i.e., (𝒂, 𝒂) ∈ 𝑹, for all 𝒂 ∈ 𝑨
 Symmetric i.e., (𝒂, 𝒃) ∈ 𝑹 ⇒ (𝒃, 𝒂) ∈ 𝑹, for all 𝒂, 𝒃 ∈ 𝑨
 Transitive i.e., (𝒂, 𝒃) ∈ 𝑹 𝒂𝒏𝒅 (𝒃, 𝒄) ⇒ (𝒂, 𝒄) ∈ 𝑹, for all 𝒂, 𝒃, 𝒄 ∈ 𝑨

Equivalence class:
Let R be an equivalence relation on a non-empty set A. for all 𝒂 ∈ 𝑨, the Equivalence class of ‘𝒂’ is defined
as the set of all such elements of A which are related to ‘𝒂’ under R. It is denoted by [𝒂].
Thus, [𝒂] = {𝒙 ∈ 𝑨: (𝒙, 𝒂) ∈ 𝑹}.

IMPORTENT FORMULAE:
2
 Number of Reflexive Relations on a set with 𝒏 elements: 2𝑛(𝑛−1) (𝑜𝑟) 2𝑛 −𝑛 .
𝑛(𝑛+1) 𝑛2 +𝑛
 Number of Symmetric Relations on a set with 𝒏 elements: 2 2 (𝑜𝑟) 2 2

𝑛(𝑛−1) 𝑛2 −𝑛
 Reflexive and symmetric Relations on a set with 𝒏 elements: 2 2 (𝑜𝑟) 2 2

FUNCTIONS
ONE-ONE FUNCTION (INJECTION):
A function 𝒇: 𝑨 → 𝑩 is called a one-one function or an invective function, if distinct elements of A
have distinct images in B.
Thus, 𝒇: 𝑨 → 𝑩 is one-one ⇔ 𝒂 ≠ 𝒃 ⇒ 𝒇(𝒂) ≠ 𝒇(𝒃), for all 𝒂, 𝒃 ∈ 𝑨.
𝒇: 𝑨 → 𝑩 is one-one ⇔ 𝒇(𝒂) = 𝒇(𝒃) ⇒ 𝒂 = 𝒃, for all 𝒂, 𝒃 ∈ 𝑨.
(or) I.e., for every 𝒙𝟏 , 𝒙𝟐 ∈ 𝑨 if 𝒙𝟏 ≠ 𝒙𝟐 , then 𝒇(𝒙𝟏 ) ≠ 𝒇(𝒙𝟐 ) and if 𝒇(𝒙𝟏 ) = 𝒇(𝒙𝟐 ), then 𝒙𝟏 = 𝒙𝟐 .
METHOD TO CHECK WHETHER A FUNCTION IS ONE-ONE OR MANY-ONE:
Sometimes, a function is given to us and we have to check whether this function is one-one or many-one.
For this, we use the following steps.
STEP 1: Take any two arbitrary elements 𝒙, 𝒚 (say) in the domain of 𝒇.
STEP 2: Put 𝒇(𝒙) = 𝒇(𝒚) and simplify the equation.
STEP 3: If we get 𝒙 = 𝒚, then 𝒇: 𝑨 → 𝑩 is a one-one function (or an injection) and if we get 𝒙 ≠ 𝒚, then 𝒇
is many-one.

ONTO FUNCTION (SURJECTION):

A function 𝒇 ∶ 𝑨 → 𝑩 is said to be an onto function or a surjection if every element of B is the 𝒇-image of
some elements of A under 𝒇.
i.e., if 𝒇(𝑨) = 𝑩 or range of 𝒇 is the co-domain of 𝒇.
Thus, 𝒇: 𝑨 → 𝑩 is a surjection iff for each 𝒃 ∈ 𝑩, there exists 𝒂 ∈ 𝑨 such that 𝒇(𝒂) = 𝒃.
I.e., 𝒇 ∶ 𝑨 → 𝑩 is a surjection (onto) ⇔ 𝒇(𝑨) = 𝑩
I.e., range of 𝒇 = co-domain of 𝒇.
METHOD TO CHECK WHETHER A FUNCTION IS ONTO OR INTO:
Sometimes, a function is given to us and we have to check whether this function is onto or into. For this, we
use the following steps.
STEP 1: Choose an arbitrary element y in B.
STEP 2: Put 𝒇(𝒙) = 𝒚
STEP 3: Solve the equation 𝒇(𝒙) = 𝒚 for 𝒙 in terms of 𝒚. let 𝒙 = 𝒈(𝒚).
STEP 4: If for all values of 𝒚 ∈ 𝑩, the values of 𝒙 obtained from 𝒙 = 𝒈(𝒚) are in A, then 𝒇 is onto.
If there are some 𝒚 ∈ 𝑩 for which 𝒙, given by 𝒙 = 𝒈(𝒚), is not in A. then, 𝒇 is not onto.
NOTE: Sometimes, we simply find the range of function. If range of function = co-domain of function, then
the function is onto, otherwise it is an into function.
NOTE: If 𝒇: 𝑨 → 𝑩 is a function such that,
 𝒇 is one-one ⇒ 𝒏(𝑨) ≤ 𝒏(𝑩)
 𝒇 is onto ⇒ 𝒏(𝑩) ≤ 𝒏(𝑨)
 𝒇 is one-one onto ⇒ 𝒏(𝑨) = 𝒏(𝑩).
NOTE: If A and B are two non-empty finite sets containing 𝒎 and 𝒏 elements respectively, then
 Number of functions from A to B = 𝒏𝒎
𝒏𝑪𝒎 × 𝒎! , 𝒊𝒇 𝒎 ≤ 𝒏
 Number of one-one functions from A to B = {
𝟎 , 𝒊𝒇 𝒎 > 𝑛
 Number of many-one functions = No. of functions – No. of one-one functions
∑𝒏𝒓=𝟏(−𝟏)𝒏−𝒓 𝒏𝑪𝒓 𝒓𝒎 , 𝒊𝒇 𝒎 ≥ 𝒏
 Number of onto functions from A to B = { 𝟐𝒎 − 𝟐, 𝒊𝒇 𝒏(𝑩) = 𝟐
𝟎 , 𝒊𝒇 𝒎 < 𝑛
 Number of into functions = No. of functions – No. of onto functions
𝒎! , 𝒊𝒇 𝒏 = 𝒎
 Number of one-one onto functions from A to B = {
𝟎 , 𝒊𝒇 𝒎 ≠ 𝒏
 Number of constant functions = 𝒏(𝑩)
 MULTIPLE CHOICE QUESTIONS) MCQ
MODEL - 1
1. If a relation R on the set {1, 2, 3} be defined by 𝑅 = {(1, 2)}, then R is
(A) reflexive (B) transitive (C) symmetric (D) None of these
2. If 𝐴 = {1, 2,3} and consider the relation 𝑅 = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)} Then, R is
(A) reflexive but not symmetric (B) reflexive but not transitive
(C) symmetric and transitive (D) neither symmetric nor transitive
3. A relation R in set 𝐴 = {1,2,3} is defined as 𝑅 = {(1,1), (1, 2), (2, 2), (3,3)}. Which of the following
ordered pair in R shall be removed to make it an equivalence relation?
(A) (1,1) (B) (1,2) (C) (2,2) (D) (3,3)
4. A relation R in a set A is called _________, if (𝑎1 , 𝑎2 ) ∈ 𝑅 implies (𝑎2 , 𝑎1 ) ∈ 𝑅, for all 𝑎1 , 𝑎2 ∈ 𝐴.
(A) Reflexive (B) Symmetric (C) Transitive (D) None of these
5. The relation R in the set {1, 2, 3} given by 𝑅 = {(1, 2), (2, 1), (1,1)} is
(A) Symmetric and transitive but not reflexive.
(B) Reflexive and symmetric but not transitive.
(C) Symmetric, but neither reflexive nor transitive.
(D) An equivalence elation.
6. A relation in set A is called ________ relation, if each element of A is related to itself.
(A) Reflexive (B) Symmetric (C) Transitive (D) Identity
7. Let R be the relation in the set N given by 𝑅 = {(𝑎, 𝑏): 𝑎 = 𝑏 − 2, 𝑏 > 6}. Choose the correct answer.
(A) (2, 4) ∈ 𝑅 (B) (3, 8) ∈ 𝑅 (C) (6, 8) ∈ 𝑅 (D) (8, 7) ∈ 𝑅
8. Let R be the relation in the set {1, 2, 3, 4} given by
𝑅 = {(1, 2), (2, 2), (1, 1), (4,4), (1, 3), (3, 3), (3, 2)}. Choose the correct answer.
(A) R is reflexive and symmetric but not transitive
(B) R is reflexive and transitive but not symmetric.
(C) R is symmetric and transitive but not reflexive
(D) R is an equivalence relation.
9. Consider the non-empty set consisting of children in a family and a relation R defined as 𝑎𝑅𝑏, if 𝑎 is
brother of 𝑏. Then, R is
(A) symmetric but not transitive (B) transitive but not symmetric
(C) neither symmetric nor transitive (D) both symmetric and transitive
10.Let 𝐴 = {0, 1, 2, 3} and define a relation R on A as follows:
𝑅 = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}. Then, R is
(A) R is reflexive and symmetric but not transitive
(B) R is reflexive and transitive but not symmetric.
 (C) R is symmetric and transitive but not reflexive
(D) R is an equivalence relation.
11.For the set 𝐴 = {1, 2, 3}, define a relation R in the set A as follows: 𝑅 = {(1, 1), (2, 2), (3, 3), (1, 3)}.
Write the ordered pairs to be added to R to make it the smallest equivalence relation.
(A) (1, 1) (B) (2, 2) (C) (3, 1) (D) (3, 3) ∈ 𝑅
12.Consider the set 𝐴 = {1, 2, 3} and the relation 𝑅 = {(1, 2), (1, 3)}. Then, R is
(A) Reflexive (B) Symmetric (C) Transitive (D) None of these

13.Let 𝑅 = {(3, 1), (1, 3), (3, 3)} be a relation defined on the set 𝐴 = {1, 2, 3}. Then, R is
(A) R is reflexive and symmetric but not transitive
(B) R is reflexive and transitive but not symmetric.
(C) R is symmetric and transitive but not reflexive
(D) R is an equivalence relation.
14.The relation 𝑅 on the set 𝐴 = {1, 2, 3} defined as 𝑅 = {(1, 1), (1, 2), (2, 1), (3, 3)} is reflexive, symmetric
and transitive.
(A) R is reflexive and symmetric but not transitive
(B) R is reflexive and transitive but not symmetric.
(C) R is symmetric and transitive but not reflexive
(D) R is an equivalence relation.

MODEL - 2
2𝑥: 𝑥 > 3
2
15.If 𝑓: 𝑅 → 𝑅 be defined by 𝑓(𝑥) = {𝑥 : 1 < 𝑥 ≤ 3, Then, 𝑓(−1) + 𝑓(2) + 𝑓(4) is
3𝑥 ∶ 𝑥 ≤ 1
(A) 9 (B) 14 (C) 5 (D) None of these
16.Let 𝐴 = {1, 2, 3}, 𝐵 = {4, 5, 6, 7} and let 𝑓 = {(1, 4), (2, 5), (3, 6)} be a function from A to B. Based on
the given information, 𝑓 is best defined as:
(A) Surjective function (B) Injective function (C) Bijective function (D) Function
17.Let 𝑓 ∶ 𝑅 → 𝑅 be defined as 𝑓(𝑥) = 𝑥 4 . Choose the correct answer.
(A) 𝑓 is one-one onto (B) 𝑓 is many-one onto
(C) 𝑓 is one-one but not onto (D) 𝑓 is neither one-one nor onto
18.Let 𝑓 ∶ 𝑅 → 𝑅 be defined as 𝑓(𝑥) = 3𝑥. Choose the correct answer.
(A) 𝑓 is one-one onto (B) 𝑓 is many-one onto
(C) 𝑓 is one-one but not onto (D) 𝑓 is neither one-one nor onto
19.Let N be the set of natural numbers and the function 𝑓: 𝑁 → 𝑁 be defined by 𝑓(𝑛) = 2𝑛 + 3 ∀ 𝑛 ∈ 𝑁.
Then 𝑓 is
(A) surjective (B) injective (C) bijective (D) none of these
1
20.If 𝑓: 𝑅 → 𝑅 be defined by 𝑓(𝑥) = 𝑥, ∀𝑥 ∈ 𝑅. Then, 𝑓 is
 (A) one-one (B) onto (C) bijective (D) 𝑓 is not defined
21.The function 𝑓: 𝑅 → 𝑅 given by 𝑓(𝑥) = 𝑥 3 is
(A) One-one but not onto (B) Not one-one but onto
(C) Neither one-one nor onto (D) One-one and onto

ANSWER KEY
1 B 2 A 3 B 4 C 5 A
6 D 7 C 8 B 9 B 10 A
11 C 12 C 13 A 14 A 15 A
16 B 17 D 18 A 19 B 20 D
21 D

2 OR 3 MARKS
MODEL - 1
1. Show that the relation R in the set {1, 2, 3} given by 𝑅 = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)} is reflexive
but neither symmetric nor transitive.
2. Show that the relation R in the set {1, 2, 3} given by 𝑅 = {(1, 2), (2, 1)} is symmetric but neither reflexive
nor transitive.
(OR) State the reason for the relation R in the set {1, 2, 3} given by 𝑅 = {(1, 2), (2, 1)} not to be transitive.

3. Show that the relation R in the set of real numbers, defined as 𝑅 = {(𝑎, 𝑏) ∶ 𝑎 ≤ 𝑏 2 } is neither reflexive,
nor symmetric, nor transitive.
(OR) Prove that the relation R in the set of all real numbers, defined as 𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏 2 } is neither
reflexive nor transitive.
(OR) State the reason why the relation 𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏 2 } on the set R of real numbers is not reflexive.
4. Show that the relation R on R defined as 𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏}, is reflexive, and transitive but not symmetric.
5. Check whether the relation R in R defined by 𝑅 = {(𝑎, 𝑏) ∶ 𝑎 ≤ 𝑏 3 } is reflexive, symmetric or transitive.
(OR) Show that the relation S in the set R of real numbers, defined as
𝑆 = {(𝑎, 𝑏) ∶ 𝑎, 𝑏 ∈ 𝑅 𝑎𝑛𝑑 𝑎 ≤ 𝑏 3 } is neither reflexive, nor symmetric nor transitive.
(OR) Show by examples that the relation 𝑅 in, defined by 𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏 3 } is neither reflexive nor
transitive.

MODEL - 2
6. Show that the function 𝑓 ∶ 𝑁 → 𝑁, given by 𝑓(𝑥) = 2𝑥, is one-one but not onto.
7. Show that the function 𝑓 ∶ 𝑅 → 𝑅, defined as 𝑓(𝑥) = 𝑥 2 , is neither one-one nor onto.
8. Prove that the Greatest Integer Function 𝑓 ∶ 𝑅 → 𝑅, given by 𝑓 (𝑥) = [𝑥], is neither one-one nor onto,
where [𝑥] denotes the greatest integer less than or equal to 𝑥.
9. Show that the Modulus Function 𝑓: 𝑅 → 𝑅, given by 𝑓(𝑥) = |𝑥|, is neither one-one nor onto, where |𝑥|
is x, if x is positive or 0 and |𝑥| is −𝑥, if x is negative.
1, 𝑖𝑓 𝑥 > 0
10. Show that the Signum Function 𝑓 ∶ 𝑅 → 𝑅, given by 𝑓(𝑥) = { 0, 𝑖𝑓 𝑥 = 0 is neither one-one nor
−1, 𝑖𝑓 𝑥 < 0
onto.
|𝑥|
, 𝑖𝑓 𝑥 ≠ 0
(OR) Show that the Signum Function 𝑓 ∶ 𝑅 → 𝑅, given by 𝑓(𝑥) = { 𝑥 is neither one-one nor
0, 𝑖𝑓 𝑥 = 0
onto.

5 MARKS
MODEL - 1
1. Show that the relation R in the set Z of integers given by 𝑅 = {(𝑎, 𝑏) ∶ 2 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 (𝑎 − 𝑏)} is an
equivalence relation.
2. Let 𝑍 be the set of all integers and 𝑅 be the relation on 𝑍 defined as 𝑅 = {(𝑎, 𝑏); 𝑎, 𝑏 ∈
𝑍, 𝑎𝑛𝑑 (𝑎 − 𝑏) 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 5} Prove that 𝑅 is an equivalence relation.
3. Show that the relation R in the set 𝐴 = {1, 2, 3, 4,5,6} given by 𝑅 = {(𝑎, 𝑏): 𝑎, 𝑏 ∈ 𝐴, |𝑎 −
𝑏| 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 2} is an equivalence relation.
4. Prove that the relation 𝑅 in the set 𝐴 = {1, 2, 3, 4, 5, 6, 7} given by 𝑅 = {(𝑎, 𝑏): |𝑎 − 𝑏| 𝑖𝑠 𝑒𝑣𝑒𝑛} is an
equivalence relation.
5. Show that the relation S in the set 𝐴 = {𝑥 ∈ 𝑍: 0 ≤ 𝑥 ≤ 12} given by
𝑆 = {(𝑎, 𝑏) ∶ 𝑎, 𝑏 ∈ 𝑍, |𝑎 − 𝑏| 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 3} is an equivalence relation.
6. Show that the relation 𝑅 on the set 𝑍 of all integers defined by
(𝑥, 𝑦) ∈ 𝑅 ⇔ (𝑥 – 𝑦) 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 3 is an equivalence relation.
7. Prove that the relation 𝑅 in the set 𝐴 = {1, 2, 3, 4, 5, 6, 7} given by 𝑅 = {(𝑎, 𝑏): |𝑎 − 𝑏| 𝑖𝑠 𝑒𝑣𝑒𝑛} is an
equivalence relation.

MODEL - 2
𝑥−2
8. Let 𝐴 = 𝑅 – {3} and 𝐵 = 𝑅 – {1}. Consider the function 𝑓 ∶ 𝐴 → 𝐵 defined by 𝑓 (𝑥) = 𝑥−3. Is f one-

one and onto? Justify your answer.

𝑥− 2
(OR) Let 𝐴 = 𝑅 − {3}, 𝐵 = 𝑅 − {1}. If 𝑓: 𝐴 → 𝐵 be defined by 𝑓(𝑥) = 𝑥−3
, ∀𝑥 ∈ 𝐴. Then, show that 𝑓

is bijective.
2 2 2𝑥−1
9. Let 𝐴 = 𝑅 − {3} and 𝐵 = 𝑅 − {3}. If 𝑓: 𝐴 → 𝐵 defined by 𝑓(𝑥) = 3𝑥−2, then prove that function 𝑓 is one-

one and onto.

 ASSERSSION AND REASON TYPE QUESTIONS
MODEL – 1
Both 𝐴 and 𝑅 are true and 𝑅 is the correct explanation of 𝐴
Both 𝐴 and 𝑅 are true but 𝑅 is NOT the correct explanation of 𝐴.
𝐴 is true but 𝑅 is false
A is false but 𝑅 is true
Both 𝐴 and 𝑅 are false
1. Assertion (A): If 𝑛(𝐴) = 𝑝 and 𝑛(𝐵) = 𝑞 then the number of relations from 𝐴 to 𝐵 is 2𝑝𝑞 .
Reason(R): A relation from 𝐴 to 𝐵 is a subset of 𝐴 × 𝐵.
2. Assertion (A): If 𝑛(𝐴) = 𝑚, then the number of reflexive relations on 𝐴 is 𝑚.
Reason(R): A relation 𝑅 on the set 𝐴 is reflexive if (𝑎, 𝑎) ∈ 𝑅, ∀𝑎 ∈ 𝐴.
3. Assertion (A): Domain and Range of a relation 𝑅 = {(𝑥, 𝑦): 𝑥 − 2𝑦 = 0} defined on the set 𝐴 = {1,2,3,4}
are respectively {1,2,3,4} and {2,4,6,8}.
Reason (R): Domain and 𝑅 ange of a relation 𝑅 are respectively the sets {𝑎: 𝑎 ∈ 𝐴 and (𝑎, 𝑏) ∈ 𝑅} and
{𝑏: 𝑏 ∈ 𝐴 and (𝑎, 𝑏) ∈ 𝑅}.
4. Assertion (A): A relation 𝑅 = {(1,1), (1,2), (2,2), (2,3)(3,3)} defined on the set 𝐴 = {1,2,3} is reflexive.
Reason (R): A relation 𝑅 on the set 𝐴 is reflexive if (𝑎, 𝑎) ∈ 𝑅, ∀𝑎 ∈ 𝐴.
5. Assertion (A): A relation R = {(1,1), (1,2), (2,2), (2,3)(3,3)} defined on the set 𝐴 = {1,2,3} is
symmetric.
Reason (R): A relation R on the set A is symmetric if (a, b) ∈ 𝑅 ⇒ (𝑏, 𝑎) ∈ 𝑅.

MODEL - 2
6. Assertion (A) The function f: R → R, f(x) = |𝒙| is not one-one
Reason(R) The function 𝑓(𝑥) = |𝑥| is not onto.
7. Assertion (A) 𝐴 = {1,2,3}, 𝐵 = {4,5,6,7}, 𝑓 = {(1,4), (2,5), (3,6)} is a function from 𝐴 to B. Then 𝑓 is
one-one
Reason(R) A function 𝑓 is one -one if distinct elements of 𝐴 have distinct images in B.
𝑥
8. Assertion (A) Consider the function f: R ⋯ R defined by f(𝑥) = 𝑥 2 +1. Then f is one - one

Reason(R) 𝑓(4) = 4/17 and 𝑓(1/4) = 4/17

9. Assertion (A) Consider the function 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 𝑥 3 . Then 𝑓 is oneone
Reason(R) Every polynomial function is one-one
 10. Assertion (A) 𝑛(𝐴) = 5, 𝑛(𝐵) = 5 and 𝑓: 𝐴 → 𝐵 is one-one then 𝑓 is bijection
Reason(R) If 𝑛(𝐴) = 𝑛(𝐵) then every one-one function from 𝐴 to 𝐵 is onto

ANSWER KEY
1 A 2 D 3 D 4 A 5 D
6 B 7 A 8 D 9 C 10 A

CASE STUDY QUESTIONS

CASE STUDY – 1:
Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin's sister Raji
observed and noted that possible outcomes of the throw every time belongs to set {1, 2,3,4,5,6}. Let 𝐴 be the set
of players while 𝐵 be the set of all possible outcomes.
𝐴 = {𝑆, 𝐷}, 𝐵 = {1,2,3,4,5,6}

(i) Let 𝑅: 𝐵 → 𝐵 be defined by 𝑅 = {(𝑥, 𝑦): 𝑦 is divisible by 𝑥}. Show that relation 𝑅 is reflexive and transitive
but not symmetric.
(ii) Let 𝑅 be a relation on 𝐵 defined by 𝑅 = {(1,2), (2,2), (1,3), (3,4), (3,1), (4,3), (5,5)}. Then check whether
𝑅 is an equivalence relation.
(iii) Raji wants to know the number of functions from 𝐴 to 𝐵. How many number of functions are possible?
(OR)
(iii) Raji wants to know the number of relations possible from 𝐴 to 𝐵. How many numbers of relations are
possible?
Ans:
(i) Since every number is divisible by itself, So (1,1), (2,2), (3,3), (4,4), (5,5), (6,6) ∈ 𝑅.
So, 𝑅 is reflexive relation on 𝐵. Also (1,2) ∈ 𝑅 but (2,1) does not belong here non-symmetric.
(ii) 𝑅 = {(1,2), (2,2), (1,3), (3,4), (3,1), (4,3), (5,5),
Since (1,1) ∈ 𝑅, so 𝑅 is not reflexive.
Hence ' 𝑅 ' is not an equivalence relation.
(iii) As number of functions possible from set 𝐴 to set 𝐵, if set 𝐴 contains 𝑚 elements and set 𝐵 contains 𝑛
elements is given by 𝑛𝑚 .
 Now, 𝑛(𝐴) = 2; 𝑛(𝐵) = 6
Number of possible functions = 62
(OR)
As, number of relations from a set with ' 𝑚 ' elements to a set with 𝑛 elements is 2𝑚𝑛 .
Now 𝑛(𝐴) = 2; 𝑛(𝐵) = 6
Required number of relations = 212
CASE STUDY – 2:
The 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. A relation ' 𝑅 ' is defined on I as follows:
R = {(V1 , V2 ): V1 , V2 ∈ I and both use their voting right in general election - 2019}
(i) Two neighbours 𝑋 and 𝑌 ∈ 𝐼. 𝑋 exercised his voting right while 𝑌 did not cast her vote in general election-
2019. Check whether 𝑋 is related to 𝑌 or not.
(ii) Mr. ' 𝑋 ' and his wife ' 𝑊 ' both exercised their voting right in general election-2019. Show that (𝑋, 𝑊) ∈ 𝑅
and (𝑊, 𝑋) ∈ 𝑅.
(iii) Three friends 𝐹1 , 𝐹2 and 𝐹3 exercised their voting right in general election-2019. Show that (𝐹1 , 𝐹2 ) ∈
𝑅, (𝐹2 , 𝐹3 ) ∈ 𝑅 and (𝐹1 , 𝐹3 ) ∈ 𝑅.
OR
Show that the relation 𝑅 defined on set 𝐼 is an equivalence relation.
Ans:
(i) R = {(𝑉1 , 𝑉2 ): 𝑉1 , 𝑉2 ∈ 𝐼 and both use their voting rights } It is given that 𝑋 exercised his voting right and 𝑌
didn't cast her vote.
So, 𝑋 is not related to 𝑌, i.e. (𝑋, 𝑌) ∈ 𝑅.
(ii) 𝑅 = {(𝑉1 , 𝑉2 ): 𝑉1 , 𝑉2 ∈ 𝐼 and both use their voting rights }
It is given that Mr𝑋 and his wife 𝑊 both exercised their voting rights in election.
So, 𝑋 is related to 𝑊 and 𝑊 is related to 𝑋, i.e.
(𝑋, 𝑊) ∈ 𝑅 and (𝑊, 𝑋) ∈ 𝑅
(iii) Since all the three friends 𝐹1 , 𝐹2 and 𝐹3 exercised their voting rights in election, so (𝐹1 , 𝐹2 ) ∈ 𝑅,
(𝐹2 , 𝐹3 ) ∈ 𝑅 and (𝐹1 , 𝐹3 ) ∈ R.
 (OR)
Let 𝑉 be any person in 𝐼. Then 𝑉 and 𝑉 use their voting rights in election
p (𝑉, 𝑉) ∈ 𝑅
Thus (𝑉, 𝑉) ∈ 𝑅 for all 𝑉 ∈ 𝐼.
So, 𝑅 is reflexive relation on 𝐼.
Let 𝑉1 and 𝑉2 be two persons in 𝐴 such that (𝑉1 , 𝑉2 ) ∈ 𝑅.
Then, (𝑉1 , 𝑉2 ) ∈ 𝑅 ⇒ 𝑉1 and 𝑉2 both use their voting rights
⇒ 𝑉2 and 𝑉1 both use their voting rights.
⇒ (𝑉2 , 𝑉1 ) ∈ 𝑅
𝑅 is symmetric on 𝐼.
Let 𝑉1 , 𝑉2 , 𝑉3 be three person in 𝐼 such that (𝑉1 , 𝑉2 ) ∈ 𝑅 and (𝑉2 , 𝑉3 ) ∈ 𝑅.
Then (𝑉1 , 𝑉2 ) ∈ 𝑅 ⇒ 𝑉1 and 𝑉2 both use their voting rights. and (𝑉2 , 𝑉3 ) ∈ 𝑅 ⇒ 𝑉2 and 𝑉3 both use their voting
rights.
So, 𝑉1 and 𝑉3 both use their voting rights.
⇒ (𝑉1 , 𝑉3 ) ∈ 𝑅
So, 𝑅 is transitive on 𝐼.
Hence, 𝑅 is an equivalence relation.