Properties of Lattices

Let ( ,∨,∧) be a given lattice, then ∨ ∧ satisfies the following

∴ ∨ =
∧ = ( , )= ( )=

∴ ∧ =
Property 2 (Commutative law)
Let ( ,∨,∧) be a given lattice, then for any , ∈ , ∨ = ∨ and
∧ = ∧ .
Proof:
∨ = ( , )= ( , )= ∨
∴ ∨ = ∨
Now ∧ = ( , )= ( , )= ∧
∴ ∧ = ∧
Property 3 (Associative law)
Let ( ,∨,∧) be a given lattice, then for any , , ∈ , ∨( ∨ )=
( ∨ ) ∨ and
 ∧( ∧ )= ( ∧ )∧
Proof:
∨( ∨ )= − − − − − − − − − − − −(1)
( ∨ )∨ = − − − − − − − − − − − − − − − −(2)
(1) ⇒ ( , ∨ )
⇒ ≤ ∨ ≤ − − − − − − − − − −(3)
We know that ∨ is LUB of ( , )
⇒ ≤ ∨ ≤ ∨ − − − − − − − − − (4)
From (3) and (4)
≤ , ≤ , ≤ − − − − − − − − − −(5)
Now ≤ , ≤ ⇒ ∨ ≤
Now ∨ ≤ ≤
⇒ ( ∨ )∨c≤ − − − − − − − − − (6)
From (2) and (6), ≤ − − − − − − − − − − − (7)
Similarly we can prove ≤ − − − − − − − − − (8)
∴ = [by antisymmetry of (7) and (8)]
i.e., ∨( ∨ )=( ∨ )∨
Similarly we can prove ∧( ∧ )= ( ∧ )∧
Property 4 (Absorption law)
Let ( ,∨,∧) be a given lattice, then for any , ∈ , ∨( ∧ ) =
∧( ∨ ) =
Proof:
Since ∧ is the GLB of { , } we have
∧ ≤ − − − − − − − − − − − − − −(1)
Obviously
≤ − − − − − − − − − − − − − −(2)
From (1) and (2) we have ∨( ∧ )≤ −−−−−−−−−−−
−(3)
Also ≤ ∨ ( ∧ ) − − − −(4)
From (3) and (4), by antisymmetry we get ∨( ∧ )=
Similarly we can prove ∧( ∨ )=
Property 5
Let ( ,∨,∧) be a given lattice, in which ∧ ∨ denote the operation of
meet and join respectively, then for any , ∈ , ≤ ⇔( ∨ )=
⇔( ∧ )= . In other words
() ≤ ∨ =
( ) ≤ ∧ =
( ) ∧ = ∨ =
Proof:
Let ≤
Now ≤ (by reflexivity)
∴ ∨ ≤ − − − − − − − (1)
Since ∨ is the LUB of { , } ,we have
≤ ∨ − − − − − − − (2)
From (1) and (2), we get ∨ = − − − − − − − (3)
Let ∨ =
Since ∨ is the LUB{ , },
≤ ∨
i.e., ≤ − − − − − − −(4)
From (3) and (4), result ( ) follows.
Similarly we can prove ( ) and ( )
Property 6 (Isotonic property)
If { , ≤} is a lattice for any , , ∈ the following properties hold good.
If ≤ then ( ) ∨ ≤ ∨ ( ) ∧ ≤ ∧
Proof:
Given ≤
By previous property, ∧ = , ∨ = − − − − − − − − − (1)
() ∨ ≤ ∨
To prove ( ) it is enough to prove that ( ∨ ) ∨ ( ∨ ) = ∨
LHS ( ∨ ) ∨ ( ∨ )
= ∨( ∨ )∨ Associative law
= ∨( ∨ )∨ Commutative law
= ( ∨ ) ∨ ( ∨ ) Associative law
= ∨( ∨ ) Idempotent law
 = ∨ Using (1)
This is of the form ∨ = . ∴ ≤ by previous property
i.e., ∨ ≤ ∨
(ii) ∧ ≤ ∧
To prove (ii) it is enough to prove that ( ∧ ) ∧ ( ∧ ) = ∧
LHS ( ∧ ) ∧ ( ∧ )
= ∧( ∧ )∧ Associative law
= ∧( ∧ )∧ Commutative law
= ( ∧ ) ∧ ( ∧ ) Associative law
= ∧( ∧ ) Idempotent law
= ∧ Using (1)
This is of the form ∧ = .
∴ ≤ by previous property
i.e., ∧ ≤ ∧
Property 7 (Distributive Inequalities)
If { , ≤} is a lattice, then for any , , ∈
(i) a∧( ∨ )≥( ∧ )∨( ∧ )
(ii) a ∨ ( ∧ ) ≤ ( ∨ ) ∧ ( ∨ ).
Proof:
Since ∧ is the GLB (a,b), ∧ ≤ ----------------(1)
Also ∧ ≤b≤ ∨ -----------------(2)
 ∴ ∧ ≤ a∧( ∨ ) ------------------(3)
Similarly ∧ ≤a
∧ ≤ ≤ ∨
∴ ∧ ≤a∧( ∨ ) -------------------(4)
From (3) & (4) we get ( ∧ ) ∨ ( ∧ ) ≤ a ∧ ( ∨ )
i.e., a ∧ ( ∨ ) ≥ ( ∧ ) ∨ ( ∧ ) which is result (i)
Using the principle of duality we will get the result (ii)
Property 8 (Modular Inequality)
If { , ≤} is a lattice, then for any , , ∈ , ≤ ⇔a∨( ∧ )≤( ∨
)∧ .
Proof:
Since ≤ , ∨ = ----------(1) by property 5(i)
a ∨ ( ∧ ) ≤ ( ∨ ) ∧ ( ∨ ) ---------------(2) by using distributive
inequality
a∨( ∧ )≤( ∨ )∧ -------------(3) [by (1)]
Now a ∨ ( ∧ ) ≤ ( ∨ ) ∧
∴ ≤a∨( ∧ )≤( ∨ )∧ ≤
i.e. ≤ -------------------(4)
From (3) & (4), we get ≤ ⇔a∨( ∧ )≤( ∨ )∧ .