Partial Order Relation: A relation R on a set A is said to be partial order relation if it is

(a) Reflexive
(b) Anti-symmetric
(c) Transitive

A = {1, 2, 3}
R1= { } – It is not reflexive, hence no need to check further.
R2= {(1, 1), (2, 2), (3, 3)} - It is reflexive, Anti-Symmetric and Transitive Hence Partial Order
Relation.
R3 = { (1,1), (2,2), (3,3), (1,2), (2,1)}- It is reflexive but not anti-symmetric hence not partial order relation
R4= { (1,1), (2,2), (3,3), (1,3), (2,3)} – It is reflexive, anti-symmetric and transitive hence partial order
relation

Partially Ordered Set (POSET): It is a set with a partial order relation defined on its elements.
Comparability :

Total Order Set :

Hasse Diagrams/POSET Diagram :

A= {1,2,3,4}
R= {(1,1), (1,2), (1,3), (1,4), (2,2), (2,3), (2,4), (3,3), (3,4), (4,4)}
Q: A= {1,2,3,6}
R= {(1,1), (1,2), (1,3), (1,6), (2,2), (2,6), (3,3), (3,6), (6,6)}

Poset: A set with a relation is called poset

Hasse Diagram

(1). [{1,2,3,4,5}, ≤] (2) [{1,2,3,4,6,12}, / ] (3) [{Φ, {1}, {2}, {1,2}}, ⊆]

Maximum /Minimum Elements:

Maximal Element: If in a poset, an element is not related to any other element.
Minimal Element: If in a poset, no element is related to an element.

Maximal = a,c Maximal = e, f

Minimal = d Minimal = a, b
 Maximal = f, h
Minimal = a,b,d

Maximal = a,b Minimal = f

Maximum Element: If it is maximal and every element is related to it

Minimum Element: If it is minimal and it is related to every element in poset.

Maximal = d,e minimal = a,b Maximal = e minimal =a

Maximum= no element minimum= no element Maximum = e, minimum = a

Bounds in POSETS

Upper Bound : Let B be a subset of set A. An element x ε A is in upper bound of B if (y,x)ε poset for all
y ε B.
Lower Bound: Let B be a subset of set A. An element x ε A is in lower bound of B if (x, y) ε poset for all
y ε B.
B= {e, c} B = {c, f, d}
LB(B)= {a, b, c} LB(B) = Φ
UB(B)= {g, e} UB(B) = {g, h, f}

B= {5, 10} B= {5, 10, 2, 4}

LB(B) = {1, 5} LB(B) = {1}
UB(B) = {10, 20, 50, 100} UB(B) = {20, 100, }

Least Upper Bound/ (LUB)/(Supremum)/(Join)/(ᵥ): Least (minimum) element in upper bound

Greatest lower bound /(GLB)/(Infimum)/ (meet)/ (^): Greatest (maximum) element in lower bound

B= {c, d} B= {a, b} B= {e,f}

UB(B)= {e} UB(B) = {e, d, f} UB(B)= Φ
LUB(B)= {e} LUB(B) = { d} LUB(B)= Φ
LB(B)= {a} LB(B) = Φ LB(B)= {a, d, b}
GLB(B)= {a} GLB(B) = Φ GLB(B)= {d}
B= {a,c,f} B= {d, c}
Meet-semi-lattice: In a poset, If GLB/MEET/Infimum/^ exists for every pair of element then POSET is
called Meet-semi-Lattice

GLB(e,f)= d
GLB(c,d)= a
GLB(a,b)= Φ (does not exist)
Hence it is not meet-semi-lattice

GLB(c,d)= b GLB(c,d)= c
GLB(b,a)= a GLB(b,a)= a
Here meet exist for every pair hence it is meet-semi-lattice
GLB(b,d)= Φ GLB(a,b)= Φ

GLB(c,d)= e
LB(a,b)= {c, d, e} but can’t find GLB because maxium value is c, d , hence a confusion , hence we can
say meet does not exist for pair (a, b) hence meet-semi-lattice does not exist

Here for every pair meet exist hence it is meet-semi-lattice

Join-Semi-Lattice: In a POSET, If LUB/Join/Supremum/ᵥ exist for every pair of element then POSET is
called Join-Semi-Lattice
LUB(e, f)= not exist hence it is not join-semi-lattice

cᵥd =?(not exist ) in second figure join exist for every pair hence it is
hence it is not join semi lattice join-semi-lattice

gᵥh=?not exist since join exist for every pair it is join-semi-lattice

it is not join semi
lattice

Since join of (a, b) does not exist hence it is not join-semi-lattice

Here join exist for every pair of both figure hence it is join semi lattice

aᵥb=? not exist hence it is not join semi lattice

Since join exist for every pair hence it is join-semi-lattice

Lattice: A POSET is called lattice if it is both MSL (meet-semi-lattice) and JSL (join-semi-lattice).

1. join of (a,b) does not exist 2. It is MSL and JSL for every pair 3. Join(h,i)=? And meet(e,f) = ?
Hence it is not lattice Hence it is lattice hence it is not lattice
4. join(e,d) = ? meet (a,b) = ? hence it is not lattice

join and meet exist for every pair of all the three figures Hence it is lattice

Join and meet exist for

Every pair of elements
Hence it is Lattice

meet (d, e)= ? join(b, c) = ? hence it is not lattice

join and meet exist for every pair of element, hence it is lattice

join (e, f)= ? and meet(a, b)= ? hence it is not lattice

meet and join exist for every pair of element, hence it is lattice.

join(i, h)= ? (not exist) hence it is not lattice

join and meet exist for every pair hence it is lattice

 join and meet exist for every pair hence it is lattice

join and meet exist for every pair hence it is lattice

both are not lattice

In some cases POSET diagram is not given, then POSET is drawn first after that existence of lattice is
checked.
1. {D12, /} , this D12 will contain all those elements which divides 12 perfectly hence this set becomes
[{1, 2, 3, 4, 6, 12}, /]
Try to make hasse diagram without making relation pairs

since join and meet exist hrnce it is laatice

2. [{1, 2, 3 ,4, 6, 9},/]

It is meet-semi-lattice

3. [{2, 3, 4, 6, 12}, /]

It is Join-semi-lattice

4. [{1, 2, 3, 5, 30}, /]

5. [{1, 2, 3, 6, 9, 18}, /]
 It is lattice
6. [{D45}, /]
= [{1, 3, 5, 9, 15, 45}, /]

It is lattice
Sub Lattices:

(a) It is not lattice

(b)

It is lattice
(c)

It is not lattice
(d)

It is also lattice

(1)

It is lattice

It is lattice
Properties of Lattice

(
 (1). Idempotent law

UB(b, b) = {b, d} LUB or Join (b, b) = { b}

LB(b, b) = {b, a} GLB or meet( b, b) = {b}

(2). Associative law

(BvD)v E = Bv(DvE)
CvE Bv C
C C
Associativity holds
(3) Commutative law:
It holds because order does not matter in case join and meet
(4) Distributive law:

aᵥ(bᶺc) = (a ᵥ b) ᶺ (a ᵥ c)
a ᵥg e ᶺ e
a e
Hence distributive law does not hold on lattice

Upper Bound of Lattice(Maximum)(I): In a Lattice L, If there exists an element I such that for all a ε L ,
(aRI), then I is called upper bound of the lattice.

Lower Bound of Lattice(Minimum)(O): In a Lattice L, If there exists an element O such that for all a ε L
, (ORa), then O is called lower bound of the lattice.

Maximal = {e, f}
Minimal = {a, b}
But no maximum or minimum or upper bound or lower bound
Maximum or upper bound = d
Minimum or lower bound = a

Maximum or upper bound = 4

Minimum or lower bound = 1

Can lattice be infinite ?? Of course. Lattice is a set with a relation . suppose we have (Z, ≤), now based
on this the lattice would be infinite
In above lattice, for each pair there would be join and meet but upper bound and lower bound would not
exist
In set theory, there is an upper bound called universal set and there is a lower bound called empty set (Φ)

Just like set lattice is also like universe

To find the complement of a lattice. lets us see the following

If in a lattice

Bounded lattice : A lattice L is called bounded lattice if It has upper bound (I) and lowe bound (O)

Complement of an element in a lattice: In a bounded lattice L, for any element a ε L, if there exists an
element b ε L such that aᵥb= I and aᶺb= O. that b is called complement of a, we can say a and b are
complement to each other

In set theory complement of universal set is phi (Uc = Φ ) and complement of phi is universal set (Φc =
U) in the same way, Ic = O and Oc = I
Since aᵥd= d and aᶺd = a hence ac = d and dc = a
Now since join(b,c)= d(I) and meet(b,c)= a(O) hence bc= c and cc = b

1. Always Ic = O and Oc=I

2. bc= c, d, e (in set theory, every set has its own complement and only one complement exist for every
set hence it should also exist in lattices but in lattice we see that sometimes there are many complement
for an element and sometimes no complement exist for an element )
3. in same way cc = b, d, e. dc= b, c, e and ec= b, c, d

ac=i, dc=f, there exist no complement for b,c,g,h,e

ac=g. bc=c, f. cc= b, d. dc=c, fc= b, no complement exist for e

Distributive Lattice: A Lattice is said to be distributive if for all a,b,c ε L
(1) aᵥ(b ᶺ c) = (a ᵥ b) ᶺ (a ᵥ c)
(2) a ᶺ (b ᵥ c) = (a ᶺ b) ᵥ (a ᶺ c)

Note: If a lattice is distributive then there should not be more than one complement for an element and it
should have atmost one complement (means either it will not have complement for an element or it will
have only one complement )

Alternatively, A Lattice is also said to be distributive if every element of lattice has atmost one
complement.
Complemented Lattice: A Lattice L is said to be complemented if every element, for example for all a ε
L must have at least one complement.
 every element has at least one complement hence complemented lattice

bc= e, ac= f, but d and c will not have complements hence it is not
complemented lattice

ac= f, bc= g, ec= g, c gc= e, b, for d no complement exists hence it is not

complemented lattice
 ac= f, bc= c, d, e, here every element has at least one complement ,
hence it is complemented lattice

Boolean Algebra : A lattice L is said to be a Boolean algebra if it is complemented and distributive

it has one complement (both distributive and complemented )for every element ,
hence it is Boolean algebra

Modular lattice: A lattice L is called modular lattice if for all element a,b,c ε L such that
a ᵥ (b ᶺ c) = ( a ᵥ b) ᶺ c where a <= c
a ᶺ (b ᵥ c) = ( a ᶺ b) ᵥ c where a >= c
Consider three element a, b and c and a<c hence check the condition
a ᵥ (b ᶺ c) = ( a ᵥ b) ᶺ c
LHS = a ᵥ (b ᶺ c)
= a ᵥO
= a
RHS= ( a ᵥ b) ᶺ c
= Iᶺc
= c
Hence it is not satisfied hence it is not modular lattice

Complete Lattice: A Lattice L is said to be complete lattice if every non empty subset of L has LUB and
GLB in L