Dr.

Virendra Swarup Institute

of Computer Studies, Kanpur

PRESENTATION ON LATTICE

SUBMITTED TO:-
SUBMITTED TO:-
Mohd Faraj Ansari
Mr. Mohd. Faheem Adarsh Dwivedi
HOD. Rajni Sinha
Mr. Rahul Agnihotri Anjali Chauhan
Dipanshu Dwivedi
 CONTENTS

1. Lattice
2. Dual Lattice
3. Properties of Lattices
(i). Idempotent Law
(ii). Commutative Law
(iii). Associative Law
4. Modular Inequality
5. Sub Lattice
6. Isomorphic Lattice
7. Distributive Lattice
8. Complement of an element in a lattice
9. Complemented Lattice
10. Bibliography

LATTICE
 A partially ordered is said to be a lattice if every
two element in the set L has unique least upper
bound (Sup) and a unique greatest lower bound
(Inf).
OR

The Poset (L, <=) is a lattice if for every a, b ϵ L

Sup {a, b} and Inf {a, b} exist in L.
¿ ( a , b ) =a ∨b

c Inf ( a , b ) =a ∧b

a ∧ b=¿

a ∧ c=a

a ∨ b=c

a b
a ∨ c=c

COMPOSITION TABLE OF JOIN AND MEET

a b c d e f g a b c d e f g
g ∨ ∧

a a b c d d f g a a a a a a a a
e b b b d b d f gg b a b a b b b
f b
c c d c c d f g c a a c c c c c
d d d d d d d f g d a b c d d d d
b e e e e e e
d
g g d
e a b c d e d e
c
 a g g g g g g g g
g a b c d e f g
Hasse Diagram

Since each subset of two element has least upper

bound and a greatest lower bound. So this is a
Lattice.

Since (e ∨f ) and (a ∧ b) does not exist. Then given

Poset is not a lattice.

6
∨ 1 2 3 4 5 6
1 1 2 2 4 4 6
4 5
2 2 2 6 4 6 6
3
4
5
2 3 6
 DUAL LATTICE

Let ( L , ≤) be a lattice, for any a , b ϵ L the converse of

relation ≤ denoted by ≥ is defined as-
a≥b⇔b≤a

Then ( L , ≥) is also a lattice called Dual Lattice of ( L ,≤ ) .

OR

A dual lattice is a lattice in which the order relationship

between elements has been reversed. This means that if a
and b are elements of the original lattice, then in the dual
lattice, a is related to b if and only if b is related to a in the
original lattice. In other words, the LUB of a and b in the
original lattice becomes the GLB of a and b in the dual
lattice, and vice versa
 9 3

7 7

3 2
2 9

In this dual lattice, the This is a Lattice, because

LUB of 3 and 2 in the
original lattice is 7 which
becomes the GLB of 3 and
2 in the dual lattice
any two elements have a
unique LUB and GLB.
The dual lattice of this
lattice can be obtained
by reversing the order
relationship.

PROPERTIES OF LATTICES
Let (L, ≤) be a lattice then the following results hold –

1. Idempotent Law
A. a ᴧ a = a B. aᴠa=a
⇔aᴧa ⇔aᴠa
⇔ Inf (a, a) = a ⇔ Sup (a, a) =a
⇔aᴧa=a ⇔aᴠa=a
2. Commutative Law
A. aᴠb=bᴠa B. a ᴧ b = b ᴧ a
⇔aᴠb ⇔aᴧb
⇔ Sup (a, b) ⇔ Inf (a, b)
⇔ Sup (b, a) ⇔ Inf (b, a)
⇔bᴠa ⇔bᴧa
⇔aᴠb=bᴠa ⇔aᴧb=bᴧa

3. Associative Law
A. a ᴠ (b ᴠ c) = (a ᴠ b) ᴠ c
Let x = a ᴠ (b ᴠ c)
y = (a ᴠ b) ᴠ c
⇒ x ≤ a , x ≤ (b ᴠ c)
⇒ (x ≤ a , x ≤ b) , x ≤ c
⇒ x ≤ (a ᴠ b) , x ≤ c
⇒ x ≤ (a ᴠ b) ᴠ c ≤ y
⇒x=y
a ᴠ (b ᴠ c) = (a ᴠ b) ᴠ c
B. a ᴧ (b ᴧ c) = (a ᴧ b) ᴧ c
Let x = a ᴧ (b ᴧ c)
y = (a ᴧ b) ᴧ c
⇒ x ≤ a , x ≤ (b ᴧ c)
⇒ (x ≤ a , x ≤ b) , x ≤ c
⇒ x ≤ (a ᴧ b) , x ≤ c
⇒ x ≤ (a ᴧ b) ᴠ c ≤ y
⇒x=y
a ᴧ (b ᴧ c) = (a ᴧ b) ᴧ c

MODULAR INEQUALITY
Let (L, ≤) be a lattice for any three elements a, b, c ϵ L.
The following hold –
a ≤ c ⇔ a ᴠ (b ᴧ c) ≤ (a ᴠ b) ᴧ c
Proof:-

We know that for any a, b, c ϵ L then –

 a≤c⇔aᴠc=c ----------------1.
a ᴠ (b ᴧ c) ≤ (a ᴠ b) ᴧ (a ᴠ c) ------2.
From 1. and 2.
a ≤ c ⇔ a ᴠ (b ᴧ c) ≤ (a ᴠ b) ᴧ c

SUB LATTICE
A non-empty subset M of lattice (L,≤) is said to be a
sub-lattice of L if M itself form lattice with respect to
(ᴠ) and (ᴧ) operation.
(M, ᴧ, ᴠ) ⊆ (L, ᴧ, ᴠ)
Or
A non-empty subset M of lattice (L, ≤) is said to be a
sub-lattice of L if M is closed with respect to meet (ᴧ)
and join (ᴠ) operation.

Example: - Consider the lattice L= {1, 2, 3, 4, 5} as

shown. Determine all sub lattices with three or more
elements. 5
 2 3 4

5
1
Solution: M1= {1, 2, 5} 2
1

ᴧ 1 2 5 ᴠ 1 2 5
1 1 1 1 1 1 2 5
2 1 2 2 2 2 2 5
5 1 2 5 5 5 5 5

Similarly,
5
M2= {1, 3, 5}
3

5
M 3={1,4,5 }
4

1
5
 M 4={1,3,4,5 }
4
3
5

M 5={1,2,3,5 } 2 3

1
5

M 6={1,2,4,5} 4
2
5

5
M 7={1,2,4,5}
4
2 3
Example: - Determine all the sub lattices of D12
1
that contain at least three elements.

12

4 6

2 3

1
Solution: D12 = {1, 2, 3, 4, 6, 12}
12
M1 = {12, 4, 2}
4

2
ᴧ 12 4 2
ᴠ 12 4 2
12 12 4 2
12 12 12 12
4 4 4 2
4 12 4 4
2 2 2 2
2 12 4 2
Similiarly,
M2 = {1, 2, 6} M3 = {1,3,6,2}
M4 = {2,4,12,6}
M5 = {12,6,3,1} M6 = {12,4,2,1}
 ISOMORPHIC LATTICE
Two lattice (L1,ᴧ,ᴠ) and (L2,ᴧ,ᴠ) are isomorphic if there
exists one-one mapping correspondence.
f: L1➝ L2
such that -
f(a ᴧ b) = f(a) ᴧ f(b) ,∀ a, b ϵ L1 and f(a),f(b) ϵ L2
and
f(a ᴠ b) = f(a) ᴠ f(b) ,∀ a, b ϵ L1 and f(a),f(b) ϵ L2

Example: Show that the lattices L and L' given below are
not isomorphic .
5
d

d 4
c

b 2 3
e

a 1
Solution: f(a)= 1 f(b)= 2 f(c)= 3 f(d)= 4 f(e)= -
f(f)= 5
{(a, 1), (b, 2), (c, 3), (d, 4), (e, not defined), (f,5)}
Since there is no one-one corresponding between L and
L’ so L and L’ are not isomorphic.

Example:- Determine whether the lattice shown in

below figure are isomorphic.
4
d

b
3 2
c

a
1
(L1)
(L2)

Solution: f(a)= 1 f(b)= 3 f(c)= 2 f(d)= 4

{(a,1), (b,3), (c,2), (d,4)}
• f(b ᴧ c) = f(b) ᴧ f(c)
 f(b ᴧ c) = f(a) = 1
f(b) ᴧ f(c)= 3 ᴧ 2 = 1
• f(b ᴠ c) = f(b) ᴠ f(c)
f(b ᴠ c )= f(d) = 4
f(b) ᴠ f(c) = 3 ᴠ 2 = 4
Hence, L1 and L2 are isomorphic.
 DISTRIBUTIVE LATTICE
A lattice (L, ≤) is said to be distributive lattice for any
three elements a, b, c ϵ L if it holds the following
distributive law/properties :-
i. a ᴧ (b ᴠ c) = (a ᴧ b) ᴠ (a ᴧ c)
ii. a ᴠ (b ᴧ c) = (a ᴠ b) ᴧ (a ᴠ c)

EXAMPLE :-
Q. Show that the lattice shown in figure is not
distributive .
1
Solution :-
a
We have b

a ᴧ (b ᴠ c) = a ᴧ 1 = a
(a ᴧ b) ᴠ (a ᴧ c) = 0 ᴠ c = c 0 c
 ∴ a ᴧ (b ᴠ c) ≠ (a ᴧ b) ᴠ (a ᴧ c)
Hence the lattice is not distributive .
EXAMPLE: -
Q. Show that lattice is not a distributive lattice.
a

b c d

e
Where L= { a , b , c , d , e } ∧≤ is a partial ordering relation defined
on L.
Solution:-
The joint and meet operation are defined by
a ∨ b ={a , b} ¿ a ∧ b=Inf {a , b }

The joint and meet operation tables are given as.

a a

e e
 b ᴧ (c ᴠ d) = b ᴧ a = b
(b ᴧ c) ᴠ (b ᴧ d) = e ᴠ e = e
∴ b ᴧ (c ᴠ d) ≠ (b ᴧ c) ᴠ (b ᴧ d)
Hence the lattice is not distributive .
 COMPLEMENT OF AN ELEMENT IN A
LATTICE
Let (L, ≤) be a lattice and 0 and 1 be its lower and upper
bounds . If a ϵ L is an element then an element b is called
complement of a if -
a ᴠ b = 1 and a ᴧ b =0
Q. Find the complement of each element of given lattice
:–

1
c

a
0

Solution :-
Since
1ᴠ0=1 1 ᴧ 0 =0 1 ͨ=0 and 0 =ͨ 1
1 is complement of 0 and 0 is complement of 1 .
bᴠa=1 b ᴧ a =0
bᴠc=1 b ᴧ c =0 b ͨ= a, c
b has two complements a and c .
aᴠb=1 a ᴧ b =0 a ͨ= b
b is complement of a .
cᴠb=1 c ᴧ b =0 c =ͨ b
b is complement of c .
Q. Let A = {1,2,3,5,30} and a ≤ b iff a divided b . Find
complement of 2 . 30
Solution:
Since 2 ᴠ 3 = 1 2 ᴧ 3 = 30
2 ᴠ 5 = 1 2 ᴧ 5 = 30 2 3 5

Hence 2 has two complements 3

and 5 . 1
 COMPLEMENTED LATTICE
Let (L , ≤)be a lattice with universal bound 0 and 1. The
lattice L is said to be complemented lattice if every
element in L has a complement.
OR
A lattice L is said to be complemented if every element a
ϵ L must have at least one compliment.
aᴠ1=1,aᴧ1=a
aᴠ0=a,aᴧ0=1
The complement of a is denoted by a’ then –
a ᴠ a’ = 1 and a ᴧ a’ = 0
Q. Show that the following lattice is complemented
lattice :-
1
( i ).

a b

0
Solution:
1ᴧ0=0 1ᴠ0=1 1 =ͨ 0 0 ͨ= 1
1 is complement of 0 and 0 is complement of 1 .
aᴧb=0 aᴠb=1 a =ͨ b
b is complement of a .
bᴧa=0 bᴠa=1 b ͨ= a
a is complement of b .

( ii ). 1

b c d
a

0
Solution:
1ᴧ0=0 1ᴠ0=1 1 =ͨ 0 0 ͨ= 1
1 is complement of 0 and 0 is complement of 1 .
aᴧb=0 aᴠb=1 a =ͨ b b ͨ= a
b is complement of a and a is complement of b .
aᴧc=0 aᴠc=1 a =ͨ c c =ͨ a
c is complement of a and a is complement of c .
aᴧd=0 aᴠd=1 a ͨ= d d =ͨ a
d is complement of a and a is complement of d .
bᴧc=0 bᴠc=1 b ͨ= c c ͨ= b
c is complement of b and b is complement of c .
bᴧd=0 bᴠd=1 b ͨ= d d ͨ= b
d is complement of b and b is complement of d .
cᴧd=0 cᴠd=1 c =ͨ d d ͨ= c
d is complement of c and c is complement of d .
 BIBLIOGRAPHY

 Mohd. Faheem Sir

 Notes
 Books
 Discrete Structure and Graph Theory by
JP Chauhan
 Links
 https://www.javatpoint.com/discrete-
mathematics-lattices
 https://www.oreilly.com/library/view/
discrete-mathematics/9789332503441/
xhtml/chapter006.xhtml#:~:text=A
%20lattice%20is%20a
%20partially,product%20of%20a%20and
%20b
 https://www.geeksforgeeks.org/partial-
orders-and-lattices-set-2-mathematics/