Discrete Mathematics

Unit 3: Lattice
Lecture 16

Lattice
Lattice

• Lattices – A Poset in which every pair of elements has both, a least

upper bound and a greatest lower bound is called a lattice.

• There are two binary operations defined for lattices –

• Join – The join of two elements is their least upper bound. It is

denoted by , not to be confused with disjunction.

• Meet – The meet of two elements is their greatest lower bound. It is

denoted by  , not to be confused with conjunction.

3 Lecture 16 – Lattice
Lattice

L is called a lattice if the following axioms hold where a, b, c are elements

in L:

1) Commutative Law: -
(a) a ∧ b = b ∧ a (b) a ∨ b = b ∨ a

2) Associative Law:-
(a) (a ∧ b)∧ c = a ∧(b∧ c) (b) (a ∨ b) ∨ c = a ∨ (b ∨ c)

3) Absorption Law: -
(a) a ∧ ( a ∨ b) = a (b) a ∨ ( a ∧ b) = a

4 Lecture 16 – Lattice
Lattice Example

Example 1: Show that partial ordered relation ‘a divides b’ on D18 ie.

Divisiors of 18. is a lattice.
Solution : The divisors of 18 are: D18={1,2,3,6,9,18}

Partial ordered relation R on D18 is:

R={(1,1),(2,2),(3,3),(6,6),(9,9),(18,18),
(1,2),(1,3),(1,6),(1,9),(1,18),
(2,6),(2,18),
(3,6),(3,9),(3,18),
(6,18),
(9,18)}

5 Lecture 16 – Lattice
Lattice Example

Find GLB and LUB for every two elements

glb 1 2 3 6 9 18 lub 1 2 3 6 9 18
 

1 1 1 1 1 1 1 1 1 2 3 6 9 18
2 1 2 1 2 1 2 2 2 2 6 6 18 18
3 1 1 3 3 3 3 3 3 6 3 6 9 18
6 1 2 3 6 3 6 6 6 6 6 6 18 18
9 1 1 3 3 9 9 9 9 18 9 18 9 18
18 1 2 3 6 9 18 18 18 18 18 18 18 18

As there exist LUB and GLB for every two elements.

It is a lattice

6 Lecture 16 – Lattice
Lattice Example

Example 2: Show that partial ordered relation ‘a divides b’ on D72 ie.

Divisiors of 72. is a lattice.

Example 3: Show that partial ordered relation ‘is subset ’of is a lattice on
Power set of A, P(A) where A={1,2}.

7 Lecture 16 – Lattice
Thank You