Lattices and Boolean Algebra

(UNIT 1& UNIT 2)

B. Tech-III SEM / BCS303: Discrete structure and theory of logics/
UNIT – I & II/ Nida Rahman/ Assistant Professor / Department of
CSE / JMS Institute of TechnologyGhaziabad

Lattices and Boolean Algebra

Partial Order Relation

A relation R on a non-empty set A is said to be a partial order
relation if it is reflexive, antisymmetric and transitive.
Partially Ordered Set (Poset)
A partially ordered set or a poset is a set together with a partial
order relation defined on it.

Greatest Lower Bound (glb)

The glb of a subset {a, b} L (poset) will be denoted by
glb{a, b} a b (or) a b .

Least Upper Bound (lub)

The lub of a subset {a, b} L (poset) will be denoted by
lub{a, b} a b (or) a b .

Lattics
A lattice is a partially ordered set (L, ) in which every pair of
elements of L has a glb and lub.
B. Tech-III SEM / BCS303: Discrete structure and theory of logics/
UNIT – I & II/ Nida Rahman/ Assistant Professor / Department of
CSE / JMS Institute of TechnologyGhaziabad

Properties
Let (L, ) be a lattice and a, b, c L.

a a a
Idempotant Law
a a a
a (b c) (a b) c
Associative Law
a (b c) (a b) c
a (b c) (a b) (a c)
Distributive Law
a (b c) (a b) (a c)
a b b a
Commutative Laws
a b b a
a (a b) a
Absorption Laws
a (a b) a

Problem 5.1:
Show that (N, ) is a partially ordered set where N is set of all
positive integers and is defined by m n if and only if n m
is a non-negative integer.

Solution:
Given N is the set of all positive integers.
Consider the relation is m n if and only if n m is non-
negatie integer.
Reflixive:
Let x N .

We know that x x 0 is a non-negative integer.

x x is true.

is reflexive.
 lOMoARcPSD|470 774 67

Lattices and Boolean Algebra 5. 3

Antisymmetric:
Let x, y N.

Consider x y and y x are true.

Since x y y x is non-negative integer.

y x x y is non-negative integer

(y x) is non-negative integer.

From (1) and (2), we get x y.

is antisymmetric.

Transitive:
Let x, y, z N.

Consider x y and y z are true.

Since x y y x is non-negative integer and

y z z y is non-negative integer

Now
(y x) (z y) is a non-integer
(z x) is a non-integer

x z is true.

is transitive.
Hence is a partial order relation.
(N, ) is a partially ordered set (Poset).
 lOMoARcPSD|470 774 67

5.4 Discrete Mathematics

Problem 5.2:
Draw the Hasse diagram for (1) P1 2, 3, 6, 12, 24
(2) P2 1, 2, 3, 4, 6, 12 and is a relation such x y if and
only if x | y . (A/M 2011)

Solution:
Hasee Diagram:
A partial ordering on a set P can be represented by means of
a diagram known as a Hasse diagram or a partially ordered set
diagram of (P, ) .
(i)
P1 2, 3, 6, 12, 24

Consider a set A such that x y if and only if x | y in P1 .

(2,6), (2,12), (2, 24),

A (3,6), (3,12), (3, 24),
(6,12), (6, 24),(12, 24)
 lOMoARcPSD|470 774 67

Lattices and Boolean Algebra 5. 5

(ii)
P2 1, 2, 3, 4, 6, 12

Consider a set B such that x y if and only if x | y in P2 .

(1, 2), (1,3), (1, 4), (1, 6), (1,12),

(2, 4), (2, 6), (2,12),
B
(3, 6), (3,12),
(4,12), (6,12)

Problem 5.3:
Draw the Hasse diagram representing the partial ordering
A, B : A B on the power set P(S ) where S a,b,c .
Find the maximal, minimal, greatest and least elements of the
poset. (N/D 2012)
Solution:

Given partial ordering A, B : A B on the power set P(S )

where S a,b,c .

P(S) {a}, {b}, {c}, {a,b}, {b, c}, {a, c}, {a,b, c}, {}

Empty set {} is a subset of every set in P(S ) .

 lOMoARcPSD|470 774 67

5.6 Discrete Mathematics

{} is the least element of P(S ) .

Similarly {a,b,c} contains all elements of P(S ) . i.e. an element

of P(S ) is a subset of {a,b, c}.

{a,b,c} is tha greatest element of P(S ) .

P(S), is a lattice.

The Hasse diagram is

Problem 5.4:
Let D30 {1, 2, 3, 5, 6, 10, 15, 30} with a relation x y if and
only if x divides y . Find the following (A/M 2018)

(i) All lower bounds of 10 and 15

(ii) GLB of 10 and 15
(iii) All upper bounds of 10 and 15
(iv) LUB of 10 and 15
(v) Draw the Hasse diagram of D30

(or)
 lOMoARcPSD|470 774 67

Lattices and Boolean Algebra 5. 7

If Sn is the set of all divisors of the positive integer n and D is

S30, D is a lattice.
(A/M 2015)
Solution:

Given D30 {1, 2, 3, 5, 6, 10, 15, 30}.

i) Lower bound of 10 and 15:

Since 1 divides both 10 and 15, 1 is a lower bound of 10 and
15.
Also since 5 divides both 10 and 15, 5 is a lower bound of 10
and 15.
The lower bounds of 10 and 15 are 1 and 5.

ii) GLB of 10 and 15:

From (i) the greast lower bound of 10 and 15 is 5.
i.e. GLB{10, 15} = 5.
iii) All upper bounds of 10 and 15:
Since 10 divides 30 and 15 divides 30, 30 is an upper bound
of 10 and 15.
iv) LUB of 10 and 15:
From (iii) the least upper bound of 10 and 15 is 30.
i.e. LUB {10, 15} = 30
v) Hasse diagram of D30 :
 lOMoARcPSD|470 774 67

5.8 Discrete Mathematics

Lattices
Lattice:
A poset (P, ) is said to be a lattice, if for every pair of elements
a, b L has greatest lower bounded (glb) and least upper bound
(lub) . (i.e) a b and a b exists.
Sub-lattice:
A non-empty subset S of a lattice (L, , ) is a sub lattice of L
if and only if S is closed under the binary operations and .
Distributive Lattice:
A lattice L, , is called a distributive lattice if it satisfies
distributive property. (i.e) a (b c) (a b) (a c) and
a (b c) (a b) (a c) for all a, b, c L .

Complete Lattice:
A lattice is called complete if each of its non empty subsets has a
least upper bound and a greatest lower bound.
Clearly, every finite lattice is complete because every subset is
finite.
 lOMoARcPSD|470 774 67

Bounded Lattice:
The least and the greatest elements of a lattice are called bounds
of the lattice and are denoted by 0 and 1 respectively. A lattice
which has both elements 0 and 1 is called a bounded lattice.
Example:
( A), is a bounded lattice, where A is a non-empty finite
A.

Complemented Lattice:
A lattice L,*, is said to be complemented if for any a L,
there exists a L such that a * a 0 and a a 1.
Problem 5.5:
If S42 is the set of all divisors of 42 and D is the relation
S42 , prove that S42 , D is a complemented
Lattice. (N/D 2010)
Solution:
Given S42 is the set of all divisors of 42 and D is the relation
S42 .

i.e. S42 {1, 2, 3, 6, 7, 14, 21, 42}

The Hasse diagram of S42 , D is

 lOMoARcPSD|470 774 67

(i)
1 42 GLB{1, 42} GCD{1, 42} 1

and 1 42 LUB{1, 42} LCM{1, 42} 42 element)

1 and 42 are complement to each other.

(ii)
2 21 GCD{2, 21} 1

and 2 21 LCM{2, 21} 42 .

2 and 21 are complement to each other.

(iii)
3 14 GCD{3, 14} 1

and 3 14 LCM{3, 14} 42 .

3 and 14 are complement to each other.

(iv)
6 7 GCD{6, 7} 1
 lOMoARcPSD|470 774 67

and 6 7 LCM{6, 7} 42 .

6 and 7 are complement to each other.

Since, every elements of S42 has complement.

Hence S42 , D is a complemented lattice.

Problem 5.6:
In a distributive lattice, show that
(a b) (b c) (c a) (a b) (b c) (c a) .

Solution:
Let (L, ) be a bistributive lattice and a, b, c L.

LHS
(a b) (b c) (c a)

(a b) (b c) (c a)

(a b) ((b c) c) ((b c) a) by distributive law

(a b) c (a (b c)) by absorption law

(a b) c (a b) (a (b c)) by distributive law

(a b) c ((a b) a) (b c) by associative law

(a b) c a (b c) by absorption law

(a c) (b c) (a b) (a c) by distributive laws

(a b) (b c) (c a) RHS
 lOMoARcPSD|470 774 67

Problem 5.7:
In a distributive lattice prove that a b a c and
a b a c imply b c. (M/J 2014)

Or

Let (L, , , ) be a distributive lattice and a, b, c L if

a b a c and a b a c . Then show that b c.
(A/M 2018)

Solution:
Given a b a c and a b a c.

Consider
b b (a b) by absorption law
b (a c) a b a c

(b a) (b c) by distributive law
(a b) (b c) by commutative property

(a c) (b c) a b a c

(a b) c by distributive law

(a c) c a b a c
c by absorption law

Hence proved.
 lOMoARcPSD|470 774 67

Problem 5.8:
In a distributive Lattice {L, , } , Prove that complement of
each element is unique. (N/D 2012),(N/D 2016),(A/M 2018)

Or

If L is a distributive lattice with 0 and 1 , show that each

element has atmost one complemen.

Solution:
Let {L, , } or {L, , } be a distributive lattice and a L.

Consider b and c be any two complements of a then by the

definition of complement
a b 0 and a b 1 (a and b are
complement to each other)
a c 0 and a c 1 (a and c are
complement to each other)
From the above
a b a c and a b a c

(Now refer previous problem and then prove b c .)

Hence complement of a is unique.

Problem 5.9:
If {L, , } is a ordered lattice, show that {L, , } is an
algebraic lattice.

Or

Show that every ordered lattice {L, , } satisfies the following

properties of the algebraic lattice (i) idempotent (ii) commutative
(iii) associative (iv) absorption. (A/M 2017)
 lOMoARcPSD|470 774 67

5.14 Discrete Mathematics

Or
Let L be lattice, where a b glb(a,b) and a b lub(a,b)
for all a,b L . Then both binary operations and defined as
in L satisfies commutative law, associative law, absorption law
and idempotent law. (M/J 2013)

Solution:
Given (L, , ) or (L, , ) is a lattice and for any a,b L,
a b and a b exist.
i.e. a b glb(a,b) and a b lub(a,b) exist a,b L.

Commutative Law:
Let a, b L

a b glb(a,b) glb(b,a) b a and

a b lub(a,b) lub(b,a) b a

Associative Law:
Let a, b, c L

We have to prove a (b c) (a b) c .
a (b c) a and
a (b c) b c
a (b c) b c b b c b
a (b c) a b
and
a (b c) b c c b c c

a (b c) c

From (1) and (2), we get

 lOMoARcPSD|470 774 67

Lattices and Boolean Algebra 5 . 15

a (b c) (a b) c
(a b) c c and
(a b) c a b
(a b) c a b b a b b

(a b) c b c
and
(a b) c a b a a b a
(a b) c a

From (4) and (5), we get

(a b) c a (b c)
From (3) and (6), we get
a (b c) (a b) c

Absorption Law:
Let a, b L

We have a a and a a b

a a (a b)

On the other hand a a and a a b

a (a b) a
a (a a) (b a)

a a (a b)

From (1) and (2), we get

a a (a b)

Similarly we can prove a a (a b) .

 lOMoARcPSD|470 774 67

5.16 Discrete Mathematics

Idempotent Element:
Let a, b, c L

We know that a b a and

If c a and c b, then c ab
Now put a b c then

a a a and a a a
a a a

Hence proved.
Problem 5.10:
Show that every chain is a lattice. (M/J 2013)
Or

Prove that every chain is a distributive lattice.

(N/D 2013),(A/M 2015),(M/J 2016),(N/D 2016),(A/M 2017)
Solution:
Chain:
A chain is a poset in which all the pairs of elements are
comparable. i.e. In a chain, for any two elements a and b , we
a is related to b b is related to a
Let (L, ) be a chain, by the definition any two elements of L
are comparable.
i.e. either a b or b a for any two elements a, b L.

L is a lattice:
If a b , then a b a and a b b.

If b a , then a b b and a b a.

For any two elements a, b L , both glb and lub exist in L.

 lOMoARcPSD|470 774 67

Lattices and Boolean Algebra 5 . 17

(L, ) is a lattice.

Now, we show that L is distributive.

Take a, b, c L.
In a chain, any two elements are comparable.
we have the following cases.
Case (i): a b c Case (ii): a c b

Case (iii): b c a Case (iv): b a c

Case (v): c a b Case (vi): c b a

We show that L is distributive for case (i).

Assume a b c
We establish a (b c) (a b) (a c)

a (b c) (LHS) (a b) (a c) (RHS)
a (b c) (a b) (a c)
a c b c a a a b and a c
a a c a

a (b c) (a b) (a c)

Now we establish a (b c) (a b) (a c)

a (b c) (LHS) (a b) (a c) (RHS)
a (b c) (a b) (a c)
a b b c b c a b and a c
b a b b b c

a (b c) (a b) (a c)
Similarly, we can prove for other cases.
 lOMoARcPSD|470 774 67

5.18 Discrete Mathematics

(L, ) is a distributive lattice.

Hence every chain is a distributive lattice.
Problem 5.11:
Prove that every chain is modular. (M/J 2016)
Or
Prove that every distributive lattice is modular. Is the converse
true? Justify your claim. (A/M 2011)
Solution:
Solution:
Modular Lattice:
A lattice is said to be modular if
a c a (b c) (a b) c .

Let L be a distributive lattice and a, b, c L.

In a distributive lattice,
a (b c) (a b) (a c)
To show that L is modular, first assume that a c.
Then, a c c

Using (2) in (1), we get

a (b c) (a b) c

L is a modular lattice.

The converse is not true.

i.e. A modular lattice need not be distributive.
Example:
Consider the lattice given by the Hasse diagram.
 lOMoARcPSD|470 774 67

Lattices and Boolean Algebra 5 . 19

It is modular but not distributive.

Problem 5.12:
Show that in a distributive and complemented lattice
a b a b 0 a b 1 b a .

Or

In a distributive complemented lattice. Show that the following

are equivalent.

(i) a b (ii) a b 0 (iii) a b 1 (iv) b a

Solution:
Let (L, , ) or (L, , ) be any distributive complemented
lattice and a, b L .

(i) To prove a b a b 0

Let a b for a, b L
Then a b a and a b b.

Combining b with on both sides, we

get
(a b) b b b
 lOMoARcPSD|470 774 67

5.20 Discrete Mathematics

(a b ) (b b ) 0 b b 0 and distributive law

(a b ) 0 0

a b 0

(ii) To prove a b 0 a b 1

Let a b 0 for a, b L
Taking complement on both sides, we get
(a b ) 0

a b 1 by

(iii) To prove a b 1 b a

Let a b 1 for a, b L

Combining b with on bothsides, we get

(a b) b 1b

(a b) (b b ) b by distributive law

(a b) 0 b b b 0

a b b

b a

(iv) To prove b a a b

Let b a for a, b L.

Then a b b

Taking complement on both sides, we get

(a b) (b )

a b b
 lOMoARcPSD|470 774 67

Lattices and Boolean Algebra 5 . 21

a b

Thus a b a b 0 a b 1 b a proved.

Problem 5.13:
Show that in a lattice if a b c , then (N/D 2013)

(i) a b b c

(ii) (a b) (b c) b (a b) (a c)

Solution:
Let (L, , ) be a lattice and a, b, c L.

We know that
If a b then a b a and a b b.

(i)
Given a b c.

a b b a b

and b c b b c
From (1) and (2), we gt
a b b c Hence proved.

(ii)
Given a b c.

(a b) (b c) a b a b a and b c b

(a b) (a c) b c a b b and a c c