1

RELATIONS AND FUNCTIONS

RELATION
Let A and B be non-empty sets. Any subset of 𝑨 × 𝑩 is called a relation from 𝑨 to 𝑩.
Suppose R is a relation from A to B, then 𝐑 ⊆ 𝐀 × 𝐁. If (𝐚, 𝐛) ∈ 𝐑 then we say that 𝒂 is
related to 𝐛 under R and write 𝐚 𝐑 𝐛
If 𝑛(𝐴) = 𝑚 and 𝑛(𝐵) = 𝑛, then
No: of relations from A to B= 𝟐𝒎𝒏

DOMAIN AND RANGE OF RELATION

If R is a relation from A to B, then the set of all first elements of the ordered pairs in R is called
the Domain of R and the set of all second elements of the ordered pairs in R is called the Range
of R.
Symbolically,
Domain (𝐑) = {𝒂: (𝒂, 𝒃) ∈ 𝐑 } and Range (𝐑) = {𝒃: (𝒂, 𝒃) ∈ 𝐑 }.
Domain of R is a subset of A and range of R is a subset of B.
If R is a relation from A to B, then the set B itself is called the codomain of the relation R. The
range of a relation is always a subset of its codomain.

UNIVERSAL RELATION
A relation R on a set A is called the Universal relation on A if 𝐑 = 𝐀 × 𝐀 i.e, if every element
of A is related to every element of A.
Example: If 𝐀 = {𝒙, 𝒚}, then the universal relation on A is the set{(𝒙, 𝒙), (𝒙, 𝒚), (𝒚, 𝒙), (𝒚, 𝒚)}
The universal relation on a set A is the largest relation on A.

IDENTITY RELATION
A relation R on a set A is called the Identity relation on A if 𝑹 = {(𝒂, 𝒂): 𝒂 ∈ 𝐑 }
Example: If 𝐀 = {𝟏, 𝟒, 𝟔 }, then the identity relation on A is the set {(𝟏, 𝟏), (𝟒, 𝟒), (𝟔, 𝟔)}.

VOID RELATION
A relation R on a set A is called the Void relation on A if 𝑹 = ∅ i.e, if no element of A is related
to any element of A.
Example: let 𝐀 = {𝟑, 𝟒, 𝟕, 𝟏𝟕} and let R be the relation on A defined as ‘𝒂 𝑹 𝒃 if and only if
𝒂 − 𝒃 = 𝟏/𝟐’. We see that 𝑹 = ∅ ⊆ 𝐀 × 𝐀 is the void relation on A.
The void relation on a set A is the smallest relation on A.

Epsilon Centre for Quality Studies 7736556277, 9778797330

 2

INVERSE RELATION
If R is a relation from A to B, then the Inverse relation of R is a relation from B to A and is defined
as {(𝒃, 𝒂): (𝒂, 𝒃) ∈ 𝐑}. The inverse relation of R is denoted by 𝑹−𝟏 .
Example: If 𝑹 = {(𝟏, 𝟒), (𝟗, 𝟏𝟓), (𝟏𝟎, 𝟐)} is a relation on a set A, where 𝐀 = {𝟏, 𝟐 , . . . , 𝟐𝟎},
then 𝑹−𝟏 = {(𝟒, 𝟏), (𝟏𝟓, 𝟗), (𝟐, 𝟏𝟎)} is the inverse relation of R.

𝐃𝐨𝐦𝐚𝐢𝐧 (𝐑−𝟏 ) = 𝐑𝐚𝐧𝐠𝐞 (𝐑) 𝐚𝐧𝐝 𝐑𝐚𝐧𝐠𝐞(𝐑−𝟏 ) = 𝐃𝐨𝐦𝐚𝐢𝐧 (𝐑).

TYPES OF RELATIONS
REFLEXIVE RELATION
A relation R on a non-empty set A is called a Reflexive relation, if every element of A is
R - related to itself i.e., (𝒂, 𝒂) ∈ 𝐑 for every 𝒂 ∈ 𝐀, i.e.,𝒂 𝑹 𝒂 for every 𝒂 ∈ 𝐀.
Thus a relation R on a non-empty set A is not reflexive if there exists at least one 𝒂 ∈ 𝐀
such that (𝒂, 𝒂) ∉ 𝑹.
Example: Let 𝐀 = {𝟐, 𝟒, 𝟕 }. The relation 𝑹 = {(𝟐, 𝟐), (𝟐, 𝟒), (𝟒, 𝟒), (𝟕, 𝟕)} on A is reflexive
because (𝒂, 𝒂) ∈ 𝐑 for every 𝒂 ∈ 𝐀.
The relation 𝑺 = {(𝟐, 𝟐), (𝟐, 𝟒), (𝟒, 𝟒), (𝟕, 𝟕)}on A is not reflexive because 4 ∈ A
but(𝟒, 𝟒) ∉ 𝐒.

 The identity relation on a non-empty set is always reflexive. But converse is NOT true.
 The universal relation {(𝒂, 𝒃): 𝒂, 𝒃 ∈ 𝐀 } on the set A is always a reflexive relation on A.

SYMMETRIC RELATION
A relation R on a non-empty set A is called a Symmetric relation if (𝒂, 𝒃) ∈ 𝑹 then (𝒃, 𝒂) ∈ 𝑹,
i.e., 𝒂 𝑹 𝒃 implies 𝒃 𝑹 𝒂.
Thus a relation R on a non-empty set A is not symmetric if there exist 𝒂, 𝒃 ∈ 𝑨 A such that
(𝒂, 𝒃) ∈ 𝑹 but (𝒃, 𝒂) ∉ 𝑹.
Example: Let 𝐀 = {𝟏, 𝟒, 𝟓}
The relation 𝑹 = {(𝟏, 𝟏), (𝟏, 𝟒), (𝟒, 𝟒), (𝟓, 𝟓)} on A is not symmetric because
(𝟏, 𝟒) ∈ 𝑹 but (𝟒, 𝟏) ∉ 𝑹
The relation 𝑺 = {(𝟏, 𝟏), (𝟏, 𝟒), (𝟒, 𝟏), (𝟏, 𝟓), (𝟓, 𝟏)} on A is symmetric.

 The identity relation on a non-empty set is always symmetric.

 The universal relation on a non-empty set is always symmetric.

Epsilon Centre for Quality Studies 7736556277, 9778797330

 3

TRANSITIVE RELATION
A relation R on a non-empty set A is called a Transitive relation if (𝒂, 𝒃), (𝒃, 𝒄) ∈ 𝑹 then
(𝒂, 𝒄) ∈ 𝑹 i.e., 𝒂 𝑹 𝒃, 𝒃 𝑹 𝒄 implies 𝒂 𝑹 𝒄.
Thus a relation R on a non-empty set A is not transitive if there exist 𝒂, 𝒃, 𝒄 ∈ 𝑨 such that
(𝒂, 𝒃), (𝒃, 𝒄) ∈ 𝑹 but (𝒂, 𝒄) ∉ 𝑹.

Example: Let 𝑨 = {𝟏, 𝟐, 𝟑, 𝟔}. The relation 𝐑 = {(𝟏, 𝟏), (𝟏, 𝟐), (𝟐, 𝟑), (𝟏, 𝟔) } on A is
not transitive because (1, 2), (2, 3) ∈ R but (1, 3) ∉ R.
The relation 𝑺 = {(𝟐, 𝟐), (𝟑, 𝟔), (𝟔, 𝟏), (𝟑, 𝟏)} on A is transitive.

 The identity relation on a non-empty set A is always transitive,

 The universal relation on a non-empty set A is always transitive,

ANTISYMMETRIC RELATION
A relation R on a non-empty set A is called an Antisymmetric relation if (𝒂, 𝒃), (𝒃, 𝒂) ∈ 𝑹, then
𝒂 = 𝒃
Thus a relation R on a non-empty set A is not antisymmetric if there exist 𝒂, 𝒃 ∈ A such that
(𝒂, 𝒃), (𝒃, 𝒂) ∈ R but 𝒂 ≠ 𝒃.

Example: Let 𝑨 = {(𝟏, 𝟑, 𝟒)}.

The relation 𝑹 = {(𝟏, 𝟏), (𝟏, 𝟑), (𝟑, 𝟒)} on A is antisymmetric.
The relation 𝑺 = {(𝟏, 𝟏), (𝟏, 𝟑), (𝟑, 𝟏)} on A is not antisymmetric
because (1, 3), (3,1) ∈ S but 𝟏 ≠ 𝟑.

EQUIVALENCE RELATION
A relation R on a non-empty set A is called an Equivalence relation if R is Reflexive, Symmetric
and Transitive.
Thus a relation R on a non-empty set A is an equivalence relation if:
(i) (𝒂, 𝒂) ∈ 𝑹 for every 𝒂 ∈ 𝑨 R
(ii) (𝒂, 𝒃) ∈ 𝑹 implies (𝒃, 𝒂) ∈ 𝑹 S
(iii) (𝒂, 𝒃), (𝒃, 𝒄) ∈ 𝑹 implies (𝒂, 𝒄) ∈ 𝑹. T
Example: Let R be the relation of congruency on the set A of all triangles in a plane. The
relation R is an equivalence relation.

 If R and S are equivalence relations on a set A then the relation 𝑹 ∩ 𝑺 on A is also an equivalence
relation.

 If R is an equivalence relation on a set A, then the inverse relation 𝑹−𝟏 of R on A is also an

equivalence relation.

Epsilon Centre for Quality Studies 7736556277, 9778797330

 4

EQUIVALENCE CLASS
Let R be an equivalence relation on a non-empty set A. For each a ∈ A, the equivalence class of
𝒂 is defined as the set of all elements of A which are related to 𝒂 under R. The equivalence class
of 𝒂 is denoted by [𝒂].
∴ [𝒂] = equivalence class of 𝒂 = {𝒙 ∈ 𝑨: (𝒙, 𝒂) ∈ 𝑹}
The set of all equivalence classes of elements in A under R is called the quotient set of A by R
and it is denoted by A/R.
∴ A/R= {[𝒂]: 𝒂 ∈ 𝑨}

Example: Let 𝐀 = {𝟏, 𝟐, 𝟑, 𝟒}. Consider the equivalence relation

𝑹 = {(𝟏, 𝟏), (𝟐, 𝟐), (𝟑, 𝟑), (𝟒, 𝟒), (𝟏, 𝟐), (𝟐, 𝟏)}on A.
The equivalence classes are:
[𝟏] = {𝒙 ∈ 𝑨: (𝒙, 𝟏) ∈ 𝑹} = {𝟏, 𝟐}
[𝟐] = {𝒙 ∈ 𝑨: (𝒙, 𝟐) ∈ 𝑹} = {𝟏, 𝟐}
[𝟑] = {𝒙 ∈ 𝑨: (𝒙, 𝟑) ∈ 𝑹} = {𝟑}
[𝟒] = {𝒙 ∈ 𝑨: (𝒙, 𝟒) ∈ 𝑹} = {𝟒}

WORKING RULES TO SOLVE PROBLEMS

1. To check Reflexive
A relation 𝑹 on a non-empty set A is reflexive if (𝒂, 𝒂) ∈ 𝑹 for every 𝒂 ∈ 𝑨. If there exists
at least one 𝒂 ∈ 𝑨 such that (𝒂, 𝒂) ∉ 𝑹 then the relation 𝑹 is not reflexive.

2. To check Symmetric
A relation 𝑹 on a non-empty set A is symmetric if (𝒂, 𝒃) ∈ 𝑹 implies (𝒃, 𝒂) ∈ 𝑹 . If there
exist 𝒂, 𝒃 ∈ 𝑨 such that (𝒂, 𝒃) ∈ 𝑹 but (𝒃, 𝒂) ∉ 𝑹 then the relation 𝑹 is not symmetric.

3. To check Transitive
A relation 𝑹 on a non-empty set A is transitive if (𝒂, 𝒃), (𝒃, 𝒄) ∈ 𝑹 then (𝒂, 𝒄) ∈ 𝑹. If
there exist 𝒂, 𝒃, 𝒄 ∈ 𝑨 such that (𝒂, 𝒃) (𝒃, 𝒄) ∈ 𝑹 but (𝒂, 𝒄) ∉ 𝑹 then the relation 𝑹 is
not transitive.

 If the question is to disprove the above relations, then counter examples can be used.
Otherwise, it is advisable to prove these relations using general concepts.

Epsilon Centre for Quality Studies 7736556277, 9778797330