Relation

A Relation R from a non-empty set A to a non

empty set B is a subset of the Cartesian product
set A × B. The subset is derived by describing a
relationship between the first element and the
second element of the ordered pairs in A × B.
The set of all first elements in a relation R, is
called the domain of the relation R, and the set
of all second elements called images, is called
the range of R.
For example, set R = {(1, 2), (– 2, 3), ( 1 2 , 3)} is
a relation; the domain of R = {1, – 2, 1 2 } and
the range of R = {2, 3}.
Let A and B be any two non
empty sets . A relation R from A
to B is subset of A B. If R A B
and (a,b) R , then we say that a
is relate to b by R and write
aRb.If a is not related to b by R
then we write aRb .
• (i) A relation may be represented either by the
Roster form or by the set builder form, or by
an arrow diagram which is a visual
representation of a relation. (ii) If n (A) = p, n
(B) = q; then the n (A × B) = pq and the total
number of possible relations from the set A to
set B = 2pq
Main Ideas and Ways How to Write or Represent Relations

• As long as the numbers come in pairs, then

that becomes a relation. If you can write a
bunch of points (ordered pairs) then you
already know how a relation looks like. For
instance, here we have a relation that has five
ordered pairs. Writing this in set notation
using curly braces,
• Relation in set notation:
• However, aside from set notation, there are
other ways to write this same relation. We can
show it in a table, plot it on the xy-axis, and
express it using a mapping diagram.
• Relation in table
• Relation in graph
• Relation in mapping diagram
• We can also describe the domain and range of a
given relation.
• The domain is the set of all x or input values. We
may describe it as the collection of the first
values in the ordered pairs.
• The range is the set of all y or output values. We
may describe it as the collection of the second
values in the ordered
• So then in the relation , our
domain and range are as follows
 Types of relation
• Reflexive Relation:
• Symmetric Relation
• Transiitive Relation
• Irreflexive relation
• AntiSymmetric Relation
• Asymmetric relation
• Equivalence Relation
 Reflexive Relation

A relation R on a set A is called reflexive

if (a,a) € R holds for every element a € A .
i.e. Let S be relation set then aRa Є S
if set A = {a,b}
then S = {(a,a), (b,b)} is reflexive relation.
 Symmetric Relation

A relation R on a set A is called symmetric if (b,a)

€ R holds when (a,b) € R.
i.e. If S be relation set and if
aRb Є S then bRa Є S
The relation R={(4,5),(5,4),(6,5),(5,6)} on set
A={4,5,6} is symmetric.
 Transiitive Relation
• : A relation R on a set A is called transitive if
(a,b) € R and (b,c) € R then (a,c) € R for all a,b,c
€ A.
i.e. Relation R={(1,2),(2,3),(1,3)} on set A={1,2,3}
is transitive.
 Irreflexive relation
• : A relation R on a set A is called irreflexive if
no (a,a) € R holds for every element a € A.
i.e. if set A = {a,b} then R = {(a,b), (b,a)} is
irreflexive relation.
 AntiSymmetric Relation
A relation R on a set A is called antisymmetric if
(a,b)€ R and (b,a) € R then a = b is called
antisymmetric.i.e.
The relation R = {(a,b)→R|a ≤ b} is anti-
symmetric since a ≤ b and b ≤ a implies a = b.
 Asymmetric relation
Asymmetric relation is opposite of symmetric
relation. A relation R on a set A is called
asymmetric if no (b,a) € R when (a,b) € R.
 Equivalence Relation
A relation is an Equivalence Relation if it is
reflexive, symmetric, and transitive. i.e.
relation R={(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),
(3,2),(1,3),
(3,1)} on set A={1,2,3} is equivalence relation
as it is reflexive, symmetric, and transitive.
 Compatible relation
A relation R defined on a set A is said to be
compatible if it is both reflexive and
symmetric.
(a,a) R , a,b A
(a,b) R , (b,c) R (a,c) R , a,b A
 Universal Relation
A relation R defined on a set A is said
to be universal relation R = A A
Ex.
Let A = { a,b,c}
R = { (a,a), (a,b),(a,c),(b,a), (b,b), (b,c) ,
(c,a), (c,b) , (c,c)} is a universal
relation on A.
 Partial order Relation
A relation R defined on a set A is called partial order
relation if it is reflexive , anti-symmetric and transitive
.
i.e.
(a,a) R , a,b A
(a,b) R, (b,a) R a,b A
(a,b) R , (b,c) R (a,c) R , a,b A
A set “A” together with a patial order relation R is
called partially ordered set or poset.
 Transitive Extension
Let R be relation defined on a set A. Then a relation R
defined on the set A is called the transitive extension
of R if R and (a,b) R , (b,c) R (a,c)
Ex.
Let A = { a,b,c,d} and
Let R = { (a,b) , (b,c) , (c,d), (b,d)}
= {(a,b) , (b,c) , (a,c) , (c,d), (b,d) ,(a,d)}
Here R and (a,b) R , (b,c) R (a,c)
transitive extension of R.
 Transitive closer
Let R be a relation defined on a set A.
Letdenote transitive closer of R , denote
transitive closer of , denote transitive
closer of ………, denote transitive closer of ,
then transitive closer of R is defined as the
union of , , ,……..It is denoted by

= R ……. …….
 Questions
1.Find the range and domain of the following
S

2. If both A and B are reflexive , symmetric and

transitive then prove that A B is also reflexive ,
symmetric and transitive
3.Prove that R is reflexive but not symmetric.
4. If Z is a set of integers and a,bZ, aRb if b= for
some integer r then show that R is a partial
order on Z.
 Questions
5. Define a relation on the set S = {1 ,2,3,4} , which
is (i) Reflexive , symmetric but not transitive (ii)
Reflexive , transitive but not symmetric.
6. A relation R is defined by R = . Show that R is a
partial order relation . Is this relation compatible?
7. Let R denote a relation on the set of ordered pairs
of positive integers defined by ( x,y) R (u,v) if and
only if xv=yu. Show that R is equivalence relation .
 Converse Of relation
Let R be a relation defined from A to B Then
a relation defined from B to A is called
converse of relation R and it is denoted by
(x,y) / (y,x) it is also denoted by .
If x
Q. The relation matrices of two relation R
and S are given by

Find R, S , RoS and how that RoS is not

equivalence relation.
Q. Let A = { 1,2,3} . The relation matrices
and are given by

Find ,,
,, ,
Q. A relation R is defined on a set A
where A = { 1,2,3,4,5} and R = { (1,2),
(1,6), (2,3),(3,3), (3,4), (4,1), (4,3),(4,5),
(6,4)}. Draw the graph of R and . Also find
the matrix for .
Q Let A= { 1,2,3} , B ={a,b,c,d}. Let R and S
be relation from A to B with relation
matrices given by

Find (i)
(ii) Find
(iii) Show that
Q. For relation R = { (1,2),(2,3), (3,4),(2,1)}
find and draw the graph. Also find transitive
closure of R.

Q . Let X = { ball, bed, dog, egg,let} and

R = { (x,y)| x,yxRy if x and y contain same
common letter}
Find . Draw the graph of R . Prove that R is
compatible but not transitive.