Scribd
Upload
1 views2 pages

Lattice Theory Proof

The document discusses the properties of lattice theory, specifically demonstrating that the infimum (l ∧ m) and supremum (l ∨ m) of any two elements l and m in a lattice L exist. It also presents the duality principle, stating that if (L, ρ) is a lattice, then its inverse (L, ρ⁻¹) is also a lattice. The proofs provided establish the relationships between elements in a lattice and their bounds.

Uploaded by

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

Lattice Theory Proof

The document discusses the properties of lattice theory, specifically demonstrating that the infimum (l ∧ m) and supremum (l ∨ m) of any two elements l and m in a lattice L exist. It also presents the duality principle, stating that if (L, ρ) is a lattice, then its inverse (L, ρ⁻¹) is also a lattice. The proofs provided establish the relationships between elements in a lattice and their bounds.

Uploaded by

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

Lattice Theory and Duality Principle

Let l, m ∈ L be any two elements.


Now
(l ∧ m) ∨ l = l ∨ (l ∧ m) (by commutativity)
=l (by absorption)
⇒ (l ∧ m) ∧ l = l ∧ m (by remark 3.67)
⇒l∧m≤l (by the given condition) .... (2)

Again
(l ∧ m) ∨ m = m ∨ (l ∧ m) (by commutativity)
= m ∨ (m ∧ l) (by commutativity)
=m (by absorption)
⇒ (l ∧ m) ∧ m = l ∧ m (by remark 3.67)
⇒l∧m≤m (by the given condition) .... (3)

From (2) and (3) l ∧ m is a lower bound of {l, m}. Let n ∈ L be any lower bound of {l, m}.
⇒ n ≤ l and n ≤ m
⇒ n ∧ l = n and n ∧ m = n (by the given condition) .... (4)
Consider n ∧ (l ∧ m) = (n ∧ l) ∧ m (by associativity)
= n ∧ m (by 4)
=n (by 4)
⇒n≤l∧m (by the given condition)
⇒ l ∧ m = inf {l, m}

∴ (L, ≤) is a lattice ordered set.


Similarly we can prove that l ∨ m = sup {l, m}

DUALITY PRINCIPLE OF A LATTICE

Theorem 3.69
If (L, ρ) is a lattice then (L, ρ⁻¹) is also a lattice, where ρ⁻¹ is the inverse of ρ.
OR
Dual of a lattice is a lattice.

Proof: We are given that (L, ρ) is a lattice and (L, ρ⁻¹) is its dual where ρ⁻¹ is defined by
l ρ m ⇔ m ρ⁻¹ l, for all l, m ∈ L. We have already proved that the dual of a poset is a poset.

Let l, m ∈ L be any elements, then as (L, ρ) is a lattice, sup {l, m} exists in L.


Let it be l ∨ m.
Then l ρ (l ∨ m) and m ρ (l ∨ m)
⇒ (l ∨ m) ρ⁻¹ l and (l ∨ m) ρ⁻¹ m
⇒ (l ∨ m) is a lower bound of {l, m} in L.

You might also like