23-09-2020

POSETS and LATTICES Introduction

 An equivalence relation is a relation that is
reflexive, symmetric, and transitive

 A partial ordering (or partial order) is a relation that

is reflexive, antisymmetric, and transitive
• Recall that antisymmetric means that if (a,b)  R, then
(b,a) R unless b = a
• Thus, (a,a) is allowed to be in R
• But since it’s reflexive, all possible (a,a) must be in R
Lecture #1

Lecture 1(1/15)

1 2

Partially Ordered Set (POSET) Example (1)

A relation R on a set S is called a partial ordering or partial Let S = {1, 2, 3} and

order if it is reflexive, antisymmetric, and transitive. A set S
let R = {(1,1), (2,2), (3,3), (1, 2), (3,1), (3,2)}
together with a partial ordering R is called a partially ordered
set, or poset, and is denoted by (S, R)

2
3

Lecture 1 (2/15) Lecture 1 (3/15)

3 4
 23-09-2020

Example
In a poset the notation a b denotes that (a , b)  R
Let S = {1, 2, 3} and
This notation is used because the “less than or let R = {(1,1), (2,2), (3,3), (1, 2), (3,1), (3,2)}
equal to” relation is a paradigm for a partial ordering.
(Note that the symbol is used to denote the
relation in any poset, not just the “less than or 2 2 3 2
equals” relation.) The notation a b denotes that 1
a b, but a  b

2
3

Lecture 1 (4/15) Lecture 1 (5/15)

5 6

Example (2) Example (3)

 Show that ≥ is a partial order on the set of integers
Consider the power set of {a, b, c} and the
• It is reflexive: a ≥ a for all a  Z subset relation. (P({a,b,c}),  )
• It is antisymmetric: if a ≥ b then the only way that
b ≥ a is when b = a Draw a graph of this relation.
• It is transitive: if a ≥ b and b ≥ c, then a ≥ c
 Note that ≥ is the partial ordering on the set of
integers
 (Z, ≥) is the partially ordered set, or poset

Lecture 1 (6/15) Lecture 1 (7/15)

7 8
 23-09-2020

Partial Ordering Partial Ordering

TRUE
TRUE
FALSE
FALSE
FALSE
TRUE
TRUE

Lecture 1 (8/15) Lecture 1 (9/15)

9 10

Comparable / Incomparable Example

The elements a and b of a poset (S, ) are
called comparable if either a b or b a.
When a and b are elements of S such that
neither a b nor b a, a and b are called
incomparable.
Consider the power set of {a, b, c} and the
subset relation. (P({a,b,c}),  )
{a , c}  {a , b} and {a , b}  {a , c}
So, {a,c} and {a,b} are incomparable

Lecture 1 (10/15) Lecture 1 (11/15)

11 12
 23-09-2020

Totally Ordered, Chains Example

If (S, ) is a poset and every two elements of  In the poset (Z+,≤), are the integers 3 and 9
S are comparable, S is called totally ordered or comparable?
linearly ordered set, and is called a total • Yes, as 3 ≤ 9
order or a linear order. A totally ordered set is  Are 7 and 5 comparable?
also called a chain. • Yes, as 5 ≤ 7
 As all pairs of elements in Z+ are comparable,
the poset (Z+,≤) is a total order
• a.k.a. totally ordered poset, linear order, or chain
Lecture 1 (12/15) Lecture 1 (13/15)

13 14

Example Summing Up
 In the poset (Z+,|) with “divides” operator |, are the
integers 3 and 9 comparable?
• Yes, as 3 | 9
 Are 7 and 5 comparable?
• No, as 7 | 5 and 5 | 7

 Thus, as there are pairs of elements in Z+ that are not

comparable, the poset (Z+,|) is a partial order. It is not a
chain.
Lecture 1 (14/15) Lecture 1 -16

15 16
 23-09-2020

POSETS and LATTICES Hasse Diagrams

Given any partial order relation defined on a

finite set, it is possible to draw the directed
graph so that all of these properties are
satisfied.
This makes it possible to associate a
somewhat simpler graph, called a Hasse
diagram, with a partial order relation defined
Lecture #2 on a finite set.

17 18

Hasse Diagrams Hasse Diagrams (continued)

19 20
 23-09-2020

Example

21 22

Hasse Diagram
 For the poset ({1,2,3,4,6,8,12}, |)

23 24
 23-09-2020

25 26

Maximal and Minimal Elements More Examples

27 28
 23-09-2020

Greatest Element
Least Element Example
a is the greatest element in the poset (S, ) if b a
for all b  S . Similarly, an element of a poset is called
the least element if it is less or equal than all other
elements in the poset. That is, a is the least element if
a b for all b  S

29 30

More Examples Summing Up

31 32
 23-09-2020

POSETS and LATTICES Review

 Maximal Element
 Minimal Element
 Greatest Element
 Smallest Element

Lecture #3

33 34

Upper bound, Lower bound Examples

{b,e} {b,e,g} {b,d}

35 36
 23-09-2020

Least Upper Bound,

Greatest Lower Bound Example

37 38

Example Example

39 40
 23-09-2020

Example Summing Up

41 42

Hasse Diagram Properties

LATTICES  Maximal Element
 Minimal Element
 Greatest Element
 Least Element
Lecture #1

44

43 44
 23-09-2020

Least Upper Bound,

Greatest Lower Bound Lattices

46

45 46

A Hasse Diagram that does not have a clearly

defined Greatest and/or Least element cannot be
a lattice
Example Examples of Non-Lattices
 Is the shown Hasse Diagram a Lattice?
• Can you find the LUB (Supremum) of {c,d}?
• Is it a lattice?

A Hasse Diagram that does not have a clearly  Is this a Lattice?

defined Greatest and/or Least element cannot be
a lattice

47 48
 23-09-2020

Example of Lattices Example

Supremum (LUB ) Infimum (GLB )

49 50

As the cardinality of Poset increases, it becomes difficult

to make the table . Can we get some shortcuts?
Example

V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9

1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1

2 2 2 5 4 5 8 7 8 9 2 1 2 1 2 2 1 2 2 2

3 3 5 3 7 5 6 7 8 9 3 1 1 3 1 3 3 3 3 3

4 4 4 7 4 7 9 7 9 9 4 1 2 1 4 2 1 4 2 4

5 5 5 5 7 5 8 7 8 9 5 1 2 3 2 5 3 5 5 5

6 6 8 6 9 8 6 9 8 9 6 1 1 3 1 3 6 3 6 6

7 7 7 7 7 7 9 7 9 9 7 1 2 3 4 5 3 7 5 7

8 8 8 8 9 8 8 9 8 9 8 1 2 3 2 5 6 5 8 8

9 9 9 9 9 9 9 9 9 9 9 1 2 3 4 5 6 7 8 9

51 52
 23-09-2020

a V a = a and aɅa=a a V a = a and aɅa=a

If a b then a V b = b and a Ʌ b = a

V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9 V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9

1 1 1 1 1 1

2 2 2 2 2 2

3 3 3 3 3 3

4 4 4 4 4 4

5 5 5 5 5 5

6 6 6 6 6 6

7 7 7 7 7 7

8 8 8 8 8 8

9 9 9 9 9 9

53 54

a V a = a and aɅa=a a V a = a and aɅa=a

If a b then a V b = b and a Ʌ b = a If a b then a V b = b and a Ʌ b = a

a V b = b V a and a Ʌ b = b Ʌ a a V b = b V a and a Ʌ b = b Ʌ a

Apply Repeatedly

V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9 V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9

1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1 1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1

2 2 2 2 2 2 2 2 1 2

3 3 3 3 3 3 3 3 1 3

4 4 4 4 4 4 4 4 1 4

5 5 5 5 5 5 5 5 1 5

6 6 6 6 6 6 6 6 1 6

7 7 7 7 7 7 7 7 1 7

8 8 8 8 8 8 8 8 1 8

9 9 9 9 9 9 9 9 1 9

55 56
 23-09-2020

a V a = a and aɅa=a a V a = a and aɅa=a

If a b then a V b = b and a Ʌ b = a If a b then a V b = b and a Ʌ b = a

a V b = b V a and a Ʌ b = b Ʌ a a V b = b V a and a Ʌ b = b Ʌ a

Apply Repeatedly Apply Repeatedly

V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9 V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9

1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1 1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1

2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2 2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2

3 3 3 3 1 3 3 3 3 3 1 3

4 4 4 4 1 4 4 4 4 4 4 1 2 4

5 5 5 5 1 5 5 5 5 5 5 1 2 5

6 6 6 6 1 6 6 6 6 6 1 6

7 7 7 7 1 7 7 7 7 7 7 1 2 7

8 8 8 8 1 8 8 8 8 8 8 1 2 8

9 9 9 9 1 9 9 9 9 9 9 1 2 9

57 58

a V a = a and aɅa=a a V a = a and aɅa=a

If a b then a V b = b and a Ʌ b = a If a b then a V b = b and a Ʌ b = a

a V b = b V a and a Ʌ b = b Ʌ a a V b = b V a and a Ʌ b = b Ʌ a

Apply Repeatedly Apply Repeatedly

V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9 V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9

1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1 1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1

2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2 2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2

3 3 3 5 6 7 8 9 3 1 3 3 3 3 3 3 3 3 3 5 6 7 8 9 3 1 3 3 3 3 3 3

4 4 4 4 4 1 2 4 4 4 4 4 4 1 2 4

5 5 5 5 5 1 2 5 5 5 5 5 5 5 1 2 3 5

6 6 6 6 1 6 6 6 6 6 6 1 3 6

7 7 7 7 7 1 2 7 7 7 7 7 7 7 1 2 3 7

8 8 8 8 8 1 2 8 8 8 8 8 8 8 1 2 3 8

9 9 9 9 9 1 2 9 9 9 9 9 9 9 1 2 3 9

59 60
 23-09-2020

a V a = a and aɅa=a a V a = a and aɅa=a

If a b then a V b = b and a Ʌ b = a If a b then a V b = b and a Ʌ b = a

a V b = b V a and a Ʌ b = b Ʌ a a V b = b V a and a Ʌ b = b Ʌ a

Apply Repeatedly Apply Repeatedly

V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9 V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9

1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1 1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1

2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2 2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2

3 3 3 5 6 7 8 9 3 1 3 3 3 3 3 3 3 3 3 5 6 7 8 9 3 1 3 3 3 3 3 3

4 4 4 4 7 9 4 1 2 4 4 4 4 4 4 4 7 9 4 1 2 4 4 4

5 5 5 5 5 5 1 2 3 5 5 5 5 5 5 5 1 2 3 5

6 6 6 6 6 1 3 6 6 6 6 6 6 1 3 6

7 7 7 7 7 7 1 2 3 7 7 7 7 7 7 7 7 1 2 3 4 7

8 8 8 8 8 8 1 2 3 8 8 8 8 8 8 8 1 2 3 8

9 9 9 9 9 9 1 2 3 9 9 9 9 9 9 9 9 1 2 3 4 9

61 62

a V a = a and aɅa=a a V a = a and aɅa=a

If a b then a V b = b and a Ʌ b = a If a b then a V b = b and a Ʌ b = a

a V b = b V a and a Ʌ b = b Ʌ a a V b = b V a and a Ʌ b = b Ʌ a

Apply Repeatedly Apply Repeatedly

V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9 V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9

1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1 1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1

2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2 2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2

3 3 3 5 6 7 8 9 3 1 3 3 3 3 3 3 3 3 3 5 6 7 8 9 3 1 3 3 3 3 3 3

4 4 4 4 7 9 4 1 2 4 4 4 4 4 4 4 7 9 4 1 2 4 4 4

5 5 5 5 5 7 8 9 5 1 2 3 5 5 5 5 5 5 5 5 5 7 8 9 5 1 2 3 5 5 5 5

6 6 6 6 6 1 3 6 6 6 6 6 6 1 3 6

7 7 7 7 7 7 7 1 2 3 4 7 7 7 7 7 7 7 7 7 1 2 3 4 5 7

8 8 8 8 8 8 1 2 3 8 8 8 8 8 8 8 8 1 2 3 5 8

9 9 9 9 9 9 9 1 2 3 4 9 9 9 9 9 9 9 9 9 1 2 3 4 5 9

63 64
 23-09-2020

a V a = a and aɅa=a a V a = a and aɅa=a

If a b then a V b = b and a Ʌ b = a If a b then a V b = b and a Ʌ b = a

a V b = b V a and a Ʌ b = b Ʌ a a V b = b V a and a Ʌ b = b Ʌ a

Apply Repeatedly Apply Repeatedly

V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9 V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9

1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1 1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1

2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2 2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2

3 3 3 5 6 7 8 9 3 1 3 3 3 3 3 3 3 3 3 5 6 7 8 9 3 1 3 3 3 3 3 3

4 4 4 4 7 9 4 1 2 4 4 4 4 4 4 4 7 9 4 1 2 4 4 4

5 5 5 5 5 7 8 9 5 1 2 3 5 5 5 5 5 5 5 5 5 7 8 9 5 1 2 3 5 5 5 5

6 6 6 6 8 9 6 1 3 6 6 6 6 6 6 6 8 9 6 1 3 6 6 6

7 7 7 7 7 7 7 7 1 2 3 4 5 7 7 7 7 7 7 7 7 7 1 2 3 4 5 7

8 8 8 8 8 8 8 1 2 3 5 8 8 8 8 8 8 8 8 8 1 2 3 5 6 8

9 9 9 9 9 9 9 9 1 2 3 4 5 9 9 9 9 9 9 9 9 9 9 1 2 3 4 5 6 9

65 66

a V a = a and aɅa=a a V a = a and aɅa=a

If a b then a V b = b and a Ʌ b = a If a b then a V b = b and a Ʌ b = a

a V b = b V a and a Ʌ b = b Ʌ a a V b = b V a and a Ʌ b = b Ʌ a

Apply Repeatedly Apply Repeatedly

V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9 V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9

1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1 1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1

2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2 2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2

3 3 3 5 6 7 8 9 3 1 3 3 3 3 3 3 3 3 3 5 6 7 8 9 3 1 3 3 3 3 3 3

4 4 4 4 7 9 4 1 2 4 4 4 4 4 4 4 7 9 4 1 2 4 4 4

5 5 5 5 5 7 8 9 5 1 2 3 5 5 5 5 5 5 5 5 5 7 8 9 5 1 2 3 5 5 5 5

6 6 6 6 8 9 6 1 3 6 6 6 6 6 6 6 8 9 6 1 3 6 6 6

7 7 7 7 7 7 7 9 7 1 2 3 4 5 7 7 7 7 7 7 7 7 7 9 7 1 2 3 4 5 7 7

8 8 8 8 8 8 8 9 8 1 2 3 5 6 8 8 8 8 8 8 8 8 8 9 8 1 2 3 5 6 8 8

9 9 9 9 9 9 9 9 9 1 2 3 4 5 6 9 9 9 9 9 9 9 9 9 9 9 9 1 2 3 4 5 6 7 8 9

67 68
 23-09-2020

a V a = a and aɅa=a
If a b then a V b = b and a Ʌ b = a
ONLY THE NON-COMPARABLE PAIRS ARE LEFT
a V b = b V a and a Ʌ b = b Ʌ a

ONLY 18 OUT OF 81
Apply Repeatedly
THE TASK HAS BECOME MUCH EASIER
V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9 V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9

1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1 1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1

2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2 2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2

3 3 3 5 6 7 8 9 3 1 3 3 3 3 3 3 3 3 3 5 6 7 8 9 3 1 3 3 3 3 3 3

4 4 4 4 7 9 4 1 2 4 4 4 4 4 4 4 7 9 4 1 2 4 4 4

5 5 5 5 5 7 8 9 5 1 2 3 5 5 5 5 5 5 5 5 5 7 8 9 5 1 2 3 5 5 5 5

6 6 6 6 8 9 6 1 3 6 6 6 6 6 6 6 8 9 6 1 3 6 6 6

7 7 7 7 7 7 7 9 7 1 2 3 4 5 7 7 7 7 7 7 7 7 7 9 7 1 2 3 4 5 7 7

8 8 8 8 8 8 8 9 8 1 2 3 5 6 8 8 8 8 8 8 8 8 8 9 8 1 2 3 5 6 8 8

9 9 9 9 9 9 9 9 9 9 9 1 2 3 4 5 6 7 8 9 9 9 9 9 9 9 9 9 9 9 9 1 2 3 4 5 6 7 8 9

LET US MARK THE REMAINING CELLS – THE ONES, WHERE WE ACTUALLY HAVE TO FIND THE GLB AND LUB

69 70

NOW WE CAN FIND THE REMAINING INFIMUMS AND NOW WE CAN FIND THE REMAINING INFIMUMS AND
SUPREMUMS IN COMPARATIVELY LESS TIME SUPREMUMS IN COMPARATIVELY LESS TIME

Remember a V b = b V a and a Ʌ b = b Ʌ a

V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9 V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9

1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1 1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1

2 2 2 4 5 7 8 9 2 1 2 2 2 2 2 2 2 2 2 5 4 5 8 7 8 9 2 1 2 1 2 2 1 2 2 2

3 3 3 5 6 7 8 9 3 1 3 3 3 3 3 3 3 3 3 5 6 7 8 9 3 1 3 3 3 3 3 3

4 4 4 4 7 9 4 1 2 4 4 4 4 4 4 4 7 9 4 1 2 4 4 4

5 5 5 5 5 7 8 9 5 1 2 3 5 5 5 5 5 5 5 5 5 7 8 9 5 1 2 3 5 5 5 5

6 6 6 6 8 9 6 1 3 6 6 6 6 6 6 6 8 9 6 1 3 6 6 6

7 7 7 7 7 7 7 9 7 1 2 3 4 5 7 7 7 7 7 7 7 7 7 9 7 1 2 3 4 5 7 7

8 8 8 8 8 8 8 9 8 1 2 3 5 6 8 8 8 8 8 8 8 8 8 9 8 1 2 3 5 6 8 8

9 9 9 9 9 9 9 9 9 9 9 1 2 3 4 5 6 7 8 9 9 9 9 9 9 9 9 9 9 9 9 1 2 3 4 5 6 7 8 9

71 72
 23-09-2020

NOW WE CAN FIND THE REMAINING INFIMUMS AND NOW WE CAN FIND THE REMAINING INFIMUMS AND
SUPREMUMS IN COMPARATIVELY LESS TIME SUPREMUMS IN COMPARATIVELY LESS TIME

Remember a V b = b V a and a Ʌ b = b Ʌ a Remember a V b = b V a and a Ʌ b = b Ʌ a

V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9 V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9

1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1 1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1

2 2 2 5 4 5 8 7 8 9 2 1 2 1 2 2 1 2 2 2 2 2 2 5 4 5 8 7 8 9 2 1 2 1 2 2 1 2 2 2

3 3 5 3 5 6 7 8 9 3 1 1 3 3 3 3 3 3 3 3 5 3 7 5 6 7 8 9 3 1 1 3 1 3 3 3 3 3

4 4 4 4 7 9 4 1 2 4 4 4 4 4 4 7 4 7 9 7 9 9 4 1 2 1 4 2 1 4 2 4

5 5 5 5 5 7 8 9 5 1 2 3 5 5 5 5 5 5 5 5 7 5 8 7 8 9 5 1 2 3 2 5 3 5 5 5

6 6 8 6 6 8 9 6 1 1 3 6 6 6 6 6 8 6 9 8 6 9 8 9 6 1 1 3 1 3 6 3 6 6

7 7 7 7 7 7 7 9 7 1 2 3 4 5 7 7 7 7 7 7 7 7 9 7 9 9 7 1 2 3 4 5 3 7 5 7

8 8 8 8 8 8 8 9 8 1 2 3 5 6 8 8 8 8 8 8 9 8 8 9 8 9 8 1 2 3 2 5 6 5 8 8

9 9 9 9 9 9 9 9 9 9 9 1 2 3 4 5 6 7 8 9 9 9 9 9 9 9 9 9 9 9 9 1 2 3 4 5 6 7 8 9

And So On ………….

73 74

All pair of elements has both Infimum and Supremum so

the given Hasse Diagram is a Lattice
Lattices

V 1 2 3 4 5 6 7 8 9 Ʌ 1 2 3 4 5 6 7 8 9

1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 1

2 2 2 5 4 5 8 7 8 9 2 1 2 1 2 2 1 2 2 2

3 3 5 3 7 5 6 7 8 9 3 1 1 3 1 3 3 3 3 3

4 4 4 7 4 7 9 7 9 9 4 1 2 1 4 2 1 4 2 4

5 5 5 5 7 5 8 7 8 9 5 1 2 3 2 5 3 5 5 5

6 6 8 6 9 8 6 9 8 9 6 1 1 3 1 3 6 3 6 6

7 7 7 7 7 7 9 7 9 9 7 1 2 3 4 5 3 7 5 7

8 8 8 8 9 8 8 9 8 9 8 1 2 3 2 5 6 5 8 8

9 9 9 9 9 9 9 9 9 9 9 1 2 3 4 5 6 7 8 9

75 76
 23-09-2020

Review
LATTICES

Lecture # 2

78

77 78

Sublattices Sublattice Example

• Sublattice of a lattice must itself be a lattice

• Every Singleton set of a lattice is a sublattice of L
• If m|n (m divides n) then Dm is a sublattice of Dn

79 80
 23-09-2020

Sublattice Example 2 Example

81 82

Bounded Lattice Complemented Lattice

 If we have a Bounded lattice L with a 0 (Least)
element and a 1 (Greatest) element and in this
lattice, if for an element a ∈ 𝐿 we can find
another element b ∈ 𝐿 such that a v b = 1 and a
^ b = 0, then b is said to be the complement of a
and vice versa.
 Complements are not unique, i.e., an element
can have multiple complements
 There can be elements in a lattice, which don't
have any complements
 A lattice, where every element has at-least one
complement is called a Complemented Lattice

83 84
 23-09-2020

Examples

Can you Find the Complement of ‘a’?

85