BITS Pilani

Pilani Campus

Lattices
 Lattices

Definition : A poset [𝐴; ≤] is called a join-semilattice if any pair of

elements 𝑎, 𝑏 ∈ 𝐴 have an lub. This is denoted by 𝑎 ∨ 𝑏 and called
the join of 𝑎, 𝑏.

A poset [𝐴; ≤] is called a meet-semilattice if any pair of elements

𝑎, 𝑏 ∈ 𝐴 have a glb. This is denoted by 𝑎 ∧ 𝑏 and called the meet
of 𝑎, 𝑏.

Definition : A poset [𝐴; ≤] is called a lattice if any pair of elements

𝑎, 𝑏 ∈ 𝐴 have an lub as well as glb. Thus [𝐴; ≤] is called a lattice if
and only if it is both join-semilattice and meet- semilattice.

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Which of the following is a join-semilattice or meet-semilattice or
Lattice

Both are Lattice

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Which of the following is a join-semilattice or meet-semilattice or
Lattice

It is a meet-semilattice

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Which of the following is a join-semilattice or meet-semilattice or
Lattice

Neither join-semilattice nor meet-semilattice

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Which of the following is a join-semilattice or meet-semilattice or
Lattice

It is a join-semilattice

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Which of the following is a Lattice

𝒫 𝑈 ; ⊆ for a set 𝑈
Any totally ordered set
[𝑃; |] 𝑃 denotes the set of all positive integers
1) For a set 𝑈, [𝒫(𝑈); ⊆] is a lattice. 𝐴 ∨ 𝐵 = 𝐴 ∪ 𝐵, 𝐴 ∧ 𝐵 = 𝐴 ∩ 𝐵
for 𝐴, 𝐵 ∈ 𝒫(𝑈).
2) Any totally ordered set is a lattice, and if 𝑎 ≤ 𝑏, then a∨ 𝑏 =
𝑏, 𝑎 ∧ 𝑏 = 𝑎.
3) If 𝑃 denotes the set of all positive integers then [𝑃; |] is a lattice
with 𝑚 ∨ 𝑛 = lcm(𝑚, 𝑛), 𝑚 ∧ 𝑛 = gcd 𝑚, 𝑛 .

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Dual of a Poset

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Remarks

• A maximal element of a poset is a minimal element of its

dual and vice versa.
• The lub(B) in a poset becomes the glb(B) in its dual for any
poset.
• The least element in a poset becomes the greatest element
in its dual.
• The dual of a join-semilattice is a meet-semilattice and vice-
versa.
• Hasse diagram of the dual of a poset is obtained by
reflecting the Hasse diagram of that poset in a horizontal
mirror.

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

We prove (a), (d) leaving the rest as an exercise.
𝐿𝑒𝑡 𝑎 ∧ 𝑎 = 𝑏. Since 𝑏 is the glb(𝑎, 𝑎), 𝑏 is a lower bound of {𝑎},
thus 𝑏 ≤ 𝑎. On the other hand 𝑎 is a lower bound of {𝑎}, and 𝑏 is
the greatest lower bound of {𝑎}, hence 𝑎 ≤ 𝑏. By antisymmetry,
𝑏 = 𝑎.
Let 𝑐 = 𝑎 ∧ 𝑎 ∨ 𝑏 . Since 𝑎 ∨ 𝑏 is the least upper bound of 𝑎, 𝑏 ,
𝑎 ≤ 𝑎 ∨ 𝑏 . Also 𝑎 ≤ 𝑎, hence 𝑎 is a lower bound of {𝑎, 𝑎 ∨ 𝑏 }.
As 𝑐 is glb {𝑎, 𝑎 ∨ 𝑏 }, 𝑎 ≤ 𝑐. On the other hand 𝑐 is a lower bound
of {𝑎, 𝑎 ∨ 𝑏 }. Hence 𝑐 ≤ 𝑎. Thus by antisymmetry 𝑐 = 𝑎.

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956