Welcome to

Relations and Functions

Class – XII
 Lecture Outline

1.1 Introduction to Relations ( Recall from Class 11)

1.2 Types of Relations

1.3 Miscellaneous questions

 1.1 Introduction to Relations
(Recall from Grade 11)

1. Let 𝐴 and 𝐵 be two sets. Then, the subset of 𝐴 × 𝐵 is called relation from the set 𝐴 to
the set 𝐵.
 1.1 Introduction to Relations
1. Domain of a relation: The set of first components of the ordered pairs belonging
to 𝑅 is called the domain of 𝑅

2. Range of a relation: The set of second components of the ordered pairs

belonging to 𝑅 is called the range of 𝑅.
 1.1 Introduction to Relations

The Relation R =

Domain of R =

Range of R =
Number of Relations
 1.1 Introduction to Relations
Inverse of a relation: A relation from 𝐵 to 𝐴 obtained by interchanging the
components of ordered pairs of a relation 𝑅 from 𝐴 to 𝐵 is called the inverse of
relation 𝑅 and it is denoted by 𝑅−1 .

Question: Find the inverse of a relation R represented by

{(-15, -4), (-18, -8), (-6, 2), (-12.55, 3)} and write the domain and range of the
inverse relation.
 Question

Let 𝐴 = {1,2,3, … 20}. Let 𝑅1 and 𝑅2 two relation on 𝐴 such that

𝑅1 = {(𝑎, 𝑏): 𝑏 is divisible by 𝑎}, 𝑅2 = {(𝑎, 𝑏): 𝑎 is an integral multiple of 𝑏}. Then, the
difference of number of elements in 𝑅1 − 𝑅2 is equal to

Ans: (46)
 Types of Relations

1. Void or Empty relation

2. Universal relation
3. Identity relation
 Void Relation

Void or Empty relation: Let 𝐴 be any non-empty set. We know that 𝜙 ⊆ 𝐴 × 𝐴, and so,
it is a relation on the set 𝐴. This relation is called void or empty relation.

Example: If A is the set of students of grade 12 of a boy's school, then the relation R =
{ (a, b) | a and b are sisters } is an empty relation.
 Universal Relation
Universal relation: Let 𝐴 be any non-empty set. We know that 𝐴 × 𝐴 ⊆ 𝐴 × 𝐴, and so it
is a relation on the set 𝐴. This relation is called universal relation.

Example: If A = {1, 2, 3} then R = { (1, 1),(1,2),(1,3),(2, 2),(2,1),(2,3),(3,1),(3,2)(3, 3) }

is the universal relationship.
 Identity Relation

Identity relation: Let 𝐴 be any non-empty set. A relation 𝐼𝐴 = {(𝑎, 𝑎); 𝑎 ∈ 𝐴} defined on
the set 𝐴 is called identity relation.

Example: If A = {1, 2, 3} then R = { (1, 1) (2, 2) (3, 3) } is the identity relationship.

 1.2 Types of Relations

1. Reflexive Relation
2. Symmetric Relation
3. Transitive Relation
4. Equivalence Relation
5. Anti symmetric Relation
6. Partial order Relation.
Reflexive Relation
 Reflexive Relation
Reflexive Relations
A relation 𝑅 on the set 𝐴 is said to be reflexive, if every element of 𝐴 is related to itself,
Thus, 𝑅 is reflexive on the set 𝐴 ⇔ (𝑎, 𝑎) ∈ 𝑅 for all 𝑎 ∈ 𝐴.
Example: Let A = {1, 2, 3}
𝑅1 = { (1, 1), (2, 2), (3, 3), (1, 2), (2, 3)}
𝑅2 = { (1, 1), (2, 2), (3, 3), (1, 2),(2,1) (2, 3),(3,2)}
𝑅3 = { (1, 1), (2, 2), (3, 3), (1, 2), (2,1)}
𝑅4 = {(1, 2), (2,1)}
𝑅5 = { (1, 1), (2, 2), (3, 3), (1, 2), (2, 3),(1,3),(2,1),(3,1),(3,2)}
𝑅6 = { }
Symmetric Relation
 Symmetric Relation
Symmetric Relations
A relation 𝑅 on the set 𝐴 is said to be symmetric, if (𝑎,𝑏)∈𝑅 implies (𝑏,𝑎)∈𝑅, for all 𝑎,𝑏∈𝐴.
Example: Let A = {1, 2, 3}
𝑅1 = { (1, 1), (2, 2), (3, 3), (1, 2), (2, 3)}
𝑅2 = { (1, 1), (2, 2), (3, 3), (1, 2),(2,1) (2, 3),(3,2)}
𝑅3 = {(1, 2), (2,1)}
𝑅4 = { (1, 1), (2, 2), (3, 3), (1, 2), (2, 3),(1,3),(2,1),(3,1),(3,2)}
𝑅5 = { }
Transitive Relation
 Transitive Relation
Transitive Relation
A relation 𝑅 on the set 𝐴 is said to be transitive, if (𝑎, 𝑏), and (𝑏, 𝑐) ∈ 𝑅 ⇒ (𝑎, 𝑐) ∈ 𝑅 .
Example: Let A = {1, 2, 3}
𝑅1 = { (1, 1), (2, 2), (3, 3), (1, 2), (2, 3)}
𝑅2 = { (1, 1), (2, 2), (3, 3), (1, 2),(2,1) (2, 3),(3,2)}
𝑅3 = {(1, 2), (2,1)}
𝑅4 = { (1, 1), (2, 2), (3, 3), (1, 2), (2, 3),(1,3),(2,1),(3,1),(3,2)}
𝑅5 = { }
Equivalence Relation
 Equivalence Relation
Equivalence Relation
A relation 𝑅 on the set 𝐴 is said to be equivalence relation, if it is reflexive, symmetric, and
transitive on the set 𝐴 The identity relation and universal relation on any non-empty set are
equivalence relations.
Example: Relation R in the set A of human beings in a town at a particular time given by
1. 𝑅1 = {(x,y): y=x+5 and x<4 }
2. Let L be the set of all lines in a plane and R be the relation in L defined as 𝑅 =
{(𝐿1 , 𝐿2 ): 𝐿1 is perpendicular to 𝐿2 }
3. 𝑅3 = {(x,y): 2 divides x-y }
 Question

The minimum number of elements that must be added to the relation

𝑅 = {(𝑎, 𝑏), (𝑏, 𝑐)} on the set {𝑎, 𝑏, 𝑐} so that it is an equivalence relation is ______.

Ans: (13)
 Question

Let R be a relation defined on ℕ as 𝑎Rb if 2a + 3 b is a multiple of 5, a, b ∈ ℕ. Then R is

(1) an equivalence relation

(2) transitive but not symmetric

(3) not reflexive

(4) symmetric but not transitive

Ans: (1)
 Question

Let 𝑅 be a relation on ℝ, given by 𝑅 = {(𝑎, 𝑏): 3𝑎 − 3𝑏 + 7 is an irrational number }

Then 𝑅 is
(1) reflexive and symmetric but not transitive

(2) reflexive and transitive but not symmetric

(3) reflexive but neither symmetric nor transitive
(4) an equivalence relation

Ans: (3)
 Question

Let A = {1,2,3, … … 100}. Let R be a relation on A defined by (𝑥, 𝑦) ∈ 𝑅 if and only if

2x = 3y. Let 𝑅1 be a symmetric relation on 𝐴 such that 𝑅 ⊂ 𝑅1 and the number of
elements in 𝑅1 is 𝑛. Then, the minimum value of 𝑛 is _______.

Ans: (66)
 Question
a
Among the relations S = (a, b): a, b ∈ ℝ − {0}, 2 + > 0 and T = {(a, b): a, b ∈ ℝ, a2 −
b

b2 ∈ Z}

(1) S is transitive but T is not

(2) both S and 𝑇 are symmetric

(3) neither S nor T is transitive

(4) T is symmetric but 𝑆 is not

Ans: (4)
 Question
The number of non-empty equivalence relations on the set {1,2,3} is :

[22-01-2025-Shift 1]

a) 7

b) 4

c) 6

d) 5

Ans: (d)
 Question

The relation 𝑅 = {(𝑎, 𝑏): gcd(𝑎, 𝑏) = 1,2𝑎 ≠ 𝑏, 𝑎, 𝑏 ∈ ℤ} is

(1) reflexive but not symmetric

(2) transitive but not reflexive

(3) symmetric but not transitive

(4) neither symmetric nor transitive

Ans: (4)
 Question
1 1 1 1
The A = { , , , , 1,2,3,4,5}. If the relation R is defined on A such that relation 𝑅 =
5 4 3 2

x, y : log 𝑦 𝑥 ≥ 0 , then R is

(1) reflexive

(2) transitive

(3) symmetric

(4) Equivalence

Ans: (3)
 Question

Let R be the real line, consider the following subsets of plane RxR

𝑠= 𝑥, 𝑦 : 𝑦 = 𝑥 , 0 < 𝑥 < 4

𝑇= 𝑥, 𝑦 : 𝑥 − 𝑦 𝑖𝑠 𝑎𝑛 𝑖𝑛𝑡𝑒𝑔𝑒𝑟

(1) T is equivalence relation on R but S is not.

(2) T and S are equivalence

(3) Neither T nor S are equivalence

(4) S is equivalence relation on R but T is not.

Ans: (1)
 Question

In the set Z of all integers, which of the following relation R is an equivalence relation

(1) xRy: if x≤y.

(2) xRy: if x=y.

(3) xRy: if x-y is an even.

(4) xRy: if x-y(mod 3).

Ans: (2,3,4,)
 Question

If a relation R is defined on Z as 𝑅 = 𝑎, 𝑏 ∶ 2𝑎2 + 3𝑏 2 = 35, 𝑎, 𝑏 ∈ 𝑧 , then

(1) Domain = { ±1, ±2}.

(2) Domain = { ±4, ±2}.

(3) Range = {0, ±1, ±2, ±4, ±9}.

(4) Range = {±1, ±3 }.

Ans: (2,4)
 Anti Symmetric Relation

Example: The relation R = { (a, b) | a ≤ b} on the set of whole numbers

is antisymmetric because whenever a ≤ b and b ≤ a, then a = b..
 Anti Symmetric Relation
A relation 𝑅 on the set 𝐴 is said to be antisymmetric, if (𝑎, 𝑏) ∈ 𝑅 and (𝑏, 𝑎) ∈ 𝑅 implies
𝑎 = 𝑏.

If (𝑎, 𝑏) ∈ 𝑅 but (𝑏, 𝑎) ∉ 𝑅 then the relation is anti-symmetric relation.

Identity relation on a non-empty set is anti-symmetric relation.

Universal relation defined on a set having at least two elements is not anti-symmetric
relation.

A relation which is not symmetric need not be an anti-symmetric relation.

 Partial order Relation
Partial Order Relation

A relation R on the set A is said to be partial ordered relation on the set A if it is reflexive,
anti-symmetric, and transitive.

Example: Show whether the relation R such that (x, y) ∈ R, if, x ≥ y defined on the set of
positive integers is a partial order relation
Important Observations
 Reflexive Relation
Important points to remember about reflexive relation:
1. Every identity relation is reflexive, but every reflexive relation need not be an
identity relation.
2. The minimum number of elements in the reflexive relation 𝑅 on the set 𝐴 is 𝑛(𝐴).
3. Universal relation on any non-empty set is reflexive relation.
4. If 𝑅 is a reflexive relation and 𝑆 is any relation, then 𝑅 ∪ 𝑆 is a reflexive relation.
5. Number of reflexive relations defined on set 𝐴 is 2𝑛(𝑛−1) .
 Question

If A={1,2,3}, the Number of reflexive relations in 𝐴 is k then k/4 is…….

 Symmetric Relation
Important points to remember about symmetric relation
1. Every identity relation is symmetric, but every symmetric relation need not be an
identity relation.
2. Universal relation and void relation on any non-empty set are symmetric relations.
 Symmetric Relation
Important points to remember about symmetric relation:
4. A reflexive relation need not be symmetric relation.
5. A relation 𝑅 is symmetric if and only if 𝑅 = 𝑅−1
6. If 𝑅 and 𝑆 are any two symmetric relations then 𝑅 ∪ 𝑆 and 𝑅 ∩ 𝑆 are also
symmetric relations.
 Symmetric Relation
𝑛(𝑛+1)
7. Number of Symmetric relations defined on set 𝐴 is 2 2 .

8. Number of not symmetric relations defined on set 𝐴 having 𝑛 elements

𝑛(𝑛+1)
𝑛2
is 2 −2 2
 Symmetric Relation
𝑛2 −𝑛
9. Number of symmetric and reflexive relations defined on the set A is 2 2

𝑛(𝑛+1) 𝑛2 −𝑛
10. The number of symmetric relations which are not reflexive is 2 2 −2 2 .
 Transitive Relation
Important points to remember about transitive relation:
1. Every identity relation is transitive, but every transitive relation need not be an
identity relation.
2. Universal relation on any non-empty set is transitive relation.
3. If 𝑅 and 𝑆 are any two transitive relations, then 𝑅 ∪ 𝑆 is need not be transitive
relation.
 Equivalence Relation
Important points to remember about equivalence relations
1. If 𝑅 is an equivalence relation, then its inverse also equivalence.
2. Intersection of two equivalence relations is an equivalence.
3. Union of two equivalence relations need not be an equivalence relation.
4. Identity relation defined on a non-empty set is equivalence relation.
5. Universal relation defined on a non empty set is equivalence relation.
 Equivalence Relations

To find the number of equivalence relations, use the Bell's triangle.

𝑛( A)
1 1
2 1 2
3 2 3 5
4 5 7 10 15
5 15 20 27 37 52
Miscellaneous questions on Relations
 Question

If 𝑅 is the smallest equivalence relation on the set {1,2,3,4} such that {(1,2), (1,3)} ⊂ 𝑅,
then the number of elements in 𝑅 is

(1) 10

(2) 12

(3) 8

(4) 15

Ans: (1)
 Question

Let A = {1,2,3,4} and R = {(1,2), (2,3), (1,4)} be a relation on A. Let S be the

equivalence relation on 𝐴 such that R ⊂ S and the number of elements in S is n. Then,
the minimum value of 𝑛 is _______.

Ans: (16)
 Question
Let A={n∈[100,700]∩N : n is neither a multiple of 3 nor a multiple of 4}. Then the
number of elements in A is

[06-04-2024-Shift 1]

a) 300

b) 310

c) 290

d) 280

Ans: (d)
 Question
Let 𝑆 = {1,2,3, … , 10}. Suppose 𝑀 is the set of all the subsets of 𝑆, then
the relation R = {(A, B): A ∩ B ≠ 𝜙; A, B ∈ M} is :

[27-01-2024-Shift 1]

a) symmetric and reflexive only

b) reflexive only

c) symmetric and transitive only

d) symmetric only

Ans: (d)
 Question
The number of symmetric relations defined on the set {1,2,3,4} which are
not reflexive is ______.
[30-01-2024-Shift 2]

Ans: (960)
 Question
Let R be a relation on Z × Z defined by (a, b)R(c, d) if and only if ad - bc is
divisible by 5. Then 𝑅 is

[29-01-2024-Shift 1]

a) Reflexive and symmetric but not transitive

b) Reflexive but neither symmetric not transitive

c) Reflexive, symmetric and transitive

d) Reflexive and transitive but not symmetric

Ans: (a)
 Question
Let A = {1,2,3,4} and R = {(1,2), (2,3), (1,4)} be a relation on A. Let S be
the equivalence relation on A such that R ⊂ 𝐒 and the number of
elements in S is n. Then, the minimum value of 𝑛 is ________.
[31-01-2024- Shift 1]

Ans: (16)
 Question
Let A = {1,2,3, … … .100}. Let R be a relation on A defined by (𝑥, 𝑦) ∈ 𝑅 if
and only if 2x = 3y. Let 𝑅7 be a symmetric relation on 𝐴 such that 𝑅 ⊂ 𝑅1
and the number of elements in 𝑅7 is 𝑛. Then, the minimum value of 𝑛 is
_________
[31-01-2024- Shift 2]

Ans: (66)
 Question
Consider the relations 𝑅1 and 𝑅2 defined as 𝑎𝑅1 𝑏 ⇔ 𝑎2 + 𝑏 2 = 1 for all
𝑎, 𝑏, ∈ 𝑅 and (𝑎, 𝑏)𝑅2 (𝑐, 𝑑) ⇔ a + d = b + c for all (a, b), (c, d) ∈ N × N.
Then

[01-02-2024- Shift 2]

a) Only 𝑅1 is an equivalence relation

b) Only 𝑅2 is an equivalence relation

c) 𝑅1 and 𝑅2 both are equivalence relations

d) Neither 𝑅1 nor 𝑅2 is an equivalence relation

Ans: (b)
 Question

Let 𝑅 be a relation on 𝑁 × 𝑁 defined by (𝑎, 𝑏)𝑅(𝑐, 𝑑) if and only if 𝑎𝑑(𝑏 − 𝑐) = 𝑏𝑐(𝑎 − 𝑑).
Then 𝑅 is

(1) Transitive but neither reflexive nor symmetric

(2) Reflexive and symmetric but not transitive

(3) Symmetric but neither reflexive nor transitive

(4) Symmetric and transitive but not reflexive

Ans: (3)
 Question

Let 𝐴 = {2,3,4} and 𝐵 = {8,9,12}. Then the number of elements in the relation

𝑅 = ቄ 𝑎1 , 𝑏1 , 𝑎2 , 𝑏2 ∈ (𝐴 × 𝐵, 𝐴 × 𝐵): 𝑎1 divides 𝑏2 and 𝑎2 divides 𝑏1 } is

(1) 36

(2) 24

(3) 12

(4) 18

Ans: (1)
 Question

Let A = {1,3,4,6,9} and B = {2,4,5,8,10}. Let R be a relation defined on A × B such that,

R= a1 , b1 , a2 , b2 : a1 ≤ b2 and b1 ≤ a2 }. Then the number of elements in the set R
is
(1) 160
(2) 52
(3) 180
(4) 26

Ans: (1)
 Question

Let 𝐴 = {1,2,3,4, … , 10} and 𝐵 = {0,1,2,3,4}. The number of elements in the relation

R = (a, b) ∈ A × A: 2(a − b)2 + 3(a − b) ∈ B is_______

Ans: (18)
 Question

Let 𝐴 = {1,2,3,4} and 𝑅 be a relation on the set 𝐴 × 𝐴 defined by

𝑅 = {((𝑎, 𝑏), (𝑐, 𝑑)): 2𝑎 + 3𝑏 = 4𝑐 + 5𝑑} then the number of elements in 𝑅 is

Ans: (6)
Thank You