Module 3

Math006 – Discrete Mathematics

A Binary relation R on a single set A is defined as a subset of A x A . For
two distinct set, A and B with cardinalities m and n, the maximum
cardinality of the relation R from A to B is mn.
Let A={1,2,3,4 } and a , b ∈ A . Determine the binary
relations on A defined by the following:

a<b
a|b
 Properties of Relation
• Reflexive Relation: A relation R on a set A is said to be
reflexive if for every element a belongs to set A then (a,a)
belongs to the relation R. In symbol
 Properties of Relation
• Examples: Determine which of the following are reflexive
relation.
• 1. Consider the following relations on A={1,2,3,4}.
 Properties of Relation
• 2. Consider these relations on the set of integers:,
which among the relation is reflexive?
Properties of Relation
• Symmetric Relation: A relation R on a set A is said to be symmetric if for all
(a,b) belongs to set A then (a,b) must belong to relation R and (b,a) must
also belong to relation R. In symbol
 Properties of Relation
• 3. Consider these relations on the set of integers:,
which among the relation is symmetric?
Properties of Relation
• Anti-symmetric Relation: A relation R on a set A is said to be anti-symmetric
if for all (a,b) belongs to set A then if (a,b) belongs to R and (b,a) also
belongs to R until a = b. In symbol
 Properties of Relation
• 4. Consider these relations on the set of integers:,
which among the relation is anti-symmetric?
Properties of Relation
• Transitive Relation: A relation R on a set A is said to be transitive if
(a,b)belongs to R and (b,c)belongs to R then (a,c)belongs to R for all a,b,c
belongs to set A. In symbols
 Properties of Relation
• 4. Consider these relations on the set of integers:,
which among the relation is anti-symmetric?
Properties of Relation

•Equivalence Relation: A relation is an

Equivalence Relation if it is reflexive,
symmetric, and transitive.
•Partial Order Relation: A relation that is
reflexive, anti-symmetric, and transitive.
Equivalence Class
Equivalence Class
Equivalence Class
Equivalence Class
Let A = { 0 , 1 , 2 , 3 , 4 } and define a relation R on A as
follows:
Inverse and Complement of Relation
Let A = { 0 , 1 , 2 , 3 , 4 } and define a relation R on A as
follows: