Module 4: Lattices

Partially Ordered Relations -Lattices as Posets –

Hasse Diagram – Properties of Lattices – Boolean
algebra-Properties of Boolean Algebra-Boolean
functions.

Module 4 1
Module 4 2
Module 4 3
Module 4 4
Module 4 5
(2)

Module 4 6
Module 4 7
Module 4 8
Module 4 9
Module 4 10
Module 4 11
Module 4 12
Not symmetric

Module 4 13
Hasse Diagram

Module 4 14
Poset: A binary relation is an partial order or Poset if it is
reflexive, antisymmetric and transitive. If R is a partial
order over the set S, we also say, “S is a partially ordered set”
or “S is a poset”. To emphasize both S and R we write (𝑆, 𝑅)
and call it a poset.
Examples:

• 𝑵, 𝑎 ≤ 𝑏

• 𝑵, 𝑎 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑏
• ( 𝑝𝑜𝑤𝑒𝑟({𝑎, 𝑏, 𝑐}), )

Module 4 15
 Motivation
• Many edges in the directed graph for a finite poset do not have to be
shown because they must be present.
• For instance, consider the directed graph for the partial ordering
𝑅 = {(𝑎, 𝑏) | 𝑎 ≤ 𝑏} on the set 𝑆 = {1, 2, 3, 4}, shown in Figure.
• Because this relation is a partial ordering, it is reflexive and
transitive, we do not have to show those loops and those edges that
must be present because of transitivity.

Module 4 16
 Procedure to draw Hasse Diagram
• Start with the directed graph of finite poset 𝑺, ≤ .

• Remove the loops at each vertex (Reflexive).

• Remove all the directed edges which is present due to the transitive
relation.

• Arrange each edge such that all the edges point upwards.

• Finally, remove all the arrow heads.

• The resulting diagram is called the Hasse diagram of (𝑆, ≤).

Module 4 17
An element x is an immediate predecessor of y or y is an immediate
successor of x if {z | x < z < y} = .

Poset Diagram (Hasse Diagram): A graph representing a poset but

with only immediate predecessor edges, and the edges are oriented up
from x to y when x < y.

Example: The poset (power({a, b, c}),  ) has the poset diagram

shown below

Hasse Diagram {a, b, c}

{a, b} {a, c} {b, c}

{a} {b} {c}


Module 4 18
Problem 1: Draw the Hasse diagram representing the partial ordering
R = {(𝑎, 𝑏) |𝑎 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑏} on the set 𝑆 ={1, 2, 3, 4, 6, 8, 12}.

Module 4 19
 Hasse Diagram
Module 4 20
 Maximal and Minimal Element

• Maximal element: An element of a poset is called maximal if it is

not less than any element of the poset. That is, a is maximal in the
poset (𝑆, ≤) if there is no 𝑏 ∈ 𝑆 such that 𝑎 < 𝑏.
• Minimal element: An element of a poset is called minimal if it is
not greater than any element of the poset. That is, a is 𝒎𝒊𝒏𝒊𝒎𝒂𝒍 if
there is no element 𝑏 ∈ 𝑆 such that 𝑏 < 𝑎.
Maximal and minimal elements are easy to spot using a Hasse diagram.
They are the “top” and “bottom” elements in the diagram.

Note: The symbols < and ≤ are used as a general symbols for partial orders.
Module 4 21
Figure 1: Figure 2:

Module 4 22
 Greatest and Least Element

• Greatest element: An element is called the greatest element if it

is greater than all the other elements in the poset. That is, a is the
greatest element of the poset (𝑆, ≤) if 𝑏 ≤ 𝑎 for all 𝑏 ∈ 𝑆. The
greatest element is unique when it exists.

• Least element: An element is called the least element if it is less

than all the other elements in the poset. That is, a is the least
element of (𝑆, ≤) if 𝑎 ≤ 𝑏 for all 𝑏 ∈ 𝑆. The least element is
unique when it exists.

Module 4 23
 Find the maximal, minimal, greatest and least Element
of the following graphs

Maximal = {b, c, d} Maximal = {d, e} Maximal = {d} Maximal = {d}

Minimal = { a } Minimal = { a, b} Minimal = { a, b} Minimal = { a}
Greatest = Does not Greatest = Does not Greatest = {d} Greatest = {d}
exist exist Least = Does not Least = {a}
Least = {a} Least = Does not exist
exist
Module 4 24
Upper Bound: If u is an element of S such that 𝑎 ≤ 𝑢 for all elements
a ∈ A, then u is called an upper bound of A.
Lower Bound: If l is an element of S such that 𝑙 ≤ 𝑎 for all elements
a ∈ A, then l is called a lower bound of A.

Least upper bound: The element x is called the least upper bound of
the subset A if x is an upper bound that is less than every other upper
bound of A. The least upper bound of A is unique if it exists.
Greatest lower bound: The element y is called the greatest lower
bound of A if y is a lower bound of A and 𝑧 ≤ 𝑦 whenever 𝑧 is a lower
bound of A. The greatest lower bound of A is unique if it exists.

Dr. R. Jayagopal_BMAT205L_Module 4 25
Problem 1: Find the lower bounds, upper bounds, greatest lower
bound and least upper bound of the subsets {b, c}, {a, b, d}, {j, h},
and {c, d, f } in the poset with the Hasse diagram given below.

Dr. R. Jayagopal_BMAT205L_Module 4 26
Problem 2: Draw the Hasse diagram for 𝑆110 (set of divisors of 110)
with respect to “divisibility” relation.

Solution: 𝑺𝟏𝟏𝟎 = {𝟏, 𝟐, 𝟓, 𝟏𝟎, 𝟏𝟏, 𝟐𝟐, 𝟓𝟓, 𝟏𝟏𝟎}

110

10 22 55

2 5 11

1
Dr. R. Jayagopal_BMAT205L_Module 4 27
 Maximal Element 110
Minimal Element 1
Greatest 110
Least 1
Upper bound of {2, 11} 22 and 110
Least upper bound of {2, 11} 22
Lower bound of {10, 55} 5 and 1
Greatest lower bound
Dr. R.of {10, 55}
Jayagopal_BMAT205L_Module 4 5 28
Problem 3: Draw the Hasse diagram for 𝐷30 with a relation 𝑥 ≤ 𝑦 if
and only if 𝑥 divides 𝑦.

Solution: 𝑫𝟑𝟎 = {𝟏, 𝟐, 𝟑, 𝟓, 𝟔, 𝟏𝟎, 𝟏𝟓, 𝟑𝟎}

30

6 10 15

2 3 5

1
Dr. R. Jayagopal_BMAT205L_Module 4 29
 Maximal Element 30
Minimal Element 1
Greatest 30
Least 1
Upper bound of {2, 5} 10 and 30
Least upper bound of {2, 5 } 10
Lower bound of {6, 15} 3 and 1
Greatest lower bound
Dr. R.of {6, 15}
Jayagopal_BMAT205L_Module 4 3 30
 Lattice

Dr. R. Jayagopal_BMAT205L_Module 4 31
1 A lattice is denoted by 𝐿, +, . 𝑜𝑟 (𝐿, ∨, ∧)

Dr. R. Jayagopal_BMAT205L_Module 4 32
Tocheckforalattice, consider
itisenoughto pairwiseunrelatedelements.
Dr. R. Jayagopal_BMAT205L_Module 4 33
To check for a lattice, it is enough to consider
pairwise unrelated elements.

Dr. R. Jayagopal_BMAT205L_Module 4 34
Dr. R. Jayagopal_BMAT205L_Module 4 35
Dr. R. Jayagopal_BMAT205L_Module 4 36
 Problems

Dr. R. Jayagopal_BMAT205L_Module 4 37
Dr. R. Jayagopal_BMAT205L_Module 4 38
Dr. R. Jayagopal_BMAT205L_Module 4 39
Problem 2: Draw the Hasse diagram for 𝑆110 (set of divisors of 110)
with respect to “divisibility” relation and check whether it is a lattice.

Solution: 𝑺𝟏𝟏𝟎 = {𝟏, 𝟐, 𝟓, 𝟏𝟎, 𝟏𝟏, 𝟐𝟐, 𝟓𝟓, 𝟏𝟏𝟎}

110

10 22 55

2 5 11

1
Dr. R. Jayagopal_BMAT205L_Module 4 40
Dr. R. Jayagopal_BMAT205L_Module 4 41
Dr. R. Jayagopal_BMAT205L_Module 4 42
Dr. R. Jayagopal_BMAT205L_Module 4 43
Dr. R. Jayagopal_BMAT205L_Module 4 44
Dr. R. Jayagopal_BMAT205L_Module 4 45
Note: A bounded lattice is denoted by 𝐿, +, . , 0, 1 𝑜𝑟 (𝐿, ∨, ∧, 0, 1)

Dr. R. Jayagopal_BMAT205L_Module 4 46
Dr. R. Jayagopal_BMAT205L_Module 4 47
Dr. R. Jayagopal_BMAT205L_Module 4 48
Dr. R. Jayagopal_BMAT205L_Module 4 49
Dr. R. Jayagopal_BMAT205L_Module 4 50
Dr. R. Jayagopal_BMAT205L_Module 4 51
Dr. R. Jayagopal_BMAT205L_Module 4 52
Dr. R. Jayagopal_BMAT205L_Module 4 53
Dr. R. Jayagopal_BMAT205L_Module 4 54
Dr. R. Jayagopal_BMAT205L_Module 4 55
Dr. R. Jayagopal_BMAT205L_Module 4 56
 Definition

1 A lattice is denoted by 𝐿, +, . 𝑜𝑟 (𝐿, ∨, ∧)

Dr. R. Jayagopal_BMAT205L_Module 4 57
 Problem

Dr. R. Jayagopal_BMAT205L_Module 4 58
Dr. R. Jayagopal_BMAT205L_Module 4 59
Dr. R. Jayagopal_BMAT205L_Module 4 60
Practice Problems

Dr. R. Jayagopal_BMAT205L_Module 4 61
Dr. R. Jayagopal_BMAT205L_Module 4 62
Boolean Algebra

Dr. R. Jayagopal_BMAT205L_Module 4 63
Dr. R. Jayagopal_BMAT205L_Module 4 64
Dr. R. Jayagopal_BMAT205L_Module 4 65
Dr. R. Jayagopal_BMAT205L_Module 4 66
Dr. R. Jayagopal_BMAT205L_Module 4 67
Dr. R. Jayagopal_BMAT205L_Module 4 68
Dr. R. Jayagopal_BMAT205L_Module 4 69
Dr. R. Jayagopal_BMAT205L_Module 4 70
Dr. R. Jayagopal_BMAT205L_Module 4 71
Dr. R. Jayagopal_BMAT205L_Module 4 72
Dr. R. Jayagopal_BMAT205L_Module 4 73
Dr. R. Jayagopal_BMAT205L_Module 4 74
Type 3: Problems

Dr. R. Jayagopal_BMAT205L_Module 4 75
Dr. R. Jayagopal_BMAT205L_Module 4 76
Dr. R. Jayagopal_BMAT205L_Module 4 77
Dr. R. Jayagopal_BMAT205L_Module 4 78
Dr. R. Jayagopal_BMAT205L_Module 4 79
Dr. R. Jayagopal_BMAT205L_Module 4 80
Dr. R. Jayagopal_BMAT205L_Module 4 81
Dr. R. Jayagopal_BMAT205L_Module 4 82
Thank You

Dr. R. Jayagopal_BMAT205L_Module 4 83