Scribd
Upload
27 views3 pages

Types of Relations in Set Theory

The document defines and provides examples of several types of relations: - Universal relation: Includes all possible ordered pairs from a set. - Identity relation: Relates each element only to itself. - Reflexive relation: Relates each element to itself, and possibly others. - Symmetric relation: If (a,b) is in the relation, then (b,a) is also in the relation. - Inverse relation: Swaps the elements in each ordered pair of a given relation. - Transitive relation: If (a,b) and (b,c) are in the relation, then (a,c) is also in the relation. - Equ

Uploaded by

Saim Lovely Sulman
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
27 views3 pages

Types of Relations in Set Theory

The document defines and provides examples of several types of relations: - Universal relation: Includes all possible ordered pairs from a set. - Identity relation: Relates each element only to itself. - Reflexive relation: Relates each element to itself, and possibly others. - Symmetric relation: If (a,b) is in the relation, then (b,a) is also in the relation. - Inverse relation: Swaps the elements in each ordered pair of a given relation. - Transitive relation: If (a,b) and (b,c) are in the relation, then (a,c) is also in the relation. - Equ

Uploaded by

Saim Lovely Sulman
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

Universal relation: The relation consists of all ordered pairs of the Cartesian product

“ A×A ”.

That is R=A×A

Consider a set A={1,2,3}. Then, universal relation set is:

R={(1,1),(1,2),(1,3),(2,1),(2,2),(2,3),(3,1),(3,2),(3,3)}

Identity relation: In an identity relation "R", every element of the set “A” is related to
itself only.

Consider a set A={1,2,3}. Then, its identity relation is R = {(1,1) ,(2,2) ,(3,3) }

R = {(x , x): " x �A}

Reflexive relation: In reflexive relation, "R", every element of the set “A” is related to
itself.

Consider a set A={1,2,3}. Then relation is

R={(1,1),(2,2),(3,3),(1,2),(1,3)}

Now

R1={(1,1),(2,2),(1,2),(1,3) } is not a reflexive relation.

We state the condition for reflexive relation R is reflexive if (x,x) � R,for all x " A

Symmetric relation:

In symmetric relation, the instance of relation has a mirror image. It means that if (1,3) is
an instance, then (3,1) is also an instance in the relation.

Some examples of the symmetric relation

R1={(1,2),(2,1),(1,3),(3,1)}

R2={(1,2),(1,3),(2,1),(3,1),(3,3)}

Inverse relation:
An inverse relation (that is R−1) consists of ordered pairs with exchange of positions of
the elements in a given relation (R).

R={(1,2),(1,3),(2,1),(3,1),(3,3)}

By definition, its inverse relation is :

R−1={(2,1),(3,1),(1,2),(1,3),(3,3)}

Transitive relation:

In words, we say that if (x,y) and (y,z) be the instances of a relation R such that (x,z) is
also the instance of the relation, then that relation is transitive.

Now in this example we have R3={(2,1),(2,4),(2,3),(3,4)} here we can see that we have
(2,3)€R3 and (3,4) €R3 then we also have (2,4) €R3 . So it satisfies our definition of transitive
hence R3 is transitive.

Equivalence relation:
A relation is equivalence relation if it is reflexive, symmetric and transitive at the same
time.

Example:

In each case, a relation on the set {1,2,3} is given. Of the three properties,
reflexivity, symmetry, and transitivity, determine which ones the relation has.

Give reasons for each of them.


(a) R = { (1,3), (3,1), (2,2) }.
(b) R = {(1, 1), (2,2), (3, 3), (1, 2)}.

Solution:
a)
It is Symmetry.
Because whever there is something like (a, b) we also have (b, a).
Here it is (1, 3) we also have (3, 1) and (2, 2).

b)
It is reflexive
Because for every 'a' we have (a, a).
Here it is (1, 1), (2,2), (3, 3)

Example:
Three relations are given on the set of all non-empty subsets of N.
In each case, say whether the relation is Reflexive or Symmetric or
it is Transitive.

(a) R is defined by: A R B if and only if A B.


(b) R is defined by: A R B if and only if if A B is not equal to NULL.
(c) R is defined by: A R B if and only if 1 A B.

Solution:

a) It is reflexive.
It is NOT symmetric.
It is transitive.

b) It is reflexive.
It is symmetric.
it is transitive.

c) It is NOT reflexive.
It is symmetric.
It is transitive.

You might also like