Lattice Theory and Its Applications by

Lattice Theory and its Applications
by
Dr.R.Subbarayan
PG and Research Department of Mathematics,
Ramakrishna Mission Vivekananda College,
Chennai- 4
Lattice Theory and its Applications on 28-12-2020

INTRODUCTION
George Boole
Formalize the proportional Logic
Concept of Boolean algebra
Charles S.Peirce and Ernst Schroder
Further Development of lattice theory

INTRODUCTION(Contd..)
 Richard Dedekind
 Modularity and Weakened form of Distributive lattice
 Garret Birkhoff
 Development of lattice theory in other Mathematical
disciplines
 Lattice Theory Book [1940], [1948] [1967]
 Karl Menger, John Von Neumann
Oystein Ore
INTRODUCTION(Contd..)
Historical Background
In group theory, groups are defined algebraically as a model

of permutations.
The Cayley representation theorem then shows that this model is

correct :
Every group is isomorphic to a group of permutations.

 In the same way, we want to define a partial order
to be an abstract model of set containment ⊆.

Partially Ordered System
Definition:
A partially ordered set(Poset), or more briefly just
ordered set, is a system P = (P, ≤) where P is a nonempty
set and ≤ is a binary relation on P satisfying, for all
x, y, z ∈ P,
(1) x ≤ x (reflexivity)
(2) if x ≤ y and y ≤ x then x = y (antisymmetry)
(3) if x ≤ y and y ≤ z then x ≤ z (transitivity)

Examples
 P(X), the collection of all subsets of a set X, ordered by
⊆.
 Sub G, all subgroups of a group G, again ordered by set
containment.
 Any nonempty collection Q of subsets of X, ordered by
set containment, forms an ordered set.

More generally, if P is an ordered set and Q ⊆ P, then the
restriction of ≤ to Q is a partial order, leading to a new ordered
set Q.
Totally Ordered Set or Chain

The set ℜ of real numbers with its natural order is an
example of a rather special type of partially ordered set,
namely a totally ordered set, or chain.
C is a chain if for every x, y ∈ C, either x ≤ y or y ≤ x.

Covering Relation :
We say that x is covered by y in P, written
x≺y, if x < y and there is no z ∈ P with x < z < y.
It is clear that the covering relation

determines the partial order in a finite ordered
set P.

Hasse diagram:
A partially ordered set (P, ≤) can be graphically
represented by a diagram called Hasse diagram of the Poset
(P, ≤).
We define a Hasse diagram for a finite ordered set P, the
elements of P are represented by points in the plane, and a
line is drawn from a up to b precisely when a ≺ b.

Dual Property
Given an ordered set P = (P, ≤), we can form
another ordered set Pd = (P, ≥), called the dual of P,
with the order relation defined by x ≥ y iff y ≤ x.
In the finite case, the Hasse diagram of Pd is

obtained by simply turning the Hasse diagram of P
upside down.

Hasse Diagrams of Posets
Chain Antichain

Least Upper bound & Greatest Lower bound :
Let P be an ordered set, and let S be a subset of P.

An element x ∈ P is an upper bound for S if x ≥ s for all
s ∈ S. An upper bound x need not belong to S.
x is the least upper bound for S if x is an upper

bound for S and x ≤ y for every upper bound y of S.
If the least upper bound of S exists, then it is unique.
Lower bound and greatest lower bound are defined dually.

Definition and Examples of a Lattice
Define a lattice (L, ≤) as a partially ordered set any
two of whose elements x and y have a greatest lower bound
or meet, x ∧ y, and a least upper bound or join, x ∨ y.
In a lattice the least element, if it exists, is denoted
by 0 and the greatest element, if is exists, is denoted by 1.

Examples
1) Consider the set of positive integers Ι and the partial
ordering relation ≤ , is a lattice where “x ≤ y” , x∈I, y∈I is meant
x is a multiple of y.
Then x ∧ y will mean the greatest common divisor of x and y and
x ∨ y will mean the least common multiple of x and y.
For instance, 9 ∧ 6 = 3 and 9 ∨ 6 = 18.
2) Every chain is a lattice.

3. If X is a set, then the Poset (P({x, y, z}), ⊆) is a lattice,
where P(X) is the set of all subsets of the set X.

4. (D(30), ≤) is a lattice, where “≤” is the order ‘divisor
of ’ and the least element is 1 greatest element is 30.

Bounded lattice: A lattice which has both 0 and 1 is called a
bounded lattice.
Some Properties of Lattices
Theorem1: Let (L, ≤) be a lattice. Then L satisfies the following
laws:
L1: (Idempotent) x∧x = x and x ∨ x = x for all x∈ L
L2: (Commutative) x ∧ y = y ∧ x and x ∨ y = y ∨ x for all x, y ∈ L
L3: (Associative) (x ∧ y) ∧ z = x ∧ (y∧ z) and (x ∨ y) ∨ z = (x ∨ y)∨ z

for all x, y, z∈L
L4: (Absorbtive) x ∧ (x ∨ y) = x and x ∨ (x ∧ y) = x for all x,y∈ L

Theorem 2: Let (L, ≤) be a lattice. For any a, b ∈ L the following
are equivalent.
(i) a ≤ b
(ii) a ∨ b = b
(iii) a ∧ b = a
That is, (L, ≤) be a lattice iff the algebra (L, ∧, ∨ ) be a lattice.
Theorem 3: For any a, b, c, d in a lattice (L, ≤), if a ≤ b and

c ≤ d then a ∨ c ≤ b ∨ d and a ∧ c ≤ b ∧ d

Theorem 4: The elements of an arbitrary lattice (L, ≤) satisfy the
following inequalities
1. Distributive Inequalities
(i) x ∨ (y ∧ z) ≤ (x ∨ y) ∧ (x ∨ z)
(ii) x ∧(y ∨ z) ≥ (x ∧ y) ∨ (x ∧ z)
2. Modular Inequalities
(i) x ≤ z ⇒ x ∨(y∧ z) ≤ (x∨y)∧z
(ii) x ≥ z ⇒ x ∧(y ∨ z) ≥ (x ∧ y)∨z

Sublattice
A non empty subset S of a lattice L is called a sublattice of L if S is
closed under the operations ‘join’ and ‘meet’ of L.
That is, for all s1, s2 ∈ L, glb{s1, s2} and lub{s1, s2} in the lattice L are
elements of S

Lattice Homomorphism
Let (L1,∧, ∨) be a lattice and (L2, ⊓, ⊔) be lattices and
f: L1 → L2 be map. Then f is said to be a
(i) Meet-homomorphism if
f(x ∧ y) = f(x) ⊓ f(y) for all x, y ∈L1
(ii) Join-homomorphism if
f(x ∨ y) = f(x)⊔ f(y) for all x, y ∈L1
(iii) Lattice homomorphism if it is both

meet –homomorphsm and join-homomorphsm.
Lattice Isomorphism
A one-one and onto lattice homomorphism is called lattice
isomorphism.
The following lattices are isomorphic.

Product Lattice of Two Lattices
Let (L, ∧, ∨) and (M, ⊓, ⊔) be two lattices. Consider the Cartesian

product L x M ={(x, y) / x ∈ L and y ∈ M}.
We define binary operations ∧ and ∨ on L x M as follows:
for all (x1, y1), (x2, y2) ∈ L x M
(x1, y1) ∧ (x2, y2) = (x1∧ x2, y1 ⊓ y2)
(x1, y1) ∨ (x2, y2) = (x1∨ x2, y1 ⊔ y2)
Then (L x M, ∧, ∨) is a lattice
MODULAR LATTICES
z
y
x

In lattice N5,
x≤z
 x ∧ z = x and x ∨ z = z
x∧y=0=z ∧y
x∨y=1=y∨z
 x ∨ (y ∧ z) = x ∨ 0 = x
 (x ∨ y)∧ z = 1 ∧ z = z
 So x ∨ (y ∧ z) ≠ (x ∨ y) ∧ z
 x ∨ (y ∧ z ) = x and (x ∨ y) ∧ x ∨ z = 1 ∧ z = z
 So x ∨ (y ∧ z ) ≠ (x ∨ y) ∧ x ∨ z
Definition: A lattice L is called Modular if for all x, y, z ∈ L
x ≤ z ⇒ x ∨ (y ∧ z) = (x ∨ y) ∧ z (Modular Equation)
Examples
(1) The lattice of all subspace of a vector space is Modular under ≤

defined by A ≤ B if and only if A ⊆ B.
where A ∨ B = A + B and A ∧ B = A⋂B.
(2) Any chain is modular
(3) The lattice N5 is not modular

Theorem 1 : A lattice is modular if and only if none of its sublattices
is isomorphic to the pentagon lattice N5.
Theorem 2 : A lattice L is modular if and only if for all x, y, z ∈ L
(i) x ∨ (y ∧ (x ∨ z )) = (x ∨ y) ∧ (x ∨ z )
(ii) (x ∨ (y ∧ z)) ∧ (y ∨ z )) = (x ∧ (y ∨ z)) ∨ (y ∧ z)
Theorem 3 : If G is a group, then the set of all normal subgroups of

G forms a modular lattice.

DISTRIBUTIVE LATTICES
Definition: A lattice L is called Distributive if either of the following
conditions hold for all x, y, z ∈ L
 x ∨ (y ∧ z ) = (x ∨ y) ∧ x ∨ z
 x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z)
If one of the distributive equations holds for all x, y, z ∈ L then by

the duality principle, the other distribution holds for x, y, z ∈ L

Examples
(1) If X is set, then (P(X), ∩, ∪) is a distributive lattice.
(2) Every chain is distributive lattice
(3) Every distributive lattice is modular
(4) N5 is not distributive
(5) The diamond lattice M3 is modular but it s not distributive

Lattice D(12), is distributive , since D(12) has no sublattice
isomorphic to N5 or M3

Complemented Lattice
Definition: A lattice L with 0 and 1 is called complemented if for

each Distributive x ∈ L there is at least one y ∈ L such that
x ∧ y = 0 and x ∨ y = 1.
Every element in the lattice L has a complement then it is called

Complemented lattice.
Boolean Algebra
Definition: A complemented distributive lattice is called a Boolean

Algebra or a Boolean Lattice.

Boolean Algebra (contd..)
A complemented distributive lattice is known as a Boolean Algebra.
It is denoted by (B, ∧, ∨,' , 0, 1), where B is a set on which two binary

operations ∧ (*) and ∨(+) and a unary operation (complement) are
defined.
Here 0 and 1 are two distinct elements of B.
Since (B, ∧, ∨) is a complemented distributive lattice, therefore each

element of B has a unique complement.

Properties of Boolean Algebra:
1. Commutative Properties:
(i)a + b = b + a
(ii)a * b = b * a
2. Distributive Properties
(i) a + (b * c) = (a + b) * (a + c)
(ii)a *(b + c) = (a * b) + (a * c)
3. Identity Properties
(i) a + 0 = a
(ii) a * 1 = a
4. Complemented Laws:
(i) a + a‘ = 1
(ii)a * a‘ = 0
Example: Consider the Boolean algebra D70 whose Hasse
diagram is shown in fig:
Clearly, A= {1, 7, 10, 70} and B = {1, 2, 35, 70} is a sub-algebra of

D70. Since both A and B are closed under operation ∧, ∨ and '.
APPLICATIONS
Boolean algebra is a form of mathematics developed by
English mathematician George Boole (1815–1864).
Boole created a system by which certain logical statements can be
expressed in mathematical terms.
The consequences of those statements can then be discovered by
performing mathematical operations on the symbols.

 As a simple example, consider the following two statements:
P: "I will be home today" and
Q: "I will be home tomorrow."
 The rules of Boolean algebra can be used to find out the

consequences of various combinations of these two propositions,
P and Q.
 The two statements can be combined in one of two ways:
 P or Q: I will be home today OR I will be home tomorrow.
 P and Q: I will be home today AND I will be home tomorrow.

 Now the question that can be asked is what conclusions can one
draw if P and Q are either true (T) or false (F).
 For example, what conclusion can be drawn if P and Q are both
true?
 In that case, the combination P or Q is also true.
 That is, if the statement "I will be home today" (P) is true, and the
statement "I will be home tomorrow" (Q) is also true, then the
combined statement,
 "I will be home today OR I will be home tomorrow" (P or Q) must
also be true.
 Two things about Boolean algebra make it a very important form
of mathematics for practical applications.
 First, statements expressed in everyday language (such as "I will

be home today") can be converted into mathematical
expressions, such as letters and numbers.
 Second, those symbols generally have only one of two values.

The statements above (P and Q), for example, are either true or
false.
 That means they can be expressed in a binary system: true or

false; yes or no; 0 or 1.
 Binary mathematics is the number system most often used with
computers.
 Computer systems consist of magnetic cores that can be

switched on or switched off.
 The numbers 0 and 1 are used to represent the two possible

states of a magnetic core.

 Boolean statements can be represented, then, by the numbers
0 and 1 and also by electrical systems that are either on or off.
 As a result, when engineers design circuitry for
 personal computers,
 pocket calculators,
 compact disc players,
 cellular telephones, and
 a host of other electronic products, they apply the principles

of Boolean algebra.
Boolean Algebra Truth Tables
A standard Boolean Expression, the input and output

information of any Logic Gate or circuit can be plotted into a
standard table to give a visual representation of the switching
function of the system.

Truth Table
The table used to represent the Boolean expression of a logic gate

function is commonly called a Truth Table.
A logic gate truth table shows each possible input combination to

the gate or circuit with the resultant output depending upon the
combination of these input(s).

BOOLEAN ALGEBRA EXAMPLES
EXAMPLE 1

EXAMPLE 2

REFERENCES
1) General Lattice Theory by Grätzer G., Birkhäuser Basel, 1978
2) Introduction to Lattices and Order by B.A.Davey
and H.A.Priestley , University of Oxford 2nd edition
3) Discrete Mathematics by M.K.Venkatraman and others,
The National Publishing Company, 2000.
4) Discrete Mathematics by T.Veerarajan, Tata McGraw Hill, Ltd

THANK YOU

Lattice Theory and Its Applications by

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lattice Theory and Its Applications by

Uploaded by

Copyright:

Available Formats

Lattice Theory and its Applications

Lattice Theory and its Applications on 28-12-2020

Formalize the proportional Logic

Concept of Boolean algebra

Charles S.Peirce and Ernst Schroder

Further Development of lattice theory

Lattice Theory and its Applications on 28-12-2020

 Modularity and Weakened form of Distributive lattice

 Development of lattice theory in other Mathematical

 Lattice Theory Book [1940], [1948] [1967]

 Karl Menger, John Von Neumann

In group theory, groups are defined algebraically as a model

The Cayley representation theorem then shows that this model is

Lattice Theory and its Applications on 28-12-2020

to be an abstract model of set containment ⊆.

Lattice Theory and its Applications on 28-12-2020

Lattice Theory and its Applications on 28-12-2020

Lattice Theory and its Applications on 28-12-2020

Totally Ordered Set or Chain

Lattice Theory and its Applications on 28-12-2020

It is clear that the covering relation

Lattice Theory and its Applications on 28-12-2020

Lattice Theory and its Applications on 28-12-2020

In the finite case, the Hasse diagram of Pd is

Lattice Theory and its Applications on 28-12-2020

Lattice Theory and its Applications on 28-12-2020

Let P be an ordered set, and let S be a subset of P.

x is the least upper bound for S if x is an upper

If the least upper bound of S exists, then it is unique.

Lower bound and greatest lower bound are defined dually.

Lattice Theory and its Applications on 28-12-2020

Define a lattice (L, ≤) as a partially ordered set any

two of whose elements x and y have a greatest lower bound

or meet, x ∧ y, and a least upper bound or join, x ∨ y.

In a lattice the least element, if it exists, is denoted

by 0 and the greatest element, if is exists, is denoted by 1.

Lattice Theory and its Applications on 28-12-2020

1) Consider the set of positive integers Ι and the partial

ordering relation ≤ , is a lattice where “x ≤ y” , x∈I, y∈I is meant

Then x ∧ y will mean the greatest common divisor of x and y and

x ∨ y will mean the least common multiple of x and y.

For instance, 9 ∧ 6 = 3 and 9 ∨ 6 = 18.

2) Every chain is a lattice.

Lattice Theory and its Applications on 28-12-2020

Lattice Theory and its Applications on 28-12-2020

Lattice Theory and its Applications on 28-12-2020

L1: (Idempotent) x∧x = x and x ∨ x = x for all x∈ L

L2: (Commutative) x ∧ y = y ∧ x and x ∨ y = y ∨ x for all x, y ∈ L

L3: (Associative) (x ∧ y) ∧ z = x ∧ (y∧ z) and (x ∨ y) ∨ z = (x ∨ y)∨ z

L4: (Absorbtive) x ∧ (x ∨ y) = x and x ∨ (x ∧ y) = x for all x,y∈ L

Lattice Theory and its Applications on 28-12-2020

Theorem 3: For any a, b, c, d in a lattice (L, ≤), if a ≤ b and

Lattice Theory and its Applications on 28-12-2020

(i) x ≤ z ⇒ x ∨(y∧ z) ≤ (x∨y)∧z

(ii) x ≥ z ⇒ x ∧(y ∨ z) ≥ (x ∧ y)∨z

Lattice Theory and its Applications on 28-12-2020

A non empty subset S of a lattice L is called a sublattice of L if S is

closed under the operations ‘join’ and ‘meet’ of L.

Lattice Theory and its Applications on 28-12-2020

(iii) Lattice homomorphism if it is both

Lattice Theory and its Applications on 28-12-2020

Let (L, ∧, ∨) and (M, ⊓, ⊔) be two lattices. Consider the Cartesian