Professional Documents
Culture Documents
UNIT 5 LATTICES BOOLEAN ALGEBRA
UNIT 5 LATTICES BOOLEAN ALGEBRA
of Mathematics
Department of Mathematics
MA8351 – DISCRETE MATHEMATICS
CLASS NOTES
Reflexive:
Let X be a set, R be the relation defined on X. Then R is said to be reflexive if it
satisfies the following condition x R x..(ie) xRx x / (x, x) R x X
Symmetric:
Let X be a set, R be the relation defined on X. Then R is said to be symmetric if
it satisfies the following condition x R y => y R x (ie)
( y, x) / (x, y) R ( y, x) R x, y X
Transitive:
Let X be a set, R be the relation defined on X. Then R is said to be transitive if
it satisfies the following condition x R y & y R z=> x R z (ie)
(x, z) / (x, y) R & ( y, z) R (x, z) Rx, y, z X
Anti Symmetric:
Let X be a set, R be the relation defined on X. Then R is said to be
antisymmetric if it satisfies the following condition x R y & y R x => x=y
x, y X
Page No: 1
Sub. Name & Code : Discrete Mathematics, MA8351 Dept. of Mathematics
Equivalence Relation:
Let X be a set, R be the relation defined on X. If R satisfies Reflexive,
Symmetric and Transitive then the relation R said to be an equivalence relation
.
Partial Order Relation:
Let X be a set, R be the relation defined on X. Then R is said to be partial order
relation if it satisfies Reflexive, Anti-Symmetric and Transitive.
Example: ' ' & Divides (/) are partial order relation.
Example:1
Subset relation ' ' is a partial order relation.
A A Reflexive
A B & B A A B Anti Symmetric
A B & B C A C Transitive
It is reflexive, symmetric and transitive. ’ ’ is a partial order relation.
Example 2:
Divides relation '/ ' is a partial order relation.
Hasse Diagram:
Pictorial representation of a Poset is called Hasse diagram.
Page No: 2
Sub. Name & Code : Discrete Mathematics, MA8351 Dept. of Mathematics
Answer:
(a)
b)
Page No: 3
Sub. Name & Code : Discrete Mathematics, MA8351 Dept. of Mathematics
Answer:
Page No: 4
Sub. Name & Code : Discrete Mathematics, MA8351 Dept. of Mathematics
3. Let D30 = {1, 2, 3, 5, 6, 10, 15, 30} and let the relation R be divisor on D30
Find
(a) all the lower bound of 10 and 15
(b)the greatest lower bound of 10 and 15
(c) all upper bound of 10 and 15
(d)the least upper bound of 10 and 15
(e) Draw the Hasse diagram (Nov/Dec – 2015)
Answer:
(a) The lower bounds of 10 and 15 are 1 and 5.
(b) The greatest lower bound of 10 and 15 is 5.
(c) The upper bound of 10 and 15 is 30.
(d) The least upper bound of 10 and 15 is also 30.
(e) Hasse diagram
Lattice:
A lattice is a partially ordered set (Poset) (L, ) in which for every pair of
elements a,b L both greatest lower bound and least upper bound exists.
Note:
GLBa,b a *b (or) a b
LUBa,b a b (or) a b
Is (S24, D) a lattice?
Solution:
S24 = {1, 2, 3, 4, 6, 8, 12, 24}
D = {<a,b>/a|b}
Page No: 5
Sub. Name & Code : Discrete Mathematics, MA8351 Dept. of Mathematics
In (S24, D), every pair of elements a,b in S24 has both lower bound and least
upper bound.
Hence It is a Lattice.
Distributive Lattice:
A lattice (L, , ) is said to be distributive lattice if and satisfy the following
conditions
a (b c) (a b) (a c)
a (b c) (a b) (a c)
Solution:
It is enough to prove that D1 (or) D2 satisfied.
Consider
Page No: 6
Sub. Name & Code : Discrete Mathematics, MA8351 Dept. of Mathematics
a (b c) a 0 a
(b c) GLBb,c 0
a 0 LUB0, a a
Now
(a b) (a c) 1 1 1
(a b) LUBa,b 1
(a c) LUBa,b 1
a (b c) (a b) (a c)
D1is not satisfied
Therefore the given lattice is not distributive
Modular Lattice:
A lattice (L, , ) is said to be modular lattice if satisfies the following
condition if
a c then a (b c) (a b) c a,b,c L
5. State and prove Isotonicity property in lattice.
Statement:
Let (L, , ) be given Lattice. For any a, b, c L , we have,
b c
1) a b a c
2) a b a c
Proof:
Given b c Therefore GLB{b, c}b c b and LUB{b, c}b c c
Claim 1: a b a c
To prove the above, it’s enough to prove GLB{a b , a c} a b
Claim 2: a b a c
To prove the above it’s enough to prove LUB{a b , a c} a c
Page No: 7
Sub. Name & Code : Discrete Mathematics, MA8351 Dept. of Mathematics
(a b) (b c) (c a) (a b) [(b c) c] [(b c) a]
(a b) [c [(b c) a]
[(a b) c] [(a b) [(b c) a]
[(a b) c] [(b c) a]
[c (a b)] [a (b c}]
[(c a) (c b)] [(a b) (a c)]
[(c a) (b c)] [(a b) (c a)]
(c a) (b c) (a b)
(a b) (b c) (c a)
Page No: 8
Sub. Name & Code : Discrete Mathematics, MA8351 Dept. of Mathematics
c a b (Distributive Law)
c a c (Given)
c c a (Commutative Law)
c (Absorption Law)
bc
Answer:
(1) Given
abc
Since
a ba b b, ab a ... (1)
b cb c c, bc b ...(2)
a c a c c, ac a ... (3)
From (1) and (2), we have a b b b *c
(2) LHS
(a b) (b c) a b b
RHS
(a b)(a c) bc b
Therefore (a b) (b c) (a b) (a c) b
10. Show that direct product of any two distributive lattices is a distributive
lattice.
Proof:
Let L1 and L2 be two distributive lattices. Let x, y, z L1 L2 be the direct product
of L1 and L2. Then x = (a1, a2), y = (b1, b2) and z = (c1, c2)
Page No: 9
Sub. Name & Code : Discrete Mathematics, MA8351 Dept. of Mathematics
Now
x ( y z) (a1, a2) (b1,b2) (c1,c2)
(a1, a2) (b1,b2) (a1, a2) (c1,c2)
x y x z
Thus direct product of any two distributive lattice is again a distributive lattice
11. State and prove the necessary and sufficient condition for a lattice to be
modular.
Statement:
A lattice L is modular if and only if none of its sub lattices is isomorphic to the
pentagon lattice N5
Proof:
Since the pentagon lattice N5 is not a modular lattice. Hence any lattice having
pentagon as a sub lattice cannot be modular.
Conversely, let (L, ) be any non modular lattice and we shall prove there is a
sub lattice which is isomorphic to N5.
12. Prove that every distributive lattice is modular. Is the converse true?
Justify your claim.
Proof:
Let (L, ) be a distributive lattice, for all a, b, c L , we have
a (b * c) (a b)*(a c)
Thus if a c, then acc
a (b * c) (a b)*c
So if a c, the modular equation is satisfied and L is modular.
However, the converse is not true, because diamond lattice is modular but not
distributive.
Boolean Algebra
A complemented distributive lattice is called Boolean algebra.
13. In any Boolean algebra, show that ab ab 0 if and only if a = b
Proof:
Let (B, .,+,0,1) be any boolean algebra
Let a, bB & a = b
St. Page No: 10
Sub. Name & Code : Discrete Mathematics, MA8351 Dept. of Mathematics
15. Prove that in a Boolean algebra a b ' a' b' and a b ' a' b'
(Nov/Dec – 2015) (April/May - 2015) & (Nov/Dec – 2014)
(or)
Page No: 11
Sub. Name & Code : Discrete Mathematics, MA8351 Dept. of Mathematics
Page No: 13
Sub. Name & Code : Discrete Mathematics, MA8351 Dept. of Mathematics
Page No: 14
Sub. Name & Code : Discrete Mathematics, MA8351 Dept. of Mathematics
Page No: 15