DISCRETE MATHEMATICS (3140708)

CHAPTER 1 – Unit 3
RELATIONS

CONTENT

❖ Definition
❖ Binary relation
❖ Representation
❖ Domain
❖ Range
❖ Universal relation
❖ Void relation
❖ Union, Intersection and Complement operations on relations
❖ Properties of Binary relations in a set: Reflexive, Symmetric, Transitive, Anti-
symmetric relations
❖ Relation matrix
❖ Graph of a relation
❖ Partition and covering of a set
❖ Equivalence relation
❖ Equivalence classes
❖ Compatibility Relation
❖ Maximum compatibility block
❖ Composite relation
❖ Converse of a relation
❖ Transitive closure of a relation 𝑅 in set 𝑋

Definition of a relation (binary relation)

Let 𝐴 and 𝐵 be two sets. Then, 𝐴 × 𝐵 is the cartesian product of 𝐴 and 𝐵.
A subset of 𝐴 × 𝐵 is called the relation (binary relation) from a set 𝐴 to a set 𝐵.
In other words, a relation (binary relation) from a set 𝐴 to a set 𝐵 is a set of ordered pairs (𝑥, 𝑦)
where first element 𝑥 is an element of set 𝐴 and second element 𝑦 is an element of set 𝐵.
Generally, a relation is denoted by 𝑅.
For example,
1) Let 𝐴 = {1, 2} and 𝐵 = {3, 4}. Then, 𝐴 × 𝐵 = {(1, 3), (1, 4), (2, 3), (2, 4)}.
 Let 𝑅 = {(1, 3), (1, 4), (2, 4)} be the subset of 𝐴 × 𝐵.
Here 𝑅 is called a relation from a set 𝐴 to a set 𝐵.
2) Let 𝐴 = {1, 2}. Then, 𝐴 × 𝐴 = {(1, 1), (1, 2), (2, 1), (2, 2)}.
Let 𝑅 = {(1, 1), (2, 2)} be the subset of 𝐴 × 𝐴.
Here 𝑅 is called a relation from a set 𝐴 to a set 𝐴.
Important points
1) If (𝑥, 𝑦) ∈ 𝑅 then we can say that 𝑥 is related to 𝑦.
2) (𝑥, 𝑦) ∈ 𝑅 can be written as 𝑥𝑅𝑦.
3) If (𝑥, 𝑦) ∉ 𝑅 then we can say that 𝑥 is not related to 𝑦.
Question
Let 𝑅 be the relation on set 𝐴 = {1, 2} defined as 𝑥𝑅𝑦 if 𝑥 ≤ 𝑦. Then, write all possible
elements (ordered pairs) of 𝑅.
Answer
Given that 𝐴 = {1, 2}. Find 𝐴 × 𝐴.
𝐴 × 𝐴 = {1, 2} × {1, 2}
= {(1, 1), (1, 2), (2, 1), (2, 2)}
Given that 𝑥𝑅𝑦 if 𝑥 ≤ 𝑦. That is, 𝑥 is related to 𝑦 if 𝑥 is less than or equal 𝑦 where 𝑥 is first
element and 𝑦 is second element of ordered pair.

Since 1 = 1, we have (1, 1) ∈ 𝑅.

Since 1 < 2, we have (1, 2) ∈ 𝑅.
Since 2 > 1, we have (2, 1) ∉ 𝑅.
Since 2 = 2, we have (2, 2) ∈ 𝑅.
Hence, 𝑅 = {(1, 1), (1, 2), (2, 2)}.

Try Yourself
Let 𝑅 be the relation on set 𝐴 = {2, 3} defined as 𝑥𝑅𝑦 if 𝑥 ≥ 𝑦. Then, write all possible
elements (ordered pairs) of 𝑅.
Try Yourself
Let 𝑅 be the relation on set 𝐴 = {1, 2} defined as 𝑎𝑅𝑏 if 𝑎 < 𝑏. Then, write all possible
elements (ordered pairs) of 𝑅.
Question (DEC 2021 – 04 Marks)
Let 𝐿 denotes the relation “less than or equal to” and 𝐷 denotes the relation “divides”. Where
𝑥𝐷𝑦 means “𝑥 divides 𝑦”. Both 𝐿 and 𝐷 are defined on the set {1, 2, 3, 6}. Write 𝐿 and 𝐷 as
sets, find 𝐿 ∩ 𝐷.
Answer
Let 𝐿 be the relation “less than or equal to” defined on the set {1, 2, 3, 6}. Write 𝐿 as a set.
1 = 1. So, (1,1) ∈ 𝐿. 1 < 2. So, (1,2) ∈ 𝐿.
1 < 3. So, (1,3) ∈ 𝐿. 1 < 6. So, (1,6) ∈ 𝐿.
2 = 2. So, (2,2) ∈ 𝐿. 2 < 3. So, (2,3) ∈ 𝐿.
2 < 6. So, (2,6) ∈ 𝐿. 3 = 3. So, (3,3) ∈ 𝐿.
3 < 6. So, (3,6) ∈ 𝐿. 6 = 6. So, (6,6) ∈ 𝐿.
Hence, 𝐿 = {(1,1), (1,2), (1,3), (1,6), (2,2), (2,3), (2,6), (3,3), (3,6), (6,6)}

Let 𝐷 be the relation “divides” defined on the set {1, 2, 3, 6}. Write 𝐷 as a set.
Since 1 divides every number, we have (1,1) ∈ 𝐷 , (1,2) ∈ 𝐷 , (1,3) ∈ 𝐷 and (1,6) ∈ 𝐷.
Since 2 divides 2, we have (2,2) ∈ 𝐷.
Since 2 divides 6, we have (2,6) ∈ 𝐷.
Since 3 divides 3, we have (3,3) ∈ 𝐷.
Since 3 divides 6, we have (3,6) ∈ 𝐷.
Since 6 divides 6, we have (6,6) ∈ 𝐷.
Hence, 𝐷 = {(1,1), (1,2), (1,3), (1,6), (2,2), (2,6), (3,3), (3,6), (6,6)}

Now find the intersection of sets 𝐿 and 𝐷. That is, find the ordered pairs which are common
to both sets.
𝐿 ∩ 𝐷 = {(1,1), (1,2), (1,3), (1,6), (2,2), (2,6), (3,3), (3,6), (6,6)} = 𝐷

Important note
𝑥 divides 𝑦 if 𝑦/𝑥 is an integer. For example, 2 divides 3 is NOT true because 3/2 = 1.5
and note that 1.5 is not an integer. For example, 2 divides 6 is true because 6/2 = 3 and
note that 3 is an integer.
Domain of a relation
The domain of a relation 𝑅 is the set of all the first element of the ordered pairs which are
present in 𝑅. It is denoted by 𝐷(𝑅) or 𝐷𝑜𝑚(𝑅).
𝐷(𝑅) = { 𝑥 ∶ (𝑥, 𝑦) ∈ 𝑅}
Range of a relation
The range of a relation 𝑅 is the set of all the second element of the ordered pairs which are
present in 𝑅. It is denoted by 𝑅(𝑅) or 𝑟𝑎𝑛𝑔𝑒(𝑅).
𝑟𝑎𝑛𝑔𝑒(𝑅) = { 𝑦 ∶ (𝑥, 𝑦) ∈ 𝑅}
For example,
1) Let 𝑅 = {(1,1), (1,3), (2,1), (2,3), (4,3), (4,4)} be the relation on 𝐴 = {1, 2, 3, 4}.
Observe the first element of each ordered pair. We have 1, 2, 4 as first element.
Hence, the domain of 𝑅 is given by 𝐷(𝑅) = {1, 2, 4}.
Observe the second element of each ordered pair. We have 1, 3, 4 as second element.
Hence, the range of 𝑅 is given by 𝑟𝑎𝑛𝑔𝑒(𝑅) = {1, 3, 4}.

Universal relation

Let 𝐴 and 𝐵 be two sets. Then, 𝐴 × 𝐵 is the cartesian product of 𝐴 and 𝐵.

The universal relation from a set 𝐴 to a set 𝐵 is a set of all ordered pairs (𝑥, 𝑦) which are
present in 𝐴 × 𝐵. In other words, if 𝑅 = 𝐴 × 𝐵 then 𝑅 is called the universal relation.

Void relation / Empty relation

A void relation, also known as an empty relation, is a relation that contains no ordered pairs.
In other words, if 𝑅 = ∅ or 𝑅 = { } then 𝑅 is called void relation.
For example,

1) Let 𝑅 be the relation on set 𝐴 = {2, 4, 5} defined as

𝑅 = {(𝑥, 𝑦) | 𝑥 ∈ 𝐴 , 𝑦 ∈ 𝐴 , 𝑥 + 𝑦 > 10}.
We have 𝐴 × 𝐴 = {(2,2), (2,4), (2,5), (4,2), (4,4), (4,5), (5,2), (5,4), (5,5)}.
𝑅 contains the ordered pairs (𝑥, 𝑦) which are present in 𝐴 × 𝐴 and 𝑥 + 𝑦 is greater than
10 where 𝑥 is first element and 𝑦 is second element.
There is no such pair. Hence, 𝑅 is void relation. That is, 𝑅 = ∅ or 𝑅 = { }.

Union, Intersection and Complement operations on relations

• The union of two relations 𝑅 and 𝑆 can be defined as the set containing all ordered
pairs (𝑥, 𝑦) that are either present in relation 𝑅 or in relation 𝑆, or in both. It is denoted
by 𝑅 ∪ 𝑆.
For example,

1) Let 𝐴 = {1, 2, 3} and 𝐵 = {4, 5, 6} be two sets.

Let 𝑅 be the relation from 𝐴 to 𝐵 where 𝑅 = {(1,5), (2,4), (2,6), (3,5), (3,6)}.
Let 𝑆 be the relation from 𝐴 to 𝐵 where 𝑆 = {(1,6), (2,6), (3,4), (3,6)}.
Then, the union of 𝑅 and 𝑆 is given by
𝑅 ∪ 𝑆 = {(1,5), (1,6), (2,4), (2,6), (3,4), (3,5), (3,6)}

• The intersection of two relations 𝑅 and 𝑆 can be defined as the set containing all
ordered pairs (𝑥, 𝑦) that are common to both relations. It is denoted by 𝑅 ∩ 𝑆.

For example,

1) Let 𝐴 = {1, 2, 3} and 𝐵 = {4, 5, 6} be two sets.

Let 𝑅 be the relation from 𝐴 to 𝐵 where 𝑅 = {(1,5), (2,4), (𝟐, 𝟔), (3,5), (𝟑, 𝟔)}.
Let 𝑆 be the relation from 𝐴 to 𝐵 where 𝑆 = {(1,6), (𝟐, 𝟔), (3,4), (𝟑, 𝟔)}.
Then, the intersection of 𝑅 and 𝑆 is given by
𝑅 ∩ 𝑆 = {(2,6), (3,6)}

• The complement of a relation 𝑅 is the set of all ordered pairs that are present in universal
relation but not in relation 𝑅. It is denoted by 𝑅 ′ or 𝑅 𝑐 .

For example,

1) Let 𝐴 = {1, 2, 3} and 𝐵 = {4, 5, 6} be two sets.

Let 𝐴 × 𝐵 be the universal relation where
𝐴 × 𝐵 = {(1,4), (1,5), (1,6), (2,4), (2,5), (2,6), (3,4), (3,5), (3,6)}.

Let 𝑅 be the relation from 𝐴 to 𝐵 where 𝑅 = {(1,5), (2,4), (2,6), (3,5), (3,6)}.
Then, the complement of 𝑅 is given by 𝑅 ′ = {(1,4), (1,6), (2,5), (3,4)}.

Let 𝑆 be the relation from 𝐴 to 𝐵 where 𝑆 = {(1,6), (2,6), (3,4), (3,6)}.

Then, the complement of 𝑆 is given by 𝑆 ′ = {(1,4), (1,5), (2,4), (2,5), (3,5)}.
Properties of Binary relations in a set
• Reflexive
The relation 𝑅 defined on set 𝐴 is called reflexive relation if for every element 𝑥 in 𝐴,
the ordered pair (𝑥, 𝑥) in 𝑅. In other words, the relation is reflexive if every element 𝑥
of set is related to itself. In other words, the relation is reflexive if 𝑥𝑅𝑥 for every 𝑥 ∈ 𝐴.
For example,
Let 𝑅 be the relation defined on set 𝐴 = {𝑎, 𝑏, 𝑐} where
𝑅 = {(𝑎, 𝑎), (𝑎, 𝑏), (𝑏, 𝑏), (𝑏, 𝑐), (𝑐, 𝑎), (𝑐, 𝑐)}.
Note that (𝑎, 𝑎) ∈ 𝑅 where 𝑎 ∈ 𝐴.
Also, (𝑏, 𝑏) ∈ 𝑅 where 𝑏 ∈ 𝐴.
Also, (𝑐, 𝑐) ∈ 𝑅 where 𝑐 ∈ 𝐴.
Since (𝑎, 𝑎) ∈ 𝑅 , (𝑏, 𝑏) ∈ 𝑅 and (𝑐, 𝑐) ∈ 𝑅, the relation 𝑅 is reflexive.
For example,
Let 𝑅 be the relation defined on set 𝐴 = {1, 2, 3} where
𝑅 = {(1,1), (1,3), (2,1), (2,3), (3,1), (3,3)}.
Note that (2,2) ∉ 𝑅 where 2 ∈ 𝐴.
Hence, the relation 𝑅 is NOT reflexive.

• Symmetric
The relation 𝑅 defined on set 𝐴 is called symmetric relation if ordered pair (𝑦, 𝑥) in 𝑅
for every ordered pair (𝑥, 𝑦) in 𝑅. In other words, the relation is symmetric if 𝑦 is related
to 𝑥 for every 𝑥 related to 𝑦. In other words, the relation is symmetric if 𝑦𝑅𝑥 for every
𝑥𝑅𝑦.
For example,
Let 𝑅 be the relation defined on set 𝐴 = {1, 2, 3} where
𝑅 = {(1,2), (1,3), (2,1), (2,2), (3,1), (3,3)}.
For (1,2) in 𝑅, the ordered pair (2,1) is also present in 𝑅.
For (1,3) in 𝑅, the ordered pair (3,1) is also present in 𝑅.
Since for every pair (𝑥, 𝑦) in 𝑅, the ordered pair (𝑦, 𝑥) is also present in 𝑅, the relation
𝑅 is symmetric.
For example,
Let 𝑅 be the relation defined on set 𝐴 = {𝑥, 𝑦, 𝑧} where
 𝑅 = {(𝑥, 𝑥), (𝑥, 𝑦), (𝑦, 𝑥), (𝑦, 𝑦), (𝑧, 𝑦), (𝑧, 𝑧)}.
For (𝑧, 𝑦) in 𝑅, the ordered pair (𝑦, 𝑧) is NOT present in 𝑅.
Hence, the relation 𝑅 is NOT symmetric.

• Transitive
The relation 𝑅 defined on set 𝐴 is called transitive relation if ordered pair (𝒙, 𝑦) in 𝑅
and (𝑦, 𝒛) in 𝑅 then the ordered pair (𝒙, 𝒛) is also present in 𝑅. In other words, the
relation is transitive if 𝒙 is related to 𝑦 and 𝑦 is related to 𝒛 then 𝒙 must be related to 𝒛.
In other words, the relation is transitive if 𝑥𝑅𝑧 for every 𝑥𝑅𝑦 and 𝑦𝑅𝑧.
For example,
Let 𝑅 be the relation defined on set 𝐴 = {1, 2, 3} where
𝑅 = {(1,2), (1,3), (2,2), (2,3), (3,2), (3,3)}.
Let (𝒙, 𝑦) = (𝟏, 2) ∈ 𝑅 and (𝑦, 𝒛) = (2, 𝟑) ∈ 𝑅. Then, (𝑥, 𝑧) = (𝟏, 𝟑) is also in 𝑅.
Let (𝟏, 3) ∈ 𝑅 and (3, 𝟐) ∈ 𝑅. Then, new ordered pair (𝟏, 𝟐) is also in 𝑅.
Let (𝟐, 3) ∈ 𝑅 and (3, 𝟐) ∈ 𝑅. Then, new ordered pair (𝟐, 𝟐) is also in 𝑅.
Let (𝟑, 2) ∈ 𝑅 and (2, 𝟑) ∈ 𝑅. Then, new ordered pair (𝟑, 𝟑) is also in 𝑅.
Since all new ordered pairs belong to 𝑅, the relation 𝑅 is transitive.
For example,
Let 𝑅 be the relation defined on set 𝐴 = {𝑑, 𝑒, 𝑓} where
𝑅 = {(𝑑, 𝑑), (𝑑, 𝑒), (𝑒, 𝑒), (𝑒, 𝑓), (𝑓, 𝑓)}.
Let (𝒅, 𝑒) ∈ 𝑅 and (𝑒, 𝒇) ∈ 𝑅. But, new ordered pair (𝒅, 𝒇) is NOT in 𝑅.
Since new ordered pair is NOT present in 𝑅, the relation 𝑅 is NOT transitive.

• Anti-symmetric
The relation 𝑅 defined on set 𝐴 is called anti-symmetric relation if ordered pair (𝑥, 𝑦)
in 𝑅 and ordered pair (𝑦, 𝑥) in 𝑅 then 𝑥 = 𝑦. In other words, the relation 𝑅 is
anti-symmetric if ordered pair (𝑦, 𝑥) is NOT present in 𝑅 for every (𝑥, 𝑦) present in 𝑅.
For example,
Let 𝑅 be the relation defined on set 𝐴 = {2, 4, 6} where
𝑅 = {(2,2), (2,6), (4,2), (4,4), (6,4)}.
Let (2,6) ∈ 𝑅. But, (6,2) ∉ 𝑅.
 Let (4,2) ∈ 𝑅. But, (2,4) ∉ 𝑅.
Let (6,4) ∈ 𝑅. But, (4,6) ∉ 𝑅.
Since (𝑦, 𝑥) ∉ 𝑅 for every (𝑥, 𝑦) ∈ 𝑅, the relation 𝑅 is anti-symmetric.
For example,
Let 𝑅 be the relation defined on set 𝐴 = {1, 3, 5} where
𝑅 = {(1,1), (1,3), (3,1), (3,5), (5,5)}.
Let (1,3) ∈ 𝑅. Then, (3,1) is also present in 𝑅.
Hence, the relation 𝑅 is NOT anti-symmetric.
Let (3,5) ∈ 𝑅. But, (5,3) ∉ 𝑅.
Hence, the relation 𝑅 is NOT symmetric.

• Irreflexive

The relation 𝑅 defined on set 𝐴 is called irreflexive relation if for every element 𝑥 in 𝐴,
the ordered pair (𝑥, 𝑥) is not present in 𝑅. In other words, the relation is irreflexive if
every element 𝑥 of set is NOT related to itself.
For example,
Let 𝑅 be the relation defined on set 𝐴 = {1, 2, 3} where
𝑅 = {(1,2), (1,3), (2,1), (2, 3), (3,1), (3,2)}.
Note that (1,1) ∉ 𝑅 where 1 ∈ 𝐴.
Also, (2,2) ∉ 𝑅 where 2 ∈ 𝐴.
Also, (3,3) ∉ 𝑅 where 3 ∈ 𝐴.
Since (1,1) ∉ 𝑅 , (2,2) ∉ 𝑅 and (3,3) ∉ 𝑅, the relation 𝑅 is irreflexive.
For example,
Let 𝑅 be the relation defined on set 𝐴 = {1, 2, 3} where
𝑅 = {(1,1), (1,3), (2,1), (2,3), (3,1), (3,3)}.
Note that (1, 1) ∈ 𝑅 where 1 ∈ 𝐴. Hence, the relation 𝑅 is NOT irreflexive.
Note that (2, 2) ∉ 𝑅 where 2 ∈ 𝐴. Hence, the relation 𝑅 is NOT reflexive.
Important points
1) The relation is symmetric if (𝑦, 𝑥) ∈ 𝑅 for every (𝑥, 𝑦) ∈ 𝑅.
2) The relation is anti-symmetric if (𝑦, 𝑥) ∉ 𝑅 for every (𝑥, 𝑦) ∈ 𝑅.
Equivalence relation

The relation 𝑅 defined on set 𝐴 is called equivalence relation if

1) 𝑅 is reflexive
2) 𝑅 is symmetric
3) 𝑅 is transitive
Question (JULY 2022 – 03 Marks)
For the relation {(2,2), (2,3), (2,4), (3,2), (3,3), (3,4)} on the set {1, 2, 3, 4}, decide whether it
is reflexive, whether it is symmetric, whether it is anti-symmetric, and whether it is transitive.
(Justify your answer if the property is not satisfied)
Answer
Let 𝐴 = {1, 2, 3, 4} be the given finite set.
Let 𝑅 = {(2,2), (2,3), (2,4), (3,2), (3,3), (3,4)} be the given relation.
For 1 ∈ 𝐴 , the ordered pair (1, 1) ∉ 𝑅. Hence, the given relation is NOT reflexive.
(2, 4) ∈ 𝑅 but (4, 2) ∉ 𝑅. Hence, the given relation is NOT symmetric.
(2, 3) ∈ 𝑅 and (3, 2) ∈ 𝑅. But, 2 ≠ 3. Hence, the given relation is NOT anti-symmetric.
Let (𝟐, 3) ∈ 𝑅 and (3, 𝟐) ∈ 𝑅. Then, new ordered pair (𝟐, 𝟐) is also in 𝑅.
Let (𝟐, 3) ∈ 𝑅 and (3, 𝟒) ∈ 𝑅. Then, new ordered pair (𝟐, 𝟒) is also in 𝑅.
Let (𝟑, 2) ∈ 𝑅 and (2, 𝟑) ∈ 𝑅. Then, new ordered pair (𝟑, 𝟑) is also in 𝑅.
Let (𝟑, 2) ∈ 𝑅 and (2, 𝟒) ∈ 𝑅. Then, new ordered pair (𝟑, 𝟒) is also in 𝑅.
Since all new ordered pairs belong to 𝑅, the given relation is transitive.
Question (JULY 2023 – 04 Marks)
Check whether the relation 𝑅 defined in the {1, 2, 3, 4, 5, 6} as 𝑅 = {(𝑎, 𝑏) ∶ 𝑏 = 𝑎 + 1} is
reflexive, symmetric or transitive.
Answer
Let 𝐴 = {1, 2, 3, 4, 5, 6} be the given finite set.
First, we need to write all possible ordered pairs (𝑎, 𝑏) such that 𝑏 = 𝑎 + 1 where 𝑎 ∈ 𝐴 and
𝑏 ∈ 𝐴.
Let 𝑎 = 1. Then, 𝑏 = 1 + 1 = 2. So, (1, 2) ∈ 𝑅.
Let 𝑎 = 2. Then, 𝑏 = 2 + 1 = 3. So, (2, 3) ∈ 𝑅.
Let 𝑎 = 3. Then, 𝑏 = 3 + 1 = 4. So, (3, 4) ∈ 𝑅.
Let 𝑎 = 4. Then, 𝑏 = 4 + 1 = 5. So, (4, 5) ∈ 𝑅.
Let 𝑎 = 5. Then, 𝑏 = 5 + 1 = 6. So, (5, 6) ∈ 𝑅.
Let 𝑎 = 6. Then, 𝑏 = 6 + 1 = 7. But, 7 ∉ 𝐴.
Hence, 𝑅 = {(1, 2), (2, 3), (3, 4), (4, 5), (5, 6)}.
For 1 ∈ 𝐴 , the ordered pair (1, 1) ∉ 𝑅. Hence, the given relation is NOT reflexive.
(1, 2) ∈ 𝑅 but (2, 1) ∉ 𝑅. Hence, the given relation is NOT symmetric.
Let (𝟏, 2) ∈ 𝑅 and (2, 𝟑) ∈ 𝑅. But, new ordered pair (𝟏, 𝟑) is NOT present in 𝑅.
Hence, the given relation is NOT transitive.

Question (DEC 2021 – 03 Marks)

Given 𝑆 = {1, 2, 3, … , 10} and a relation 𝑅 on 𝑆, where 𝑅 = {⟨𝑥, 𝑦⟩ | 𝑥 + 𝑦 = 10}. What are
the properties of relation 𝑅?
Answer
Let 𝑆 = {1, 2, 3, … , 10} be the given finite set.
First, we need to write all possible ordered pairs (𝑥, 𝑦) such that 𝑥 + 𝑦 = 10 where 𝑥 ∈ 𝑆 and
𝑦 ∈ 𝑆.
Let 𝑥 = 1 and 𝑦 = 9. Then, 𝑥 + 𝑦 = 1 + 9 = 10. So, (1, 9) ∈ 𝑅. Similarly, (9, 1) ∈ 𝑅.
Let 𝑥 = 2 and 𝑦 = 8. Then, 𝑥 + 𝑦 = 2 + 8 = 10. So, (2, 8) ∈ 𝑅. Similarly, (8, 2) ∈ 𝑅.
Let 𝑥 = 3 and 𝑦 = 7. Then, 𝑥 + 𝑦 = 3 + 7 = 10. So, (3, 7) ∈ 𝑅. Similarly, (7, 3) ∈ 𝑅.
Let 𝑥 = 4 and 𝑦 = 6. Then, 𝑥 + 𝑦 = 4 + 6 = 10. So, (4, 6) ∈ 𝑅. Similarly, (6, 4) ∈ 𝑅.
Let 𝑥 = 5 and 𝑦 = 5. Then, 𝑥 + 𝑦 = 5 + 5 = 10. So, (5, 5) ∈ 𝑅.
Hence, 𝑅 = {(1, 9), (2, 8), (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)}.
For 1 ∈ 𝐴 , the ordered pair (1, 1) ∉ 𝑅. Hence, the given relation is NOT reflexive.
(1, 9) ∈ 𝑅 and (9, 1) is also in 𝑅.
(2, 8) ∈ 𝑅 and (8, 2) is also in 𝑅.
(3, 7) ∈ 𝑅 and (7, 3) is also in 𝑅.
(4, 6) ∈ 𝑅 and (6, 4) is also in 𝑅.
Hence, the given relation is symmetric.
Let (𝟏, 9) ∈ 𝑅 and (9, 𝟏) ∈ 𝑅. But, new ordered pair (𝟏, 𝟏) is NOT present in 𝑅.
Hence, the given relation is NOT transitive.
(1, 9) ∈ 𝑅 and (9, 1) ∈ 𝑅. But, 1 ≠ 9. Hence, the given relation is NOT anti-symmetric.

Question (FEB 2024 – 03 Marks)

Define equivalence relation. Let 𝑋 = {1, 2, 3, 4, 5}, 𝑅 = {⟨𝑥, 𝑦⟩ / 𝑥 is divisible by 𝑦}. Check
whether the relation is an equivalence relation.
Answer
The relation 𝑅 defined on set 𝑋 is called equivalence relation if
1) 𝑅 is reflexive
2) 𝑅 is symmetric
3) 𝑅 is transitive
Let 𝑋 = {1, 2, 3, 4, 5} be the given set.
Since the given set 𝑋 is finite set with five elements, first we write all possible ordered pairs
(𝑥, 𝑦) such that 𝑥 is divisible by 𝑦 where 𝑥 ∈ 𝑋 and 𝑦 ∈ 𝑋.
Since every number is divisible by itself, we have (1, 1) ∈ 𝑅 , (2, 2) ∈ 𝑅 , (3, 3) ∈ 𝑅 ,
(4, 4) ∈ 𝑅 and (5, 5) ∈ 𝑅.
Since every number is divisible by 1, we have (2, 1) ∈ 𝑅 , (3, 1) ∈ 𝑅 , (4, 1) ∈ 𝑅 and
(5, 1) ∈ 𝑅.
Since 4 is divisible by 2, we have (4, 2) ∈ 𝑅.
Hence, 𝑅 = {(1, 1), (2, 1), (2, 2), (3, 1), (3, 3), (4, 1), (4, 2), (4, 4), (5, 1), (5, 5)}.

Here (2, 1) ∈ 𝑅 but (1, 2) ∉ 𝑅. Hence, the given relation is NOT symmetric. Therefore, the
given relation is NOT equivalence relation.

Important note
In above example, 𝑥 is divisible by 𝑦 if 𝑥/𝑦 is an integer. For example, 3 is divisible by 6 is
NOT true because 3/6 = 0.5 and note that 0.5 is not an integer. For example, 6 is divisible by
3 is true because 6/3 = 2 and note that 2 is an integer.

Question (FEB 2021 – 03 Marks)

Let 𝑁 be the set of natural numbers. Let 𝑅 be a relation in 𝑁 defined by 𝑥𝑅𝑦 if and only if
𝑥 + 3𝑦 = 12. Examine the relation for (i) reflexive (ii) symmetric (iii) transitive.
Answer
Let 𝑁 = {1, 2, 3, 4, 5, 6, … } be the set of natural numbers. Here 𝑁 is infinite set.
Let 𝑅 be a relation in 𝑁 defined by 𝑥𝑅𝑦 if and only if 𝑥 + 3𝑦 = 12 where 𝑥 ∈ 𝑁 and 𝑦 ∈ 𝑁.
Let 𝑥 = 3 and 𝑦 = 3. Then, 𝑥 + 3𝑦 = 3 + 3(3) = 12. So, (3, 3) ∈ 𝑅.
Let 𝑥 = 6 and 𝑦 = 2. Then, 𝑥 + 3𝑦 = 6 + 3(2) = 12. So, (6, 2) ∈ 𝑅.
Let 𝑥 = 9 and 𝑦 = 1. Then, 𝑥 + 3𝑦 = 9 + 3(1) = 12. So, (9, 1) ∈ 𝑅.
Hence, 𝑅 = {(3, 3), (6, 2), (9, 1)}.
 1) For 1 ∈ 𝑁 , the ordered pair (1, 1) ∉ 𝑅. Hence, the given relation is NOT reflexive.
2) (6, 2) ∈ 𝑅 but (2, 6) ∉ 𝑅. Hence, the given relation is NOT symmetric.
3) For (𝒙, 𝑦) ∈ 𝑅 and (𝑦, 𝒛) ∈ 𝑅, if (𝒙, 𝒛) ∈ 𝑅 then the relation is transitive.
Here we don’t have such pairs (𝒙, 𝑦) and (𝑦, 𝒛) in 𝑅 to check the transitivity. So, the
given relation is transitive (trivially).

Question (OCT 2020 – 03 Marks)

Show that the relation 𝑥 ≡ 𝑦 (mod 𝑚) defined on the set of integers 𝐼 is an equivalence relation.
Answer
The notation 𝑥 ≡ 𝑦 (mod 𝑚) means that 𝑥 − 𝑦 is divisible by 𝑚. OR
The notation 𝑥 ≡ 𝑦 (mod 𝑚) means that 𝑚 divides 𝑥 − 𝑦. OR
The notation 𝑥 ≡ 𝑦 (mod 𝑚) means that 𝑥 is congruent to 𝑦 modulo 𝑚.
That is, 𝑅 = {⟨𝑥, 𝑦⟩ | 𝑥 − 𝑦 is divisible by 𝑚}. That is, (𝑥, 𝑦) ∈ 𝑅 if 𝑥 − 𝑦 is divisible by 𝑚.
Let 𝐼 = {… , −3, −2, −1, 0, 1, 2, 3, … } be the set of integers. Here 𝐼 is infinite set.
1) 𝑥 − 𝑥 = 0 and note that 0 is divisible by 𝑚 (any number).
So, for every 𝑥 in the given set 𝐼, we have 𝑥 − 𝑥 is divisible by 𝑚.
Hence, (𝑥, 𝑥) ∈ 𝑅 for every 𝑥 in 𝐼.
So, the given relation is reflexive.
2) Let (𝑥, 𝑦) ∈ 𝑅
⟹ 𝑥 − 𝑦 is divisible by 𝑚
⟹ 𝑥 − 𝑦 = 𝑚𝑘 for some integer 𝑘
⟹ 𝑦 − 𝑥 = −𝑚𝑘
⟹ 𝑦 − 𝑥 is divisible by 𝑚
⟹ (𝑦, 𝑥) ∈ 𝑅
So, the given relation is symmetric.
3) Let (𝑥, 𝑦) ∈ 𝑅 and (𝑦, 𝑧) ∈ 𝑅
⟹ 𝑥 − 𝑦 is divisible by 𝑚 and 𝑦 − 𝑧 is divisible by 𝑚
⟹ 𝑥 − 𝑦 = 𝑚𝑘 and 𝑦 − 𝑧 = 𝑚𝑙 for some integers 𝑘 , 𝑙
⟹ (𝑥 − 𝑦) + (𝑦 − 𝑧) = 𝑚𝑘 + 𝑚𝑙
⟹ 𝑥 − 𝑧 = 𝑚(𝑘 + 𝑙)
⟹ 𝑥 − 𝑧 = 𝑚𝑛 for some integer 𝑛
⟹ 𝑥 − 𝑧 is divisible by 𝑚
 ⟹ (𝑥, 𝑧) ∈ 𝑅
So, the given relation is transitive.

Since the given relation is reflexive, symmetric and transitive, it is an equivalence relation on
the given set 𝐼.

Question (FEB 2024 – 04 Marks)

Determine the relation ∥ (parallel) on the set 𝐿 of lines in the plane are reflexive, symmetric,
anti-symmetric, transitive, irreflexive.
Answer
Let 𝐿 = {𝑙 , 𝑚 , 𝑛 , … } be the set of lines in the plane.
The notation ∥ means that “parallel” relation. That is, 𝑅 = {(𝑙, 𝑚) ∶ line 𝑙 is parallel to line 𝑚}.
That is, 𝑅 = {(𝑙, 𝑚) ∶ 𝑙 ∥ 𝑚}.
1) Note that every line is parallel to itself. That is, for every 𝑙 ∈ 𝐿, the ordered pair (𝑙, 𝑙)
in 𝑅. Hence, the given relation is reflexive.
2) If one line is parallel to second line then we can say that second line is also parallel to
the first line. That is, if 𝑙 ∥ 𝑚 then 𝑚 ∥ 𝑙. That is, if (𝑙, 𝑚) ∈ 𝑅 then (𝑚, 𝑙) is also in
𝑅. Hence, the given relation is symmetric.
3) If line 𝑙 is parallel to line 𝑚 then we can say that line 𝑚 is also parallel to line 𝑙. Hence,
the given relation is NOT anti-symmetric.
4) If line 𝑙 is parallel to line 𝑚 and line 𝑚 is parallel to line 𝑛 then we can say that line 𝑙
is also parallel to line 𝑛. That is, if 𝒍 ∥ 𝑚 and 𝑚 ∥ 𝒏 then we have 𝒍 ∥ 𝒏. Hence, the
given relation is transitive.
5) Note that every line is parallel to itself. That is, for every 𝑙 ∈ 𝐿, the ordered pair (𝑙, 𝑙)
in 𝑅. Hence, the given relation is NOT irreflexive.

Matrix representation of relation (Relation Matrix)

Let 𝐴 be the set with 𝑚 elements and 𝐵 be the set with 𝑛 elements. Let 𝑅 be the relation from
𝐴 to 𝐵. Then, the relation matrix is denoted by 𝑀𝑅 and the order of matrix is 𝑚 × 𝑛.

If (𝑥, 𝑦) ∈ 𝑅, then it can be represented by “ 𝟏 ” as the entry of the matrix.

If (𝑥, 𝑦) ∉ 𝑅, then it can be represented by “ 𝟎 ” as the entry of the matrix.

In other words, if 𝑥 is related to 𝑦 then it can be represented by 𝟏, otherwise, it can be

represented by 0 as the entry of the matrix.
In other words, if 𝒙𝑹𝒚 then it can be represented by 𝟏, otherwise, it can be represented by 0
as the entry of the matrix.

For example,

1) Let us consider 𝐴 = {1, 2, 3} and 𝐵 = {𝑎, 𝑏, 𝑐}. Let 𝑅 be the relation from 𝐴 to 𝐵
where

then the relation matrix is given by

2) Let 𝑅 be the relation from 𝐴 to 𝐴 defined on set 𝐴 = {1, 3, 5, 6} where

then the relation matrix is given by

Question (JULY 2022 – 03 Marks)

Suppose that the relations 𝑅1 and 𝑅2 on a set 𝐴 are represented by the matrices
1 0 1 1 0 1
𝑀𝑅1 = [1 0 0] and 𝑀𝑅2 = [0 1 1].
0 1 0 1 0 0
What are the matrices representing 𝑅1 ∪ 𝑅2 and 𝑅1 ∩ 𝑅2 ?

Answer

Let 𝑅1 and 𝑅2 be two relations defined on a set 𝐴 = {𝑎, 𝑏, 𝑐}.

From the given matrix 𝑀𝑅1 , we have 𝑅1 = {(𝑎, 𝑎), (𝑎, 𝑐), (𝑏, 𝑎), (𝑐, 𝑏)}.

From the given matrix 𝑀𝑅2 , we have 𝑅2 = {(𝑎, 𝑎), (𝑎, 𝑐), (𝑏, 𝑏), (𝑏, 𝑐), (𝑐, 𝑎)}.

The union of two relations 𝑅1 and 𝑅2 can be defined as the set containing all ordered pairs
(𝑥, 𝑦) that are either present in relation 𝑅1 or in relation 𝑅2 , or in both. Hence,

𝑅1 ∪ 𝑅2 = {(𝑎, 𝑎), (𝑎, 𝑐), (𝑏, 𝑎), (𝑏, 𝑏), (𝑏, 𝑐), (𝑐, 𝑎), (𝑐, 𝑏)}

Then, the matrix representing 𝑅1 ∪ 𝑅2 is given by

𝟏 0 𝟏
𝑀𝑅1∪ 𝑅2 = [𝟏 𝟏 𝟏]
𝟏 𝟏 0
The intersection of two relations 𝑅1 and 𝑅2 can be defined as the set containing all ordered
pairs (𝑥, 𝑦) that are common to both relations. It is denoted by 𝑅1 ∩ 𝑅2 . Hence,

𝑅1 ∩ 𝑅2 = {(𝑎, 𝑎), (𝑎, 𝑐)}

Then, the matrix representing 𝑅1 ∩ 𝑅2 is given by

𝟏 0 𝟏
𝑀𝑅1∩ 𝑅2 = [0 0 0]
0 0 0

Graphical representation of relation (Graph / Directed graph / Digraph of a relation)

Let 𝑅 be the relation defined on a set 𝐴.

1) Every element of 𝐴 can be represented by a point (or node or vertex).

2) If 𝑥 is related to 𝑥 then it can be represented by a loop (or self-loop).
3) If 𝑥𝑅𝑦 then it can be represented by an edge (directed edge or arc) from 𝑥 to 𝑦. In
other words, if (𝑥, 𝑦) ∈ 𝑅 then there is an edge (directed edge or arc) from 𝑥 to 𝑦.
In other words, if 𝑥 is related to 𝑦 then there is an edge (directed edge or arc) from 𝑥
to 𝑦.
For example,

1) Let 𝐴 = {2, 4, 6} and 𝐵 = {4, 6, 8} be two given sets. Let 𝑅 be the relation from 𝐴 to
𝐵 where 𝑅 = {(2,4), (2,6), (2,8), (4,4), (4,8), (6,6)}. Then, the digraph of a relation
𝑅 is given by

Explanation
Since (2,4) ∈ 𝑅, there is directed edge from a vertex 2 to a vertex 4.
Since (2,6) ∈ 𝑅, there is directed edge from 2 to 6.
Since (2,8) ∈ 𝑅, there is directed edge from 2 to 8.
Since (4,4) ∈ 𝑅, there is a loop (or self-loop) at vertex 4.
Since (4,8) ∈ 𝑅, there is directed edge from 4 to 8.
Since (6,6) ∈ 𝑅, there is a loop (or self-loop) at vertex 6.

2) Let 𝐴 = {𝑎, 𝑏, 𝑐} be the given set. Let 𝑅 be the relation from 𝐴 to 𝐴 where
𝑅 = {(𝑎, 𝑎), (𝑎, 𝑏), (𝑏, 𝑎), (𝑏, 𝑏), (𝑏, 𝑐), (𝑐, 𝑎), (𝑐, 𝑐)}. Then, the digraph of a relation
𝑅 is given by

Question (FEB 2024 – 03 Marks)

Let 𝑋 = {1, 2, 3, 4} and 𝑅 = {⟨𝑥, 𝑦⟩ / 𝑥 > 𝑦}. Draw the graph of 𝑅 and also give its matrix.

Answer

Given that 𝑥𝑅𝑦 if 𝑥 > 𝑦. That is, 𝑥 is related to 𝑦 if 𝑥 is strictly greater than 𝑦 where 𝑥 is first
element and 𝑦 is second element of ordered pair.

Since 2 > 1, we have (2, 1) ∈ 𝑅.

Since 3 > 1, we have (3,1) ∈ 𝑅.
Since 3 > 2, we have (3,2) ∈ 𝑅.
Since 4 > 1, we have (4,1) ∈ 𝑅.
Since 4 > 2, we have (4,2) ∈ 𝑅.
Since 4 > 3, we have (4,3) ∈ 𝑅.
Hence, 𝑅 = {(2, 1), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3)}. The matrix of 𝑅 is given by

0 0 0 0
𝟏 0 0 0
𝑴𝑹 = [ ]
𝟏 𝟏 0 0
𝟏 𝟏 𝟏 0
The graph of 𝑅 is given by

Question (SEP 2021 – 04 Marks) (DEC 2021 – 07 Marks)

Let 𝑋 = {1, 2, 3, … , 7} and 𝑅 = {⟨𝑥, 𝑦⟩ | 𝑥 − 𝑦 is divisible by 3}. Show that 𝑅 is an equivalence
relation on 𝑋. Draw the graph of 𝑅.
Answer
Method 1
Let 𝑋 = {1, 2, 3, … , 7} be the given finite set.
First, we need to write all possible ordered pairs (𝑥, 𝑦) such that 𝑥 − 𝑦 is divisible by 3 where
𝑥 ∈ 𝑋 and 𝑦 ∈ 𝑋.
Let 𝑥 = 1 and 𝑦 = 4. Then, 𝑥 − 𝑦 = 1 − 4 = −3 is divisible by 3. So, (1, 4) ∈ 𝑅. Similarly,
(4, 1) ∈ 𝑅.
Let 𝑥 = 1 and 𝑦 = 7. Then, 𝑥 − 𝑦 = 1 − 7 = −6 is divisible by 3. So, (1, 7) ∈ 𝑅. Similarly,
(7, 1) ∈ 𝑅.
Let 𝑥 = 2 and 𝑦 = 5. Then, 𝑥 − 𝑦 = 2 − 5 = −3 is divisible by 3. So, (2, 5) ∈ 𝑅. Similarly,
(5, 2) ∈ 𝑅.
Let 𝑥 = 3 and 𝑦 = 6. Then, 𝑥 − 𝑦 = 3 − 6 = −3 is divisible by 3. So, (3, 6) ∈ 𝑅. Similarly,
(6, 3) ∈ 𝑅.
Let 𝑥 = 4 and 𝑦 = 7. Then, 𝑥 − 𝑦 = 4 − 7 = −3 is divisible by 3. So, (4, 7) ∈ 𝑅. Similarly,
(7, 4) ∈ 𝑅.
Let 𝑥 = 1 and 𝑦 = 1. Then, 𝑥 − 𝑦 = 1 − 1 = 0 is divisible by 3. So, (1, 1) ∈ 𝑅. Similarly,
(2, 2) ∈ 𝑅 , (3, 3) ∈ 𝑅 , (4, 4) ∈ 𝑅 , (5, 5) ∈ 𝑅 , (6, 6) ∈ 𝑅 and (7, 7) ∈ 𝑅.
Hence, 𝑅 = {(1, 1), (1, 4), (1, 7), (2, 2), (2, 5), (3, 3), (3, 6), (4, 1), (4, 4), (4, 7), (5, 2), (5, 5),
(6, 3), (6, 6), (7, 1), (7, 4), (7, 7)}
For 1 ∈ 𝑋 , the ordered pair (1, 1) ∈ 𝑅. Similarly, for every element 𝑥 in given set 𝑋, the
ordered pair (𝑥, 𝑥) is present in 𝑅. Hence, the given relation is reflexive.
For every ordered pair (𝑥, 𝑦) in 𝑅, the ordered pair (𝑦, 𝑥) is also present in 𝑅 where 𝑥 ∈ 𝑋 and
𝑦 ∈ 𝑋. Hence, the given relation is symmetric.
Let (𝟏, 4) ∈ 𝑅 and (4, 𝟕) ∈ 𝑅. Then, new ordered pair (𝟏, 𝟕) is also present in 𝑅. Similarly, for
every ordered pair (𝒙, 𝑦) and (𝑦, 𝒛) in 𝑅, the new ordered pair (𝒙, 𝒛) is also present in 𝑅. Hence,
the given relation is transitive.
Since the given relation is reflexive, symmetric and transitive, it is an equivalence relation on
the given set 𝑋.
Method 2
Let 𝑋 = {1, 2, 3, … , 7} be the given finite set.
Let 𝑅 = {⟨𝑥, 𝑦⟩ | 𝑥 − 𝑦 is divisible by 3} be the given relation. That is, (𝑥, 𝑦) ∈ 𝑅 if 𝑥 − 𝑦 is
divisible by 3.

1) 𝑥 − 𝑥 = 0 and note that 0 is divisible by 3.

So, for every 𝑥 in the given set 𝑋, we have 𝑥 − 𝑥 is divisible by 3.
Hence, (𝑥, 𝑥) ∈ 𝑅 for every 𝑥 in 𝑋.
So, the given relation is reflexive.
2) Let (𝑥, 𝑦) ∈ 𝑅
⟹ 𝑥 − 𝑦 is divisible by 3
⟹ 𝑥 − 𝑦 = 3𝑘 for some integer 𝑘
⟹ 𝑦 − 𝑥 = −3𝑘
⟹ 𝑦 − 𝑥 is divisible by 3
⟹ (𝑦, 𝑥) ∈ 𝑅
So, the given relation is symmetric.
3) Let (𝑥, 𝑦) ∈ 𝑅 and (𝑦, 𝑧) ∈ 𝑅
⟹ 𝑥 − 𝑦 is divisible by 3 and 𝑦 − 𝑧 is divisible by 3
⟹ 𝑥 − 𝑦 = 3𝑘 and 𝑦 − 𝑧 = 3𝑚 for some integers 𝑚 , 𝑘
⟹ (𝑥 − 𝑦) + (𝑦 − 𝑧) = 3𝑘 + 3𝑚
⟹ 𝑥 − 𝑧 = 3(𝑘 + 𝑚)
⟹ 𝑥 − 𝑧 = 3𝑛 for some integer 𝑛
 ⟹ 𝑥 − 𝑧 is divisible by 3
⟹ (𝑥, 𝑧) ∈ 𝑅
So, the given relation is transitive.

Since the given relation is reflexive, symmetric and transitive, it is an equivalence relation on
the given set 𝑋.

The graph of 𝑅 is given by

Question (JULY 2022 – 04 Marks)

Determine whether the relation with the directed graph shown is an equivalence relation.

Answer
Method 1

Here the relation is defined on the set {𝑎, 𝑏, 𝑐, 𝑑}.

1) Since there is a loop (or self-loop) at every vertex, the relation is reflexive.
2) Note that there is directed edge from 𝑎 to 𝑏. Also, there is directed edge from 𝑏 to 𝑎.
Note that there is directed edge from 𝑏 to 𝑐. Also, there is directed edge from 𝑐 to 𝑏.
Note that there is directed edge from 𝑐 to 𝑑. Also, there is directed edge from 𝑑 to 𝑐.
Note that there is directed edge from 𝑑 to 𝑎. Also, there is directed edge from 𝑎 to 𝑑.
Hence, the relation is symmetric.
 3) Note that there is directed edge from 𝑎 to 𝑏 and from 𝑏 to 𝑐 but there is no directed
edge from 𝑎 to 𝑐. Hence, the relation is NOT transitive.
Since the relation is NOT transitive, it is NOT an equivalence relation.
Method 2

Here the relation is defined on the set {𝑎, 𝑏, 𝑐, 𝑑}. Write all ordered pairs of relation 𝑅 from
the given directed graph.

𝑅 = {(𝑎, 𝑎), (𝑎, 𝑏), (𝑎, 𝑑), (𝑏, 𝑎), (𝑏, 𝑏), (𝑏, 𝑐), (𝑐, 𝑏), (𝑐, 𝑐), (𝑐, 𝑑), (𝑑, 𝑎), (𝑑, 𝑐), (𝑑, 𝑑)}

1) Since (𝑎, 𝑎) ∈ 𝑅 , (𝑏, 𝑏) ∈ 𝑅 , (𝑐, 𝑐) ∈ 𝑅 and (𝑑, 𝑑) ∈ 𝑅, the relation is reflexive.

2) Note that (𝑎, 𝑏) ∈ 𝑅 and (𝑏, 𝑎) is also in 𝑅.
Note that (𝑎, 𝑑) ∈ 𝑅 and (𝑑, 𝑎) is also in 𝑅.
Note that (𝑏, 𝑐) ∈ 𝑅 and (𝑐, 𝑏) is also in 𝑅.
Note that (𝑐, 𝑑) ∈ 𝑅 and (𝑑, 𝑐) is also in 𝑅.
Hence, the relation is symmetric.
3) Note that (𝒂, 𝑏) ∈ 𝑅 and (𝑏, 𝒄) ∈ 𝑅 but (𝒂, 𝒄) ∉ 𝑅. Hence, the relation is NOT
transitive.
Since the relation is NOT transitive, it is NOT an equivalence relation.
Closure of a relation
1) Reflexive closure
The reflexive closure of a relation (or binary relation) 𝑅 on set 𝐴 is defined as the
smallest reflexive relation on 𝐴 that contains 𝑅. It is denoted by 𝑅 𝑟 or 𝑅𝑟 or 𝑟(𝑅) or
𝑟𝑒𝑓𝑐(𝑅).
In other words, the reflexive closure is obtained by adding the ordered pairs (𝑥, 𝑥) to
the original relation 𝑅 for all 𝑥 ∈ 𝐴.
For example,
Consider the relation 𝑅 = {(1,2), (2,4), (3,3), (4,2)} on the set 𝐴 = {1,2,3,4}.
Here 𝑅 is not reflexive. To make it reflexive, we add all missing elements
(𝟏, 𝟏), (𝟐, 𝟐), (𝟒, 𝟒). Hence, the reflexive closure is
𝑟(𝑅) = {(𝟏, 𝟏), (1,2), (𝟐, 𝟐), (2,4), (3,3), (4,2), (𝟒, 𝟒)}.

2) Symmetric closure
The symmetric closure of a relation (or binary relation) 𝑅 on set 𝐴 is defined as the
smallest symmetric relation on 𝐴 that contains 𝑅. It is denoted by 𝑅 𝑠 or 𝑅𝑠 or 𝑠(𝑅) or
𝑠𝑦𝑚𝑐(𝑅).
In other words, the symmetric closure is obtained by adding the ordered pairs (𝑦, 𝑥) to
the original relation 𝑅 for each (𝑥, 𝑦) in 𝑅.
 For example,
Consider the relation 𝑅 = {(1,2), (1,3), (2,2), (2,4), (4,3)} on the set 𝐴 = {1,2,3,4}.
Here 𝑅 is not symmetric. To make it symmetric, we add all missing elements
(𝟐, 𝟏), (𝟑, 𝟏), (𝟒, 𝟐), (𝟑, 𝟒). Hence, the symmetric closure is
𝑠(𝑅) = {(1,2), (1,3), (𝟐, 𝟏), (2,2), (2,4), (𝟑, 𝟏), (𝟑, 𝟒), (𝟒, 𝟐), (4,3)}.

3) Transitive closure
The transitive closure of a relation (or binary relation) 𝑅 on set 𝐴 is defined as the
smallest transitive relation on 𝐴 that contains 𝑅. It is denoted by 𝑅 𝑡 or 𝑅𝑡 or 𝑡(𝑅) or
𝑡𝑟(𝑅) or 𝑅 ∗ .
For example,
1) Consider the relation 𝑅 = {(1,2), (2,2), (2,3), (3,3)} on the set 𝐴 = {1,2,3}.
(𝟏, 2) ∈ 𝑅 and (2, 𝟑) ∈ 𝑅. But, (𝟏, 𝟑) ∉ 𝑅.
Here 𝑅 is not transitive. To make it transitive, we add missing element (𝟏, 𝟑).
Hence, the transitive closure is
𝑡(𝑅) = {(1,2), (𝟏, 𝟑), (2,2), (2,3), (3,3)}.

2) Consider the relation 𝑅 = {(1,2), (2,3), (3,2), (4,1)} on the set 𝐴 = {1,2,3,4}.
(𝟏, 2) ∈ 𝑅 and (2, 𝟑) ∈ 𝑅. But, (𝟏, 𝟑) ∉ 𝑅.
(𝟐, 3) ∈ 𝑅 and (3, 𝟐) ∈ 𝑅. But, (𝟐, 𝟐) ∉ 𝑅.
(𝟑, 2) ∈ 𝑅 and (2, 𝟑) ∈ 𝑅. But, (𝟑, 𝟑) ∉ 𝑅.
(𝟒, 1) ∈ 𝑅 and (1, 𝟐) ∈ 𝑅. But, (𝟒, 𝟐) ∉ 𝑅.
Here 𝑅 is not transitive. To make it transitive, we add all missing elements (𝟏, 𝟑),
(𝟐, 𝟐), (𝟑, 𝟑), (𝟒, 𝟐).
Hence, the transitive closure would be
𝑡(𝑅) = {(1,2), (𝟏, 𝟑), (𝟐, 𝟐), (2,3), (3,2), (𝟑, 𝟑), (4,1), (𝟒, 𝟐)}.
Note that the obtained relation is NOT transitive because (𝟒, 2) ∈ 𝑅 and (2, 𝟑) ∈
𝑅. But, (𝟒, 𝟑) ∉ 𝑅. Hence, this is NOT correct answer of transitive closure. So,
again we add missing element (𝟒, 𝟑). Hence, the transitive closure is
𝑡(𝑅) = {(1,2), (𝟏, 𝟑), (𝟐, 𝟐), (2,3), (3,2), (𝟑, 𝟑), (4,1), (𝟒, 𝟐), (𝟒, 𝟑)}. This is
correct answer of transitive closure.
Question (SEP 2021 – 04 Marks)
Find the transitive closure of 𝑅 = {(1,2), (3,4), (4,5), (4,1), (1,1)} where 𝐴 = {1, 2, 3, 4, 5}.
Answer
(𝟑, 4) ∈ 𝑅 and (4, 𝟓) ∈ 𝑅. But, (𝟑, 𝟓) ∉ 𝑅.

(𝟑, 4) ∈ 𝑅 and (4, 𝟏) ∈ 𝑅. But, (𝟑, 𝟏) ∉ 𝑅.

(𝟒, 1) ∈ 𝑅 and (1, 𝟐) ∈ 𝑅. But, (𝟒, 𝟐) ∉ 𝑅.

Here the given relation is NOT transitive. To make it transitive, we add all missing elements
(𝟑, 𝟓), (𝟑, 𝟏) and (𝟒, 𝟐). Hence, the transitive closure of 𝑅 would be

𝑅 ∗ = {(1,2), (𝟑, 𝟏), (3,4), (𝟑, 𝟓), (𝟒, 𝟐), (4,5), (4,1), (1,1)}.

Note that the obtained relation is NOT transitive because (𝟑, 1) ∈ 𝑅 and (1, 𝟐) ∈ 𝑅. But,
(𝟑, 𝟐) ∉ 𝑅. Hence, this is NOT correct answer of transitive closure. So, again we add
missing element (𝟑, 𝟐). Hence, the transitive closure of 𝑅 is

𝑅 ∗ = {(1,1), (1,2), (𝟑, 𝟏), (𝟑, 𝟐), (3,4), (𝟑, 𝟓), (4,1), (𝟒, 𝟐), (4,5), }. This is correct answer
of transitive closure.

Warshall’s Algorithm to find transitive closure

Warshall’s algorithm is an efficient method to find the transitive closure of a relation.

Let 𝑋 be the set with 𝑛 elements and 𝑅 be the relation defined on 𝑋. First, we will represent
the relation 𝑅 in matrix form.
Step 1

Consider first column 𝐶1 and first row 𝑅1 of the matrix.

Write all positions where 1 is present in first column 𝐶1 . Also, write all positions where 1 is
present in first row 𝑅1 .

Then, take the cross product of 𝐶1 and 𝑅1 . That is, find 𝐶1 × 𝑅1 .

Every ordered pair (𝑥, 𝑦) of 𝐶1 × 𝑅1 can be represented by “ 𝟏 ” as the entry of the matrix.
That is, there are new additions in the matrix if there is any ordered pair (𝑥, 𝑦) in 𝐶1 × 𝑅1 .

Note that there is no new addition if 𝐶1 × 𝑅1 is an empty set.

Step 2

Consider second column 𝐶2 and second row 𝑅2 of new matrix.

Write all positions where 1 is present in second column 𝐶2 . Also, write all positions where 1
is present in second row 𝑅2 .

Then, take the cross product of 𝐶2 and 𝑅2 . That is, find 𝐶2 × 𝑅2 .

Every ordered pair (𝑥, 𝑦) of 𝐶2 × 𝑅2 can be represented by “ 𝟏 ” as the entry of the matrix.
That is, there are new additions in the matrix if there is any ordered pair (𝑥, 𝑦) in 𝐶2 × 𝑅2 .

Note that there is no new addition if 𝐶2 × 𝑅2 is an empty set.

Step 3

Continue the same process with third column 𝐶3 and third row 𝑅3 of new matrix.

If there are 𝒏 elements in set 𝑋 then 𝒏 steps are required in order to find the transitive
closure of relation 𝑅.

Question
Find transitive closure by Warshall’s Algorithm if 𝐴 = {1, 2, 3} and 𝑅 = {(1, 2), (2, 3), (3, 1)}.
Answer
Let 𝑅 = {(1, 2), (2, 3), (3, 1)} be the relation on 𝐴 = {1, 2, 3}. First, represent the relation 𝑅 in
the matrix form.

Step 1
Write all positions where 1 is present in first column 𝐶1 . We can see that in the first column,
1 is present at position “ 3 ”. Therefore, we have

Write all positions where 1 is present in first row 𝑅1 . We can see that in the first row, 1 is
present at position “ 2 ”. Therefore, we have

The cross product of 𝐶1 and 𝑅1 is 𝐶1 × 𝑅1 = {(3, 2)}.

The new ordered pair (3, 2) can be represented by 1 and this is new addition (orange 1) in the
matrix.
Step 2
Write all positions where 1 is present in second column 𝐶2 . We can see that in the second
column, 1 is present at positions “ 1 ” and “ 3 ”. Therefore, we have

Write all positions where 1 is present in second row 𝑅2 . We can see that in the second row, 1
is present at position “ 3 ”. Therefore, we have

The cross product of 𝐶2 and 𝑅2 is 𝐶2 × 𝑅2 = {(1, 3), (3, 3)}.

The new ordered pairs (1, 3) and (3, 3) can be represented by 1 and these are new additions
(maroon 1) in the matrix.

Step 3
Write all positions where 1 is present in third column 𝐶3 . We can see that in the third column,
1 is present at positions “ 1 ” , “ 2 ” and “ 3 ”. Therefore, we have

Write all positions where 1 is present in third row 𝑅3 . We can see that in the third row, 1 is
present at position “ 1 ” , “ 2 ” and “ 3 ”. Therefore, we have

The cross product of 𝐶3 and 𝑅3 is

𝐶3 × 𝑅3 = {(1,1), (1,2), (1,3), (2,1), (2,2), (2,3), (3,1), (3,2), (3,3)}.
The new ordered pairs (1, 1), (2, 1) and (2, 2) can be represented by 1 and these are new
additions (cyan 1) in the matrix.

Since there are 𝟑 elements in set 𝐴, 𝟑 steps are required in order to find the transitive closure
of relation 𝑅. Hence, the transitive closure is
𝑅 ∗ = {(1,1), (1,2), (1,3), (2,1), (2,2), (2,3), (3,1), (3,2), (3,3)}
Question
Find transitive closure by Warshall’s Algorithm if 𝐴 = {1, 2, 3} and 𝑅 = {(1, 2), (2, 3), (3, 3)}.
Answer
Let 𝑅 = {(1, 2), (2, 3), (3, 3)} be the relation on 𝐴 = {1, 2, 3}. First, represent the relation 𝑅 in
the matrix form.

Step 1
Write all positions where 1 is present in first column 𝐶1 . We can see that in the first column,
1 is NOT present anywhere. Therefore, 𝐶1 is an empty set. That is,

Write all positions where 1 is present in first row 𝑅1 . We can see that in the first row, 1 is
present at position “ 2 ”. Therefore, we have

The cross product of 𝐶1 and 𝑅1 is 𝐶1 × 𝑅1 = ∅. That is, 𝐶1 × 𝑅1 is an empty set. Hence, there
is NO new addition.

Step 2
Write all positions where 1 is present in second column 𝐶2 . We can see that in the second
column, 1 is present at position “ 1 ”. Therefore, we have

Write all positions where 1 is present in second row 𝑅2 . We can see that in the second row, 1
is present at position “ 3 ”. Therefore, we have

The cross product of 𝐶2 and 𝑅2 is 𝐶2 × 𝑅2 = {(1, 3)}.

The new ordered pair (1, 3) can be represented by 1 and this is new addition (maroon 1) in
the matrix.

Step 3
Write all positions where 1 is present in third column 𝐶3 . We can see that in the third column,
1 is present at positions “ 1 ” , “ 2 ” and “ 3 ”. Therefore, we have

Write all positions where 1 is present in third row 𝑅3 . We can see that in the third row, 1 is
present at position “ 3 ”. Therefore, we have

The cross product of 𝐶3 and 𝑅3 is 𝐶3 × 𝑅3 = {(1, 3), (2, 3), (3, 3)}.
The new ordered pairs (1, 3), (2, 3) and (3, 3) are already represented by 1 in the previous
matrix, so there is NO new addition.

Since there are 𝟑 elements in set 𝐴, 𝟑 steps are required in order to find the transitive closure
of relation 𝑅. Hence, the transitive closure is
𝑅 ∗ = {(1,2), (1,3), (2,3), (3,3)}
Question (JULY 2022 – 04 Marks)
Use Warshall’s Algorithm to find the transitive closure of the relation
𝑅 = {(1,4) , (2,1) , (2,3) , (3,1) , (3,4), (4,3)} on {1, 2, 3, 4}.
Answer
Let 𝑅 = {(1,4) , (2,1) , (2,3) , (3,1) , (3,4), (4,3)} be the relation on 𝐴 = {1, 2, 3, 4}. First,
represent the relation 𝑅 in the matrix form.
Step 1
Write all positions where 1 is present in first column 𝐶1 . We can see that in the first column,
1 is present at positions “ 2 ” and “ 3 ”. Therefore, we have

Write all positions where 1 is present in first row 𝑅1 . We can see that in the first row, 1 is
present at position “ 4 ”. Therefore, we have

The cross product of 𝐶1 and 𝑅1 is 𝐶1 × 𝑅1 = {(2, 4), (3, 4)}.

The new ordered pair (2, 4) can be represented by 1 and this is new addition (orange 1) in the
previous matrix. Note that the ordered pair (3, 4) is already represented by 1 in the previous
matrix.

Step 2
Write all positions where 1 is present in second column 𝐶2 . We can see that in the second
column, 1 is NOT present anywhere. Therefore, 𝐶2 is an empty set. That is,

Since 𝐶2 = ∅, the cross product of 𝐶2 and 𝑅2 is 𝐶2 × 𝑅2 = ∅. That is, 𝐶2 × 𝑅2 is an empty

set. Hence, there is NO new addition. Hence, the new matrix is same as the previous matrix.
That is, 𝑀𝑅2 = 𝑀𝑅1 .
Step 3
Write all positions where 1 is present in third column 𝐶3 . We can see that in the third column,
1 is present at positions “ 2 ” and “ 4 ”. Therefore, we have

Write all positions where 1 is present in third row 𝑅3 . We can see that in the third row, 1 is
present at positions “ 1 ” and “ 4 ”. Therefore, we have

The cross product of 𝐶3 and 𝑅3 is 𝐶3 × 𝑅3 = {(2, 1), (2, 4), (4, 1), (4, 4)}.
The new ordered pairs (4, 1) and (4, 4) can be represented by 1 and these are new additions
(maroon 1) in the previous matrix. Note that the ordered pairs (2, 1) and (2, 4) are already
represented by 1 in the previous matrix.

Step 4
Write all positions where 1 is present in fourth column 𝐶4 . We can see that in the fourth
column, 1 is present at positions “ 1 ” , “ 2 ” , “ 3 ” and “ 4 ”. Therefore, we have

Write all positions where 1 is present in fourth row 𝑅4 . We can see that in the fourth row, 1 is
present at positions “ 1 ” , “ 3 ” and “ 4 ”. Therefore, we have

The cross product of 𝐶4 and 𝑅4 is

𝐶4 × 𝑅4 = {(1,1), (1,3), (1,4), (2,1), (2,3), (2,4), (3,1), (3,3), (3,4), (4,1), (4,3), (4,4)}.
The new ordered pairs (1, 1), (1, 3) and (3, 3) can be represented by 1 and these are new
additions (cyan 1) in the previous matrix. Note that the other ordered pairs are already
represented by 1 in the previous matrix.

Since there are 𝟒 elements in set 𝐴, 𝟒 steps are required in order to find the transitive closure
of relation 𝑅. Hence, the transitive closure is
𝑅 ∗ = {(1,1), (1,3), (1,4), (2,1), (2,3), (2,4), (3,1), (3,3), (3,4), (4,1), (4,3), (4,4)}.

Question (DEC 2021 – 07 Marks)

Let 𝐴 = {1, 2, 3, 4}. For the relation 𝑅 whose matrix is given, find the matrix of the transitive
closure by using Warshall’s algorithm.
1 0 0 1
1 1 0 0
𝑀𝑅 = [ ]
0 0 1 0
0 0 0 1

Answer
Let 𝑀𝑅 be the given matrix for the relation 𝑅 on 𝐴 = {1, 2, 3, 4}.

Step 1
Write all positions where 1 is present in first column 𝐶1 . We can see that in the first column,
1 is present at positions “ 1 ” and “ 2 ”. Therefore, we have

Write all positions where 1 is present in first row 𝑅1 . We can see that in the first row, 1 is
present at positions “ 1 ” and “ 4 ”. Therefore, we have
The cross product of 𝐶1 and 𝑅1 is 𝐶1 × 𝑅1 = {(1, 1), (1, 4), (2, 1), (2, 4)}.
The new ordered pair (2, 4) can be represented by 1 and this is new addition (orange 1) in the
previous matrix. Note that the other ordered pairs are already represented by 1 in the previous
matrix.

Step 2
Write all positions where 1 is present in second column 𝐶2 . We can see that in the second
column, 1 is present at position “ 2 ”. Therefore, we have

Write all positions where 1 is present in second row 𝑅2 . We can see that in the second row, 1
is present at positions “ 1 ” , “ 2 ” and “ 4 ”. Therefore, we have

The cross product of 𝐶2 and 𝑅2 is 𝐶2 × 𝑅2 = {(2, 1), (2, 2), (2, 4)}.
Note that the all ordered pairs of 𝐶2 × 𝑅2 are already represented by 1 in the previous matrix.
Hence, there is NO new addition. Hence, the new matrix is same as the previous matrix.
That is, 𝑀𝑅2 = 𝑀𝑅1 .

Step 3
Write all positions where 1 is present in third column 𝐶3 . We can see that in the third column,
1 is present at position “ 3 ”. Therefore, we have

Write all positions where 1 is present in third row 𝑅3 . We can see that in the third row, 1 is
present at position “ 3 ”. Therefore, we have
The cross product of 𝐶3 and 𝑅3 is 𝐶3 × 𝑅3 = {(3, 3)}.
Note that the ordered pair (3, 3) is already represented by 1 in the previous matrix. Hence,
there is NO new addition. Hence, the new matrix is same as the previous matrix. That is,
𝑀𝑅3 = 𝑀𝑅2 .

Step 4
Write all positions where 1 is present in fourth column 𝐶4 . We can see that in the fourth
column, 1 is present at positions “ 1 ” , “ 2 ” and “ 4 ”. Therefore, we have

Write all positions where 1 is present in fourth row 𝑅4 . We can see that in the fourth row, 1 is
present at position “ 4 ”. Therefore, we have

The cross product of 𝐶4 and 𝑅4 is 𝐶4 × 𝑅4 = {(1,4), (2,4), (4,4)}.

Note that the all ordered pairs of 𝐶4 × 𝑅4 are already represented by 1 in the previous matrix.
Hence, there is NO new addition. Hence, the new matrix is same as the previous matrix.
That is, 𝑀𝑅4 = 𝑀𝑅3 .

Since there are 𝟒 elements in set 𝐴, 𝟒 steps are required in order to find the matrix of the
transitive closure of relation 𝑅. Hence, the matrix of the transitive closure is
Question (JULY 2023 – 04 Marks)
Find transitive closure by Warshall’s Algorithm if 𝐴 = {1, 2, 3, 4, 5} and
𝑅 = {(1,2) , (3,4) , (4,5) , (4,1) , (1,1)}.
Answer

Let 𝑅 = {(1,1), (1,2), (3,4) , (4,1) , (4,5)} be the relation on 𝐴 = {1, 2, 3, 4, 5}. First,
represent the relation 𝑅 in the matrix form.

Step 1
Write all positions where 1 is present in first column 𝐶1 . We can see that in the first column,
1 is present at positions “ 1 ” and “ 4 ”. Therefore, we have

Write all positions where 1 is present in first row 𝑅1 . We can see that in the first row, 1 is
present at positions “ 1 ” and “ 2 ”. Therefore, we have

The cross product of 𝐶1 and 𝑅1 is 𝐶1 × 𝑅1 = {(1, 1), (1, 2), (4, 1), (4, 2)}.
The new ordered pair (4, 2) can be represented by 1 and this is new addition (orange 1) in the
previous matrix. Note that the other ordered pairs are already represented by 1 in the previous
matrix.
Step 2

Write all positions where 1 is present in second column 𝐶2 . We can see that in the second
column, 1 is present at positions “ 1 ” and “ 4 ”. Therefore, we have

Write all positions where 1 is present in second row 𝑅2 . We can see that in the second row, 1
is NOT present anywhere. Therefore, 𝑅2 is an empty set. That is,

Since 𝑅2 = ∅, the cross product of 𝐶2 and 𝑅2 is 𝐶2 × 𝑅2 = ∅. That is, 𝐶2 × 𝑅2 is an empty

set. Hence, there is NO new addition. Hence, the new matrix is same as the previous matrix.
That is, 𝑀𝑅2 = 𝑀𝑅1 .

Step 3

Write all positions where 1 is present in third column 𝐶3 . We can see that in the third column,
1 is NOT present anywhere. Therefore, 𝐶3 is an empty set. That is,

Since 𝐶3 = ∅, the cross product of 𝐶3 and 𝑅3 is 𝐶3 × 𝑅3 = ∅. That is, 𝐶3 × 𝑅3 is an empty

set. Hence, there is NO new addition. Hence, the new matrix is same as the previous matrix.
That is, 𝑀𝑅3 = 𝑀𝑅2 .
Step 4

Write all positions where 1 is present in fourth column 𝐶4 . We can see that in the fourth
column, 1 is present at position “ 3 ”. Therefore, we have

Write all positions where 1 is present in fourth row 𝑅4 . We can see that in the fourth row, 1 is
present at positions “ 1 ” , “ 2 ” and “ 5 ”. Therefore, we have

The cross product of 𝐶4 and 𝑅4 is 𝐶4 × 𝑅4 = {(3, 1), (3, 2), (3, 5)}.
The new ordered pairs (3, 1), (3, 2) and (3, 5) can be represented by 1 and these are new
additions (maroon 1) in the previous matrix.

Step 5

Write all positions where 1 is present in fifth column 𝐶5 . We can see that in the fifth column,
1 is present at positions “ 3 ” and “ 4 ”. Therefore, we have

Write all positions where 1 is present in fifth row 𝑅5 . We can see that in the fifth row, 1 is
NOT present anywhere. Therefore, 𝑅5 is an empty set. That is,
Since 𝑅5 = ∅, the cross product of 𝐶5 and 𝑅5 is 𝐶5 × 𝑅5 = ∅. That is, 𝐶5 × 𝑅5 is an empty
set. Hence, there is NO new addition. Hence, the new matrix is same as the previous matrix.
That is, 𝑀𝑅5 = 𝑀𝑅4 .

Since there are 𝟓 elements in set 𝐴, 𝟓 steps are required in order to find the transitive closure
of relation 𝑅. Hence, the transitive closure is

𝑅 ∗ = {(1,1), (1,2), (3,1), (3,2), (3,4), (3,5), (4,1), (4,2), (4,5)}

Composite relation

Let 𝑅 be the relation from set 𝐴 to set 𝐵 and let 𝑆 be the relation from set 𝐵 to set 𝐶. The
composite relation of 𝑅 and 𝑆 is denoted by 𝑅 𝑜 𝑆 or 𝑅𝑆 and it is defined as the set of all
ordered pairs (𝒙, 𝒛) where (𝒙, 𝑦) ∈ 𝑅 and (𝑦, 𝒛) ∈ 𝑆. That is,

𝑅 𝑜 𝑆 = {(𝒙, 𝒛) / (𝒙, 𝑦) ∈ 𝑅 and (𝑦, 𝒛) ∈ 𝑆 , 𝑥 ∈ 𝐴 , 𝑦 ∈ 𝐵 , 𝑧 ∈ 𝐶}

Question

Let 𝑅 be the relation from 𝐴 to 𝐵 and 𝑆 be the relation from 𝐵 to 𝐶 where 𝐴 = {4, 5, 6} , 𝐵 =
{𝑎, 𝑏, 𝑐} , 𝐶 = {𝑙, 𝑚, 𝑛}. Given that 𝑅 = {(4, 𝑎), (4, 𝑏), (5, 𝑐), (6, 𝑎), (6, 𝑐)} and

𝑆 = {(𝑎, 𝑙), (𝑎, 𝑛), (𝑏, 𝑙), (𝑏, 𝑚), (𝑐, 𝑙), (𝑐, 𝑚), (𝑐, 𝑛)}. Find the composite relation 𝑅 𝑜 𝑆.

Answer

Since 𝑅 is the relation from 𝐴 to 𝐵 and 𝑆 is the relation from 𝐵 to 𝐶, the composite relation
𝑅 𝑜 𝑆 is the relation from 𝐴 to 𝐶.
(𝟒, 𝑎) ∈ 𝑅 and (𝑎, 𝒍) ∈ 𝑆. Therefore, (𝟒, 𝒍) ∈ 𝑅 𝑜 𝑆.

(𝟒, 𝑎) ∈ 𝑅 and (𝑎, 𝒏) ∈ 𝑆. Therefore, (𝟒, 𝒏) ∈ 𝑅 𝑜 𝑆.

(𝟒, 𝑏) ∈ 𝑅 and (𝑏, 𝒎) ∈ 𝑆. Therefore, (𝟒, 𝒎) ∈ 𝑅 𝑜 𝑆.

(𝟓, 𝑐) ∈ 𝑅 and (𝑐, 𝒍) ∈ 𝑆. Therefore, (𝟓, 𝒍) ∈ 𝑅 𝑜 𝑆.

(𝟓, 𝑐) ∈ 𝑅 and (𝑐, 𝒎) ∈ 𝑆. Therefore, (𝟓, 𝒎) ∈ 𝑅 𝑜 𝑆.

(𝟓, 𝑐) ∈ 𝑅 and (𝑐, 𝒏) ∈ 𝑆. Therefore, (𝟓, 𝒏) ∈ 𝑅 𝑜 𝑆.

(𝟔, 𝑎) ∈ 𝑅 and (𝑎, 𝒍) ∈ 𝑆. Therefore, (𝟔, 𝒍) ∈ 𝑅 𝑜 𝑆.

(𝟔, 𝑎) ∈ 𝑅 and (𝑎, 𝒏) ∈ 𝑆. Therefore, (𝟔, 𝒏) ∈ 𝑅 𝑜 𝑆.

(𝟔, 𝑐) ∈ 𝑅 and (𝑐, 𝒎) ∈ 𝑆. Therefore, (𝟔, 𝒎) ∈ 𝑅 𝑜 𝑆.

Hence, 𝑅 𝑜 𝑆 = {(4, 𝑙), (4, 𝑚), (4, 𝑛), (5, 𝑙), (5, 𝑚), (5, 𝑛), (6, 𝑙), (6, 𝑚), (6, 𝑛)}.

Question (JULY 2023 – 07 Marks)

If 𝑅 = {(𝑎, 𝑏) ∶ |𝑎 − 𝑏| = 1} and 𝑆 = {(𝑎, 𝑏) ∶ 𝑎 − 𝑏 is even} be two relations on
𝐴 = {1, 2, 3, 4}. Then (I) Find matrices of 𝑅 and 𝑆 (II) Find digraph of 𝑅 and 𝑆 (III) Find the
relation 𝑅𝑆.
Answer

Let 𝐴 = {1, 2, 3, 4} be the given finite set.

First, we need to write all possible ordered pairs (𝑎, 𝑏) such that |𝑎 − 𝑏| = 1 where 𝑎 ∈ 𝐴 and
𝑏 ∈ 𝐴.
Let 𝑎 = 1 and 𝑏 = 2. Then, |𝑎 − 𝑏| = |1 − 2| = |−1| = 𝟏. So, (1, 2) ∈ 𝑅.

Let 𝑎 = 2 and 𝑏 = 1. Then, |𝑎 − 𝑏| = |2 − 1| = |1| = 𝟏. So, (2, 1) ∈ 𝑅.

Let 𝑎 = 2 and 𝑏 = 3. Then, |𝑎 − 𝑏| = |2 − 3| = |−1| = 𝟏. So, (2, 3) ∈ 𝑅.

Let 𝑎 = 3 and 𝑏 = 2. Then, |𝑎 − 𝑏| = |3 − 2| = |1| = 𝟏. So, (3, 2) ∈ 𝑅.

Let 𝑎 = 3 and 𝑏 = 4. Then, |𝑎 − 𝑏| = |3 − 4| = |−1| = 𝟏. So, (3, 4) ∈ 𝑅.

Let 𝑎 = 4 and 𝑏 = 3. Then, |𝑎 − 𝑏| = |4 − 3| = |1| = 𝟏. So, (4, 3) ∈ 𝑅.

Hence, 𝑅 = {(1,2), (2,1), (2,3), (3,2), (3,4), (4,3)}.

Now, we need to write all possible ordered pairs (𝑎, 𝑏) such that 𝑎 − 𝑏 is even where 𝑎 ∈ 𝐴
and 𝑏 ∈ 𝐴.

Let 𝑎 = 1 and 𝑏 = 1. Then, 𝑎 − 𝑏 = 1 − 1 = 𝟎 is even. So, (1,1) ∈ 𝑆.

Let 𝑎 = 1 and 𝑏 = 3. Then, 𝑎 − 𝑏 = 1 − 3 = −𝟐 is negative even. So, (1,3) ∈ 𝑆.

Let 𝑎 = 2 and 𝑏 = 2. Then, 𝑎 − 𝑏 = 2 − 2 = 𝟎 is even. So, (2,2) ∈ 𝑆.

Let 𝑎 = 2 and 𝑏 = 4. Then, 𝑎 − 𝑏 = 2 − 4 = −𝟐 is negative even. So, (2,4) ∈ 𝑆.

Let 𝑎 = 3 and 𝑏 = 1. Then, 𝑎 − 𝑏 = 3 − 1 = 𝟐 is positive even. So, (3,1) ∈ 𝑆.

Let 𝑎 = 3 and 𝑏 = 3. Then, 𝑎 − 𝑏 = 3 − 3 = 𝟎 is even. So, (3,3) ∈ 𝑆.

Let 𝑎 = 4 and 𝑏 = 2. Then, 𝑎 − 𝑏 = 4 − 2 = 𝟐 is positive even. So, (4,2) ∈ 𝑆.

Let 𝑎 = 4 and 𝑏 = 4. Then, 𝑎 − 𝑏 = 4 − 4 = 𝟎 is even. So, (4,4) ∈ 𝑆.

Hence, 𝑆 = {(1,1), (1,3), (2,2), (2,4), (3,1), (3,3), (4,2), (4,4)}.

(I)

The matrix of relation 𝑅 is given by

The matrix of relation 𝑆 is given by

(II)

The digraph of 𝑅 is given by

The digraph of 𝑆 is given by

(III)

The relation 𝑅𝑆 is composite relation of 𝑅 and 𝑆. That is, 𝑅𝑆 = 𝑅 𝑜 𝑆. We have,

𝑅 = {(1,2), (2,1), (2,3), (3,2), (3,4), (4,3)}

𝑆 = {(1,1), (1,3), (2,2), (2,4), (3,1), (3,3), (4,2), (4,4)}

(𝟏, 2) ∈ 𝑅 and (2, 𝟐) ∈ 𝑆. Therefore, (𝟏, 𝟐) ∈ 𝑅𝑆.

(𝟏, 2) ∈ 𝑅 and (2, 𝟒) ∈ 𝑆. Therefore, (𝟏, 𝟒) ∈ 𝑅𝑆.

(𝟐, 1) ∈ 𝑅 and (1, 𝟏) ∈ 𝑆. Therefore, (𝟐, 𝟏) ∈ 𝑅𝑆.

(𝟐, 1) ∈ 𝑅 and (1, 𝟑) ∈ 𝑆. Therefore, (𝟐, 𝟑) ∈ 𝑅𝑆.

(𝟐, 3) ∈ 𝑅 and (3, 𝟏) ∈ 𝑆. Therefore, (𝟐, 𝟏) ∈ 𝑅𝑆.

(𝟐, 3) ∈ 𝑅 and (3, 𝟑) ∈ 𝑆. Therefore, (𝟐, 𝟑) ∈ 𝑅𝑆.

(𝟑, 2) ∈ 𝑅 and (2, 𝟐) ∈ 𝑆. Therefore, (𝟑, 𝟐) ∈ 𝑅𝑆.

(𝟑, 2) ∈ 𝑅 and (2, 𝟒) ∈ 𝑆. Therefore, (𝟑, 𝟒) ∈ 𝑅𝑆.

(𝟑, 4) ∈ 𝑅 and (4, 𝟐) ∈ 𝑆. Therefore, (𝟑, 𝟐) ∈ 𝑅𝑆.

(𝟑, 4) ∈ 𝑅 and (4, 𝟒) ∈ 𝑆. Therefore, (𝟑, 𝟒) ∈ 𝑅𝑆.

(𝟒, 3) ∈ 𝑅 and (3, 𝟏) ∈ 𝑆. Therefore, (𝟒, 𝟏) ∈ 𝑅𝑆.

(𝟒, 3) ∈ 𝑅 and (3, 𝟑) ∈ 𝑆. Therefore, (𝟒, 𝟑) ∈ 𝑅𝑆.

Hence, 𝑅𝑆 = {(1, 2), (1, 4), (2, 1), (2, 3), (3, 2), (3, 4), (4, 1), (4, 3)}.

Note

Do not repeat any ordered pair if this is already present in 𝑅𝑆. In above example, do not
consider (2,1), (2,3), (3,2), (3,4) again because they are already present in 𝑅𝑆.

Types of a Relation
Question (SEP 2021 – 03 Marks)
Explain types of a Relation with a suitable example.
Answer
Converse of a relation / Inverse relation

Let 𝑅 be the relation from set 𝑋 to set 𝑌. Then, the converse of 𝑅 is denoted by 𝑅 −1 and it is
defined as the set of all ordered pairs (𝑦, 𝑥) where (𝑥, 𝑦) ∈ 𝑅. That is,

𝑅 −1 = {(𝑦, 𝑥) ∶ (𝑥, 𝑦) ∈ 𝑅}

For example,

1) Let 𝑅 be the relation from set 𝑋 to set 𝑌 where 𝑋 = {1, 2, 3} , 𝑌 = {7, 8} and
 𝑅 = {(1, 7), (2, 7), (1, 8), (3, 8)}. Then, the converse / inverse of relation 𝑅 is given
by 𝑅 −1 = {(7, 1), (7, 2), (8, 1), (8, 3)}.
Identity relation

Let 𝑅 be the relation defined on set 𝐴. Then, 𝑅 is said to be identity relation if (𝑥, 𝑥) ∈ 𝑅 for
every element 𝑥 ∈ 𝐴. Generally, it is denoted by 𝐼𝐴 . That is, 𝐼𝐴 = {(𝑥, 𝑥) ∶ 𝑥 ∈ 𝐴}.
For example,

1) Let 𝐴 = {𝑎, 𝑏, 𝑐}. Then, 𝑅 = 𝐼𝐴 = {(𝑎, 𝑎), (𝑏, 𝑏), (𝑐, 𝑐)} is an identity relation on 𝐴.

Universal relation (On page 4)

Void relation (On page 4)
Question (DEC 2022 – 04 Marks)
Consider the relation 𝑅 defined on 𝐴 = {1, 2, 3} whose matrix representation is given below.
Determine its inverse 𝑅 −1 and complement 𝑅 ′ .
1 0 0
𝑀𝑅 = [1 1 1]
0 0 1
Answer

Let 𝑀𝑅 be the given matrix where 𝑅 is the relation defined on 𝐴 = {1, 2, 3}.

From the matrix, we have 𝑅 = {(1,1), (2,1), (2,2), (2,3), (3,3)}.

Since (1,1) ∈ 𝑅, we have (1,1) ∈ 𝑅 −1.

Since (2,1) ∈ 𝑅, we have (1,2) ∈ 𝑅 −1.

Since (2,2) ∈ 𝑅, we have (2,2) ∈ 𝑅 −1.

Since (2,3) ∈ 𝑅, we have (3,2) ∈ 𝑅 −1.

Since (3,3) ∈ 𝑅, we have (3,3) ∈ 𝑅 −1.

Hence, the inverse of 𝑅 is given by 𝑅 −1 = {(1,1), (1,2), (2,2), (3,2), (3,3)}.

Let 𝐴 × 𝐴 be the universal relation where

𝐴 × 𝐴 = {(1,1), (1,2), (1,3), (2,1), (2,2), (2,3), (3,1), (3,2), (3,3)}.

Since (1,2) ∈ 𝐴 × 𝐴 but (1,2) ∉ 𝑅, we have (1,2) ∈ 𝑅 ′.

Since (1,3) ∈ 𝐴 × 𝐴 but (1,3) ∉ 𝑅, we have (1,3) ∈ 𝑅 ′.

Since (3,1) ∈ 𝐴 × 𝐴 but (3,1) ∉ 𝑅, we have (3,1) ∈ 𝑅 ′.

Since (3,2) ∈ 𝐴 × 𝐴 but (3,2) ∉ 𝑅, we have (3,2) ∈ 𝑅 ′.

Hence, the complement of 𝑅 is given by 𝑅 ′ = {(1,2), (1,3), (3,1), (3,2)}.

Additional topics / problems
Maximal compatibility blocks
Let 𝑋 be a set. A subset 𝐴 ⊆ 𝑋 is called a maximum compatibility block if
1) Any element of 𝐴 is compatible to every other element of 𝐴.
2) No element of 𝑋 − 𝐴 is compatible to all elements of 𝐴.
Question (FEB 2024 – 04 Marks)
Find out maximal compatibility blocks of following simplified graph of digraph and write its
relation matrix.

Answer
Let 𝑋 = {1, 2, 3, 4, 5, 6}.
Let 𝐴 = {𝟏, 𝟐, 𝟑, 𝟒}. Then, 𝑋 − 𝐴 = {5, 6}.
Here 𝐴 = {1, 2, 3, 4} is maximal compatibility block because any element of 𝐴 is
compatible (related) to every other element of 𝐴 and no element of 𝑋 − 𝐴 is compatible
(related) to all elements of 𝐴.
Let 𝐴 = {𝟐, 𝟓}. Then, 𝑋 − 𝐴 = {1, 3, 4, 6}.
Here 𝐴 = {2, 5} is maximal compatibility block because any element of 𝐴 is compatible to
every other element of 𝐴 and no element of 𝑋 − 𝐴 is compatible to all elements of 𝐴.
Let 𝐴 = {𝟑, 𝟔}. Then, 𝑋 − 𝐴 = {1, 2, 4, 5}.
Here 𝐴 = {3, 6} is maximal compatibility block because any element of 𝐴 is compatible to
every other element of 𝐴 and no element of 𝑋 − 𝐴 is compatible to all elements of 𝐴.
Let 𝐴 = {𝟓, 𝟔}. Then, 𝑋 − 𝐴 = {1, 2, 3, 4}.
Here 𝐴 = {5, 6} is maximal compatibility block because any element of 𝐴 is compatible to
every other element of 𝐴 and no element of 𝑋 − 𝐴 is compatible to all elements of 𝐴.
Therefore, the maximal compatibility blocks are {1, 2, 3, 4} , {2, 5} , {3, 6} and {5, 6}.
The relation matrix is given by

Partition of a Set

Let 𝐴 be the given set. Let 𝐴1 , 𝐴2 , 𝐴3 , …, 𝐴𝑛 be the subsets of 𝐴. Then,

𝑃 = {𝐴1 , 𝐴2 , 𝐴3 , … , 𝐴𝑛 } is called the partition of a set 𝐴 if
1) Each subset is non-empty.
2) The union of all subsets is 𝐴. That is, 𝐴1 ∪ 𝐴2 ∪ 𝐴3 ∪ … ∪ 𝐴𝑛 = 𝐴.
3) Intersection of two distinct subsets is empty set. That is, 𝐴1 ∩ 𝐴2 = ∅ where 𝐴1 and
𝐴2 are distinct subsets.
Important note
1) The subsets are also called blocks of the partition.
2) From an equivalence relation on 𝐴, we can define partition of 𝐴 so that every two
elements in a same block are related and any two elements of different blocks are not
related. This partition is called partition induced by the equivalence relation.
For example,
Let 𝐴 = {1, 2, 3, 4, 5}. Then, 𝑃 = {{1, 2} , {3} , {4, 5}} is a partition of 𝐴 because
{1 , 2} ∪ {3} ∪ {4, 5} = {1, 2, 3, 4, 5} = 𝐴 and
{1 , 2} ∩ {3} ∩ {4, 5} = ∅
Question (JULY 2022 – 04 Marks)
Which of these collections of subsets are partitions of {1, 2, 3, 4, 5, 6} ? Justify your answer if
it is not a partition.
(i) {1, 2}, {2, 3, 4} , {4, 5, 6} (ii) {1, 4, 5} , {2, 6}
Answer
(i)
The union of the given collection {1, 2}, {2, 3, 4} , {4, 5, 6} is {1, 2, 3, 4, 5, 6}.
That is, {1, 2} ∪ {2, 3, 4} ∪ {4, 5, 6} = {1, 2, 3, 4, 5, 6}.
But, the intersection of {1, 2} and {2, 3, 4} is {2}. That is, the intersection of {1, 2} and
{2, 3, 4} is not empty set.
Hence, the given collection {1, 2}, {2, 3, 4} , {4, 5, 6} is NOT a partition.
(ii)
The intersection of {1, 4, 5} and {2, 6} is empty set. That is, {1, 4, 5} ∩ {2, 6} = ∅.
But, the union of the given collection {1, 4, 5} , {2, 6} is {1, 2, 4, 5, 6}.
That is, {1, 4, 5} ∪ {2, 6} ≠ {1, 2, 3, 4, 5, 6}.
Hence, the given collection {1, 4, 5} , {2, 6} is NOT a partition.

Question (DEC 2022 – 03 Marks)

Define Partition of a Set. Let 𝐴 = {1, 2, 3, 4, 5} and
𝑅 = {(1,2), (1,1), (2,1), (2,2), (3,3), (4,4), (5,5)} be an equivalence relation on 𝐴. Determine
the partition for 𝑅 −1, if it is an equivalence relation.
Answer
Definition:
Let 𝐴 be the given set. Let 𝐴1 , 𝐴2 , 𝐴3 , …, 𝐴𝑛 be the subsets of 𝐴. Then,
𝑃 = {𝐴1 , 𝐴2 , 𝐴3 , … , 𝐴𝑛 } is called the partition of a set 𝐴 if
1) Each subset is non-empty.
2) The union of all subsets is 𝐴. That is, 𝐴1 ∪ 𝐴2 ∪ 𝐴3 ∪ … ∪ 𝐴𝑛 = 𝐴.
Intersection of two distinct subsets is empty set. That is, 𝐴1 ∩ 𝐴2 = ∅ where 𝐴1 and 𝐴2 are
distinct subsets.

Given that 𝑅 = {(1,2), (1,1), (2,1), (2,2), (3,3), (4,4), (5,5)}. Then, we have,
𝑅 −1 = {(2,1), (1,1), (1,2), (2,2), (3,3), (4,4), (5,5)}.
From the relation 𝑅 −1, we can define partition of 𝐴 so that every two elements in a same
block are related and any two elements of different blocks are not related.
The required partition for 𝑅 −1 is 𝑃 = {{𝟏, 𝟐}, {𝟑}, {𝟒}, {𝟓}}.

Question (FEB 2021 – 03 Marks)

Let 𝑅 be a relation defined in 𝐴 = {1, 2, 3, 5, 7, 9} as 𝑅 = {(1,1), (1,3), (1,5), (1,7), (2,2),
(3,1), (3,3), (3,5), (3,7), (5,1), (5,3), (5,5), (5,7), (7,1), (7,3), (7,5), (7,7), (9,9)}. Find the
partitions of 𝐴 based on the equivalence relation 𝑅.
Answer
Given that 𝑅 = {(1,1), (1,3), (1,5), (1,7), (2,2), (3,1), (3,3), (3,5), (3,7), (5,1), (5,3), (5,5),
(5,7), (7,1), (7,3), (7,5), (7,7), (9,9)}.
From the relation 𝑅, we can define partition of 𝐴 so that every two elements in a same block
are related and any two elements of different blocks are not related.
Since 1 is related to 3, 5 and 7, keep 1, 3, 5, 7 in one block.
Since 1 is not related to 2, keep 2 in different block.
Since 2 is not related to 9, keep 9 in different block.
Hence, the required partition for given 𝑅 is 𝑃 = {{𝟏, 𝟑, 𝟓, 𝟕}, {𝟐}, {𝟗}}.

Equivalence class
Let 𝑅 be the equivalence relation defined on a set 𝐴 and let 𝑥 be the element of set 𝐴. Then,
the set of all those elements of 𝐴 that are related to 𝑥 is called the equivalence class of 𝑥 under
the relation 𝑅 and it is denoted by [𝑥]. That is,
[𝑥] = {𝑦 ∶ 𝑦 is an element of 𝐴 and 𝑦 is related to 𝑥}
For example,
Let 𝑅 = {(1, 2), (2, 1), (1, 1), (2, 2), (3, 3), (4, 4)} be the equivalence relation defined on a set
𝐴 = {1, 2, 3, 4}. Then, we have,
The equivalence class of 1 is given by [1] = {1, 2} because (1, 1) ∈ 𝑅 and (1, 2) ∈ 𝑅.
The equivalence class of 2 is given by [2] = {1, 2} because (2, 1) ∈ 𝑅 and (2, 2) ∈ 𝑅.
The equivalence class of 3 is given by [3] = {3} because (3, 3) ∈ 𝑅.
The equivalence class of 4 is given by [4] = {4} because (4, 4) ∈ 𝑅.
Question (OCT 2020 – 03 Marks)
Define equivalence class. Let 𝑅 be the relation on the set of integers 𝐼 defined by 𝑥 − 𝑦 is an
even integer, find the disjoint equivalence classes.
Answer
Definition:
Let 𝑅 be the equivalence relation defined on a set 𝐴 and let 𝑥 be the element of set 𝐴. Then,
the set of all those elements of 𝐴 that are related to 𝑥 is called the equivalence class of 𝑥 under
the relation 𝑅 and it is denoted by [𝑥]. That is,
[𝑥] = {𝑦 ∶ 𝑦 is an element of 𝐴 and 𝑦 is related to 𝑥}

Let 𝐼 be the set of integers where 𝐼 = {… , −3 , −2, −1, 0, 1, 2, 3, … }.

Let 𝑅 be the relation defined by 𝑥 − 𝑦 is an even integer. That is,
𝑅 = {(𝑥, 𝑦) ∶ 𝑥 − 𝑦 is an even integer}.
The equivalence class of 0 is given by [0] = {… , −4 , −2 , 0 , 2 , 4 , … }.
The equivalence class of 1 is given by [1] = {… , −5 , −3 , 1 , 3 , 5 , … }.
The equivalence class of 2 is given by [2] = {… , −4 , −2 , 0 , 2 , 4 , … } = [0].
The equivalence class of 3 is given by [3] = {… , −5 , −3 , 1 , 3 , 5 , … } = [1].
The equivalence class of −2 is given by [−2] = {… , −4 , −2 , 0 , 2 , 4 , … } = [0].
The equivalence class of −1 is given by [−1] = {… , −5 , −3 , 1 , 3 , 5 , … } = [1].
Therefore, the disjoint equivalence classes are [0] and [1].

Question (DEC 2021 – 07 Marks)

Define equivalence class generated by an element 𝑥 ∈ 𝑋. Let 𝑍 be the set of integers and let 𝑅
be the relation called “congruence modulo 3” defined by
𝑅 = {⟨𝑥, 𝑦⟩ | 𝑥 ∈ 𝑍 ∧ 𝑦 ∈ 𝑍 ∧ 𝑥 − 𝑦 is divisible by 3}
Determine the equivalences classes generated by the element of 𝑍.
Answer
Let 𝑍 be the set of integers where 𝑍 = {… , −3 , −2, −1, 0, 1, 2, 3, … }.
Let 𝑅 be the relation defined by 𝑥 − 𝑦 is divisible by 3. That is,
𝑅 = {(𝑥, 𝑦) ∶ 𝑥 − 𝑦 is divisible by 3}.
The equivalence class of 0 is given by [0] = {… , −6 , −3 , 0 , 3 , 6 , … }.
The equivalence class of 1 is given by [1] = {… , −5 , −2 , 1 , 4 , 7 , … }.
The equivalence class of 2 is given by [2] = {… , −4 , −1 , 2 , 5 , 8 , … }.
The equivalence class of 3 is given by [3] = {… , −6 , −3 , 0 , 3 , 6 , … } = [0].
The equivalence class of 4 is given by [4] = {… , −5 , −2 , 1 , 4 , 7 , … } = [1].
The equivalence class of 5 is given by [5] = {… , −4 , −1 , 2 , 5 , 8 , … } = [2].
Therefore, the disjoint equivalence classes are [0] , [1] and [2].
TRY YOURSELF