Relatio

ns
 2 Relations

Contents
 Relations and Its Introduction
 Representation of Relations:
- Using Matrices
- Using Diagraph
 Properties of Relations
 Inverse and Complementary Relations
 Combining Relations
 Composite Relations
 Equivalence Relations
 Equivalence Classes
 Equivalence Relations and Partitions
 Closure of Relations
 Warshall’s Algorithm
 Partial Ordering and Partially Ordered Set
 Lexicographic Ordering
 Hasse diagram
 Topological Sorting
 Lattices
 Special Types of Lattices
UCS405: Discrete Mathematical Structures
 3 Relations

Partial Ordering
 A relation on a set is called a partial ordering, or
partial order, if it is:

 Reflexive
 Antisymmetric
 Transitive

 A set together with a partial order relation , defined

on it, is called a partially ordered set, or poset,
and is denoted by Members of Pare called elements
of the poset.
UCS405: Discrete Mathematical Structures
 4 Relations

Examples

UCS405: Discrete Mathematical Structures

 5 Relations

Examples (Cont..)

is a POSET.

UCS405: Discrete Mathematical Structures

 6 Relations

Examples (Cont..)
3. Show that the inclusion relation (⊆) is a partial
ordering on the power set of a set S.

 Reflexive?
 Antisymmetric?
 Transitive?

UCS405: Discrete Mathematical Structures

 7 Relations

Comparability
 The elements a and b of a poset (P,≼) are
comparable if either a ≼ b or b ≼ a.

 When a and b are elements of P so that neither a ≼

b nor b ≼ a, then a and b are called incomparable.

The symbol ≼ is used to denote the relation in

any poset.

UCS405: Discrete Mathematical Structures

 8

Comparability (Cont..)
 If (P,≼ ) is a poset and every two elements of P are
comparable, P is called a totally ordered or
linearly ordered set, and ≼ is called a total
order or a linear order.

 A totally ordered set is also called a chain.

 (P,≼ ) is a well-ordered set if it is a poset such that

≼ is a total ordering and every nonempty subset of
P has a least element.

UCS405: Discrete Mathematical Structures

 9 Relations

Lexicographic Ordering

UCS405: Discrete Mathematical Structures

 10

Examples
1. Consider strings of lowercase English letters.

A lexicographic ordering can be defined using the

ordering of the letters in the alphabet.

This is the same ordering as that used in dictionaries.

discreet ≺ discrete, because these strings differ in the

seventh position and e ≺ t.


discreet ≺ discretion, because the first six letters agree,

but the strings differ in the seventh position and e ≺ t.


UCS405: Discrete Mathematical Structures

 11

Examples (Cont..)

UCS405: Discrete Mathematical Structures

 12 Relations

Hasse Diagram
 A Hasse diagram is a visual representation of a
partial ordering that leaves out edges that must be
present because of the reflexive and transitive
properties.

UCS405: Discrete Mathematical Structures

 13 Relations

Procedure for drawing a Hasse

Diagram
 To represent a finite poset (S,≼ ) using a Hasse
diagram, start with the directed graph of the relation:

 Remove the loops (a, a) present at every vertex due

to the reflexive property.
 Remove all edges (x, y) for which there is an element
z ∈ S such that x ≺ z and z ≺ y. These are the
edges that must be present due to the transitive
property.
 Arrange each edge so that its initial vertex is below
the terminal vertex. Remove all the arrows, because
all edges point upwards toward their terminal vertex.

UCS405: Discrete Mathematical Structures

14 Relations

UCS405: Discrete Mathematical Structures

15 Relations

UCS405: Discrete Mathematical Structures

16 Relations

UCS405: Discrete Mathematical Structures

17

UCS405: Discrete Mathematical Structures

 18 Relations

Topological Sorting

UCS405: Discrete Mathematical Structures

 19 Relations

Extremal Elements of POSET

 Maximal Element

 Minimal element

UCS405: Discrete Mathematical Structures

 20 Relations

Maximal and Minimal Elements

UCS405: Discrete Mathematical Structures

 21 Relations

Examples

Infinite series

UCS405: Discrete Mathematical Structures

 22 Relations

Greatest Element and

Least Element

0 - Zero Element

UCS405: Discrete Mathematical Structures

 23 Relations

Examples

UCS405: Discrete Mathematical Structures

 24 Relations

Upper Bound and Lower Bound

UCS405: Discrete Mathematical Structures

 25 Relations

Greatest Lower Bound (GLB)

UCS405: Discrete Mathematical Structures

 26 Relations

Least Upper Bound (LUB)

UCS405: Discrete Mathematical Structures

 27 Relations

Examples

UCS405: Discrete Mathematical Structures

 28 Relations

Lattice

UCS405: Discrete Mathematical Structures

 29 Relations

Examples

UCS405: Discrete Mathematical Structures

 30 Relations

Examples

UCS405: Discrete Mathematical Structures

 31 Relations

Special Types of Lattices

 Bounded Lattice

 Distributive Lattice

 Complemented Lattice

 Boolean Lattice

UCS405: Discrete Mathematical Structures

 32 Relations

Bounded Lattice

Only least element is

there with the value
1. No greatest
element.

UCS405: Discrete Mathematical Structures

 33 Relations

Examples (Cont..)

Neither least element

nor greatest element.

least element is ∅
and greatest element
is the set S itself.

UCS405: Discrete Mathematical Structures

 34 Relations

Distributive Lattice

UCS405: Discrete Mathematical Structures

 35 Relations

Examples

Only two operations are

there i.e. union and
intersection. These both
operations are distributive.

How?

UCS405: Discrete Mathematical Structures

 36 Relations

Complemented Lattice

UCS405: Discrete Mathematical Structures

 37 Relations

Examples

𝑎
𝑐 𝑏

UCS405: Discrete Mathematical Structures

 38 Relations

Boolean Lattice

UCS405: Discrete Mathematical Structures