IO N S

AT
REL
“MISTAK
ES are pro
you are TR of that
YING”
ns,
o n , Partitio
ti
s , C omposi Order
rt i e a n d
Prope quivalence
E
 CONTENTS:
Closure Property
Relation
Composition of Relations
Properties of Relations
Partitions
Equivalence Relations
Order Relations (Partial and Strict)
 Closure Property
rm ing an o p e ra ti on o n any
If perfo
ys
two numbers in a set alwa
lts in a n um b e r in t ha t se t,
resu
t
the set is closed under tha
operation.
 To test if the set is closed:

1. Identify the 3. Perform the

set of numbers 2. Choose two given
and the numbers from operation and
operations the set. check for
involved. closure.
*If the result is not within the set, you have a counter example.
Identify closure property of a set.

Is the sum of two odd whole

numbers always odd?
Identify closure property of a set.

Is the set of whole numbers

closed under addition?
RELATIONS
Set of ordered pairs
that satisfies a
relationship.
 COMPOSITION OF
RELATIONS
Forming a new binary relation R; S from
two given binary relations R and S.
 Let A B C be three sets, suppose R is a relation
from A to B and S is a relation from B to C. The
composite of R and S, denoted by SoR, is a
binary relation from A to C consisting of
ordered pairs (a,c) where a ∈ A and c ∈ C. Also
b ∈ B such that (a,b) ∈ R and (b,c) ∈ S.
What is the composite
relations of R and S, Find composite of R
where R is the relation and S= SoR using an
from set A={1, 2, 3} to set
B={3, 4, 5} with R={(1,3),
arrow diagram
(1,4), (1,5), (2,3), (3,3)}
and S is the relation from
set B={3, 4, 5} to set C={1,
2, 3, 4} with S={(3,1),
(3,2), (3,3), (4,3), (4,4)}?
 *IF R AND S A
RELATION RE
S FROM A
B AND C T TO
RESPECTI OD
V EL Y , T H
SoR IS NO EN
T DEFINE
UNLESS B D
=C
PROPERTIES
OF
RELATION
Reflexive Property Transitive Property
Symmetric Property
 Arelation R on A relation R on A
 A relation R on A is is transitive if and
A is reflexive if symmetric if and only if for all
and only if for all only if for all a,b,c∈A , if aRb
a∈A, aRa. a,b∈A, if aRb, then and bRc , then aRc .
bRa.
 Partitions and Relation
induced by this Relation
 Partitions
1. Collection of non empty subsets of
S.
2. Every element of S is in exactly one
element of P.
 EQUIVALENCE RELATIONS
In mathematics, an equivalence
relation is a binary relation that is
reflexive, symmetric and transitive.
 A relation R on a set A is called an equivalence
relation if it satisfies following three properties:
Relation R is Reflexive, i.e. aRa ∀ a∈A.
Relation R is Symmetric, i.e., aRb ⟹ bRa
Relation R is transitive, i.e., aRb and bRc ⟹ aRc.
 PARTIAL ORDER RELATIONS
In mathematics, an equivalence
relation is a binary relation that is
reflexive, anti symmetric and
transitive.
 STRICT PARTIAL ORDER
RELATIONS
In mathematics, an equivalence
relation is a binary relation that is
irreflexive, anti symmetric and
transitive.