Amity School of Engineering & Technology (CSE)
Discrete Mathematics
Module II
Types of Relation
1
Amity School of Engineering & Technology (CSE)
Module I:
Types of Relation
2
Amity School of Engineering & Technology (CSE)
OBJECTIVES
After completing this section, you will be able to
Differentiate between various types of Relations
Relate types of relation with Directed graphs
3
Amity School of Engineering & Technology (CSE)
Types of Relations
4
Amity School of Engineering & Technology (CSE)
Types of Relations
Let A be a given non empty set then a relation RAA is called a
binary relation on A.
Binary relations that satisfy certain special properties can be very
useful in solving computation problems. So let’s discuss some of
these properties:
We have following types of properties in a (Binary) relation on a
given set A.
1. Reflexive
2. Irreflexive
3. Symmetric
4. Asymmetric
5. Anti-symmetric
6. Transitive
5
Amity School of Engineering & Technology (CSE)
Types of Relation
Reflexive
A relation R on a set A is reflexive if for every aA, aRa. that is, a
relation R in a set A is said to be reflexive if every element of A is related
to itself i.e. aRa is true for every aA.
Definition2: (In terms of directed graph): R is reflexive if there must
be a loop at each node aA.
Example:
Example1: Let A be the set of all straight lines in a plane. The relation R
“x is parallel to y” is reflexive since every straight line is parallel to itself.
Example2: Let A be the set of numbers and relation R in A is defined by
“x is equal to y” is reflexive” since each number is equal to itself.
Example3: Let A={1,2,3} and the relation R in A is defined by R={(1,1),
(2,2),(2,3)} is not reflexive because (3,3) does not belongs to R. The
given relation R will be reflexive, if every ordered pair (a,a)R for all aA.
6
Amity School of Engineering & Technology (CSE)
Types of Relation..
Irreflexive Relations
A relations R on a set is irreflexive if (a, a)R for every a є A. Thus R is
not irreflexive if there exist at least one aA such that (a, a)R.
Definition2: (In terms of directed graph): R is Irreflexive if there is no
loop at any node aA.
Note: No self loop allowed
Example:
Example1: Let A= {1,2,3} and let R= {(1, 1),(3,2)}.
Here R is not reflexive since (2,2) or (3,3)R. Also R is not irreflexive,
since (1, 1)R.
Example2: Let A={a,b,c}be a non empty set. Let R={(a,b),(b,c),(c,a)}
Here R is irreflexive since (a,a) )R for every aA. Also note that there is
no loop at any node.
7
Amity School of Engineering & Technology (CSE)
Types of Relation
Symmetric Relation
A relation R on a set A is symmetric if a,b in A, if aRb, then bRa. In
other words a relation R is symmetric if in R whenever (a, b)R then (b,
a)R.
Thus R is not symmetric if there exists a, bA such that (a, b)R but (b,
a)R.
Example
Example1: Let A={set of all straight lines in a plane}. The Relation R on A
is defined by “ a is perpendicular to be” is a symmetric relation because
ab ba.
Example2: Let N={set of Natural numbers}. The Relation R on N is
defined by “ a is equal to b” is symmetric since aRbbRa.
8
Amity School of Engineering & Technology (CSE)
Types of Relation
Asymmetric Relation
A relation R on a set A is symmetric if a,b in A, if aRb, then bRa in not
allowed. In other words a relation R is Asymmetric if in R whenever (a,
b)R then (b, a)R.
Thus R is not symmetric if there exists a, bA such that (a, b)R but (b,
a)R.
Note: No bidirectional arrow.
Example
Example1: Let A={set of all straight lines in a plane}. The Relation R on A
is defined by “ a is perpendicular to be” is a symmetric relation because
ab ba.
Example2: Let N={set of Natural numbers}. The Relation R on N is
defined by “ a is equal to b” is symmetric since aRbbRa.
9
Amity School of Engineering & Technology (CSE)
Types of Relation
Anti-Symmetric Relation
A relation R on a set A is anti-symmetric if whenever aRb and bRa then
a = b. That is if (a,b),(b,a)R then there must be the case that a=b. Thus
R is not antisymmetric if there exists a, bA such that (a, b) and (b, a)
belong to R, but
a≠b
Note: No Bi-directional arrow except self loop.
Example
Let A be a set of positive integers and R be a relation on A such that
R={(a,b): a,bA and ab}. This relation R is an anti-symmetric relation
because if (a,b),(b,a)R a=b
10
Amity School of Engineering & Technology (CSE)
Types of Relation
Transitive Relation
A relation R on a set A is said to be transitive if (a,b)R and (b,c)R
(a,c)R, for all a,b,cA.
In other words relation R is transitive if aRb and bRc implies that aRc, for
all a,b,cA
Thus R is not transitive if there exist a, b, c A such that (a, b), (b, c)R
but (a, c)R.
Example
Consider the following five relations on the set A = {1, 2, 3, 4, 5}:
R = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3), (4, 4)}
This relation is Transitive
11
Amity School of Engineering & Technology (CSE)
Summary
A relation R on a set A is called reflexive if there is a self loop
at each node in directed graph of a relation.
A relation R on a set A is called symmetric if there is an arrow
from then there is a return arrow from .
A relation R on a set A is said to be transitive if there is an
arrow from then there is an arrow from .
12
Amity School of Engineering & Technology (CSE)
13
