Scribd
Upload
17 views46 pages

DMGT Module III Lattices

This document covers concepts in discrete mathematics and graph theory, focusing on lattices and Boolean algebra. It explains key terms such as maximal and minimal elements, upper and lower bounds, and introduces types of lattices including complete, bounded, complemented, distributive, and Boolean lattices. Additionally, it provides examples and definitions related to posets and their properties.

Uploaded by

samarth soni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views46 pages

DMGT Module III Lattices

This document covers concepts in discrete mathematics and graph theory, focusing on lattices and Boolean algebra. It explains key terms such as maximal and minimal elements, upper and lower bounds, and introduces types of lattices including complete, bounded, complemented, distributive, and Boolean lattices. Additionally, it provides examples and definitions related to posets and their properties.

Uploaded by

samarth soni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 46

DISCRETE MATHEMATICS AND

GRAPH THEORY
MODULE-III
MODULE-III

Lattices and Boolean algebra Lattice as POSET,


Complemented Lattice,
Distributive Lattice,
Boolean Algebra as Lattice,

Laws of Boolean Algebra,


Boolean Functions- Normal Forms,
Application of Boolean Algebra to Switching Circuits.
• Maximal element
• Minimal element
• Upper bound
• Lower bound
• Suprimum
• Infimum
Maximal Element:
An element a ∈ A is called a maximal element of A if there is no element in c in A such
that a ≤ c.

Minimal Element:
An element b ∈ A is called a minimal element of A if there is no element in c in A such
that c ≤ b.

Example: Determine all the maximal and minimal elements of the poset.

The maximal elements are b and f.


The minimal elements are d and e.

Upper Bound: Consider B be a subset of a partially ordered set A. An element x ∈ A


is called an upper bound of B if y ≤ x for every y ∈ B.
Lower Bound: Consider B be a subset of a partially ordered set A. An element z ∈ A is
called a lower bound of B if z ≤ x for every x ∈ B.
66
Example: Consider the poset A = {a, b, c, d, e, f, g} be ordered shown in fig. Also let B = {c, d, e}.
Determine the upper and lower bound of B.

Solution:
The upper bound of B is e, f, and g because every element
of B is '≤' e, f, and g.

The lower bounds of B are a and b because a


and b are '≤' every elements of B.
Least Upper Bound (SUPREMUM):
Let A be a subset of a partially ordered set S.
An element M in S is called an upper bound of A if M succeeds every element of A, i.e.
if, for every x in A, we have x <=M
If an upper bound of A precedes every other upper bound of A, then it is called the
supremum of A and is denoted by Sup (A)

Greatest Lower Bound (INFIMUM):


Let A be a subset of a partially ordered set S.
An element m in a poset S is called a lower bound of a subset A of S if m precedes
every element of A, i.e. if, for every y in A, we have m <=y
If a lower bound of A succeeds every other lower bound of A, then it is called the
infimum of A and is denoted by Inf (A)
Example: Determine the least upper bound and greatest lower bound of B = {a, b, c} if
they exist, of the poset whose Hasse diagram is given below.

Solution:
The least upper bound is c.
The greatest lower bound is k.
Comparable Elements:
Consider an ordered set A. Two elements a and b of set A are called comparable if
a≤b or b≤a
R R
Non-Comparable Elements:
Consider an ordered set A. Two elements a and b of set A are called non-comparable if neither
a ≤ b nor b ≤ a.

Example: Consider A = {1, 2, 3, 5, 6, 10, 15, 30} is ordered by divisibility. Determine all the
comparable and non-comparable pairs of elements of A.
Solution:
The comparable pairs of elements of A are:
{1, 2}, {1, 3}, {1, 5}, {1, 6}, {1, 10}, {1, 15}, {1, 30}, {2, 6}, {2, 10}, {2, 30}, {3, 6}, {3, 15}, {3, 30}, {5,
10}, {5, 15}, {5, 30}, {6, 30}, {10, 30}, {15, 30}
The non-comparable pair of elements of A are:
{2, 3}, {2, 5}, {2, 15}
{3, 5}, {3, 10}, {5, 6}, {6, 10}, {6, 15}, {10, 15}
Linearly Ordered Set or Totally ordered set:
Consider an ordered set A. The set A is called linearly ordered set or totally ordered set, if
every pair of elements in A is comparable.

Lattice:
A lattice is a poset, a partially ordered set, in which every pair of elements has
both a least upper bound and a greatest lower bound.

In other words, it is a structure with two binary operations:


Join
Meet A lattice is a partially ordered set with two
binary operations, join and meet. It is a
structure that has a least upper bound and a
greatest lower bound for every pair of
elements.
Lattices:
Let L be a non-empty set closed under two binary operations called meet and join, denoted
by ∧ and ∨.
Then L is called a lattice if the following axioms hold where a, b, c are elements in L:
1) Commutative Law: -
(i) a ∧ b = b ∧ a
(ii) a ∨ b = b ∨ a
2) Associative Law:-
(i) (a ∧ b)∧ c = a ∧(b∧ c)
(ii) (a ∨ b) ∨ c = a ∨ (b ∨ c)
3) Absorption Law: -
(i) a ∧ ( a ∨ b) = a
(ii) a ∨ ( a ∧ b) = a
Example 3. Determine whether the posets represented by each of the Hasse diagrams in figure are
lattices.

Solution:
The posets represented by the Hasse diagrams in (a) and (c) are both lattices because in each poset every
pair of elements has both a least upper bound and a greatest lower bound. On the other hand, the poşet
with the Hasse diagram shown in (b) is not a lattice, since the element b and c have no least upper bound.
It is to be noted that each of the elements d, e and ƒ is an upper bound, but none of these three elements
precedes the other two with respect to the ordering of this poset.
The partial ordering on the left indicates a lattice because each pair of elements has both a least upper
bound and greatest lower bound. In other words, each pair of elements is comparable.

However, the partial ordering on the right is not a lattice because elements b and c are
incomparable. Notice that while the upper bound for b and c is {d,e,f,g}, we can’t
identify which one of these vertices is the least upper bound (LUB) — therefore, this
poset is not a lattice.
Duality:
The dual of any statement in a lattice (L,∧ ,∨ ) is defined to be a statement that is obtained
by interchanging ∧ an ∨.
For example, the dual of a ∧ (b ∨ a) = a ∨ a is a ∨ (b ∧ a )= a ∧ a

Bounded Lattices:
A lattice L is called a bounded lattice if it has greatest element 1 and a least element 0.
Example:
(i)The power set P(S) of the set S under the operations of intersection and union is a bounded
lattice since ∅ is the least element of P(S) and the set S is the greatest element of P(S).
(ii)The set of +ve integer I+ under the usual order of ≤ is not a bounded lattice since it has a
least element 1 but the greatest element does not exist.
Properties of Bounded Lattices:
If L is a bounded lattice, then for any element a ∈ L, we have the following identities:
Øa ∨ 1 = 1
Øa ∧1= a
Øa ∨0=a
Øa ∧0=0
Example:

Every pair of elements has both a least upper


bound and a greatest lower bound.
Example: ({1,5,10,15,30,60},/)
suppose we are given the following partial ordering, indicated
in the Hasse diagram, and subset S = {10,15}. Then the least
upper bound of 10 and 15 is 30, which is the least common
multiple, and the place where 10 “joins” 15. And the greatest
lower bound of 10 and 15 is 5, which is the greatest common
divisor and the place where 10 “meets” 15.

Every pair of elements has both a least upper


bound and a greatest lower bound.
For example, let’s determine if the following posets are lattice using a Hasse diagram.

The partial ordering on the left indicates a lattice


because each pair of elements has both a least upper
bound and greatest lower bound. In other words, each
pair of elements is comparable.
However, the partial ordering on the right is not a
lattice because elements b and c are incomparable.
Notice that while the upper bound for b and c is
{d,e,f,g}, we can’t identify which one of these vertices is
the least upper bound (LUB) — therefore, this poset is
not a lattice.
Types of lattices:
Complete Lattice:
All subsets of a poset have a join and meet, such as the divisibility relation for the natural
numbers or the power set with the subset relation.
Bounded Lattice:
If the lattice has a least and greatest element, denoted 0 and 1 respectively.
Complemented Lattice:
A bounded lattice in which every element is complemented. Namely, the complement of 1 is
0, and the complement of 0 is 1.
Distributive Lattice:
If for all elements in the poset the distributive property holds.
Boolean Lattice:
A complemented distributive lattice, such as the power set with the subset relation.
Example:
Refer this
text book.

You might also like