CENTURION UNIVERSITY OF

TECHNOLOGY AND MANAGEMENT

Define the properties of a relation on a set using the

matrix representation of that relation with examples

SUBMITED BY:-

RAKESH RAUSHAN (230101120226)

AMAN KUMAR (230101120216)
MD BASAR (230101120232)
ABHINANDAN KUMAR
. (230101120229)
SANTOSH KUMAR (230101120237) GUIDED BY :-
MD ALMEEN (230101120218)
SURAJ KUMAR (230101120201) DR. ADITYA KUMAR PATI
CONTENT:-

• Introduction
• Properties of relation
• Representing relation using matrix
• application of matrix representation of relation
INTRODUCTION OF RELATION
Definition: Let A and B be two sets. A binary relation R from A to B is a subset of AXB.
OR
R⊆ AXB
Recall: AXB = {(a, b)| α∈A and b ∈ B}
Usually we use the notation aRb to denote (a, b)∈R.
aRb is used to denote (a, b) ∉ R

Example: Let A = {1, 2, 3} and B = {0, 1, 2, 4}

AXB = {(1, 0), (1, 1,), (1, 2), (1, 4), (2, 0), (2, 1), (2, 2), (2, 4), (3, 0),
(3, 1), (3, 2), (3, 4)}

Let say R is the relation where (a, b)∈R if and only if a = b then
R = {(1, 1), (2, 2)} and R ⊆ AXB
Representing relation using matrix

• A relation between finite sets can be represented using a zerone

matrix.

• Suppose R is a relation from A = {a1 , a2 , …, am } to B = {b1 , b2 ,

…, bn }.

• The relation R is represented by the matrix MR = [mij], where,

mij =1, if (a,b) Є R 0,

mij =0, if (a,b) ∉ R

The matrix representing R has a 1 as its (i,j) entry when ai is related to

bj and a
Properties of a relation using its matrix
representation and example

1. Reflexive Relation:
A relation R on a set A is called reflexive if (a, a) ∈R for every element a∈A. In
other words, Va((a, a)∈R).

Example: Let A = {1, 2, 3, 4}

R₁ = {(1, 1), (1, 2), (2, 2), (2, 3), (3, 3), (4, 4)}
Relation R₁ is reflexive because it contains all ordered pairs of the
form (a, a) for every element a∈A i.e., R, has (1, 1), (2, 2), (3, 3),
(4, 4)

R₂ = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 1), (4, 4)} [Link] R₂ is not
reflexive because the ordered pair (3, 3) is not in R2
• Reflexive relation using on matrix

A relation is reflexive if and only if all diagonal elements of its matrix are 1.
For a matrix MR, if MR[i][i]=1 for all i, then the relation is reflexive.
Examples of reflexive relations:
The relation ≥(“is greater then or equal to”)on the set of real numbers.
Similarity of triangles.
The relation R = {(1,1),(1,2),(2,2),(3,3),(3,1)} on the set A={1,2,3}.

MR =

Reflexive relations are always represented by a matrix that has 1 on the main
diagonal
2. Irreflexive Relation:
A relation R on a set A is called irreflexive if ∀a∈A, (a, a) ∉R.

Example: A = {1, 2, 3, 4}
R3 = {(1, 2), (2, 1), (3, 3), (4, 4)} is not irreflexive
because (3, 3) and (4, 4) is there in R3.

R4 = {(1, 2), (2, 1)} is irreflexive

• because ∀a∈A, (α, α) ∉R4

Irreflexive relation using on Matrix

A relation is irreflexive if and only if all diagonal elements of its matrix are 0.
For a matrix MR, if MR[i][i]=0 for all i, then the relation is irreflexive.
Examples of irreflexive relations:

The relation<(‘is less then”)on the set of real numbers.

Relation of one person being son of another person.
The relation R={(1,2),(2,1),(1,3),(2,3),(3,1)} on the set A = {1, 2, 3}.

M
R =

The matrix of an irreflexive relation has all 0 on its main diagonal.

3. Symmetric Relation:
A relation R on a set A is called symmetric if (b, a) ∈R holds when (a, b)∈R for all
a, b∈A
In other words, relation R on a set A is symmetric if ∀a∀b((a, b)∈R → (b,
a)∈R)

Example :Let A = {1, 2, 3, 4}

Relation R5 = {(1, 1), (1, 2), (2, 1), (2, 2)} is symmetric because
for every (a, b)∈R5 (b, a)∈R5
like (1, 2) (2, 1) is in R5.
There is no need to check for (1, 1), (2, 2).

Relation R₁ = {(1, 1), (1, 2), (1, 3), (1, 4)} is not symmetric because
for (1, 2) there is no (2, 1) in R6. Same is true for (1, 3) and (1, 4).
• Symmetric relation using on Matrix

Symmetry in the matrix is observed when M[i][j]=M[j][i] for all i and j. A

symmetric matrix corresponds to a symmetric relation.
Examples of symmetric relation:
The relation = (“is equal to”) on the set real number.
The relation “ is perpendicular to” on the set of straight lines in a plane.
The relation R = {(1,1),(1,2),(2,1),(1,3),(3,1)} on the set A= {1, 2, 3}.

MR =

main diagonal. The transpose of the matrix 𝑀𝑇 is always equal to the

For a symmetric relation, the logical matrix M is symmetric about the
4. Asymmetric Relation:
A relation R on a set A is called asymmetric if ∀a∀b((a, b)∈R → (b, a) ∉R)

Example: A = {1, 2, 3, 4}
R10= {(1, 1), (1, 2), (1, 3)} is not an asymmetric relation because
of (1, 1).

R11 = {(1, 2), (1, 3), (2, 3)} is an asymmetric relation.

• Asymmetric relation using in Matrix

Asymmetry is observed when M[i][j]=1 implies M[j][i]=0. An

asymmetric matrix corresponds to an asymmetric relation.
 Examples of asymmetric relation:

The relation > (“is greater than”) on the set of real numbers.

The family relation “ is father of”.

The relation R = {(2,1),(2,3),(3,1)} on the set A = {1, 2, 3}.

M =
R

The matrix for an asymmetric relation is not symmetric with respect to the main diagonal and
contains no diagonal elements
5. Antisymmetric Relation:
A relation R on a set A is called antisymmetric if ∀a∀b((a, b)∈R ∧(b, a)∈R → (a =
b)) Whenever we have (a, b) in R, we will never have (b, a) in R until or
unless (a = b)

Example :Let A = {1, 2, 3, 4}

Relation R₁ = {(1, 1), (2, 1)} on set A is antisymmetric because
(2, 1) is in R7 but (1, 2) is not in R.
• Antisymmetric relation using in matrix

The matrix MR satisfies the antisymmetric property because whenever MR [i][j]=1 and
MR[j][i]=1, it implies i=j Antisymmetric matrices represent antisymmetric relations.
 Examples of antisymmetric relation:

The relation ≥ (“is greater then or equal to”) on the set of real numbers.

The subset relation ⊆ on a power set.

The relation R = {(1,1),(2,1),(2,3),(3,1),(3,3)} on the set A = {1, 2, 3}.

M =
R

In a matrix M = [aij] representing an antisymmetric relation R, all elements

symmetric about the main diagonal are not equal to each other: aij≠aji for i≠j.
6. Transitive Relations:
A relation R on a set A is called transitive if ∀a∀b∀c (((a, b)∈R ∧ (b,
c)∈R)→(a,c) ∈R)

Example: A = {1, 2, 3, 4}
R8 ={(2, 1), (3, 1), (3, 2), (4, 4)} is transitive because (3, 2), (2,
1), and (3, 1) are there in R8.

R9 = {(2, 1), (1, 3)} is not transitive as (2, 1) and (1, 3) are
there in R, but there is no (2, 3) in relation R9.
• Transitive relation using on Matrix
Transitivity can be inferred by checking whether, for every pair M[i][j]=1 and M[j]
[k]=1, it implies M[i][k]=1. A transitive relation is reflected in the matrix.

Examples of transitive relation:

The relation > (“is greater than”) on the set of real numbers.

The relation “ is parallel to “ on the set of straight lines.

The relation R = {(1,2) , (1,3) , (2,2) , (2,3) , (3,3)} on the set A = {1, 2, 3}.

M =
R

In a matrix M=[aij] of a transitive relation R, for each

pair of (i,j)− and (j,k)−entries with value 1 there exists the (i,k)−entry
Application of matrix representation of
relation:-

1. The matrix algorithm have efficiently manipulate your data.

2. A computer can do image processing and genetic analysis.

3. Matrices are also useful in electrical circuits

4. One application of matrices is in games

THANK YOU…