Professional Documents
Culture Documents
2 Distributive Lattices
2 Distributive Lattices
FACT 1:
For any lattice <A,≤>: 1 and 2 and 3 and 4 hold in <A,≤>:
The distributive inequalities:
1. for every a,b,c ∈ A: (a ∧ b) ∨ (a ∧ c) ≤ a ∧ (b ∨ c)
2. for every a,b,c ∈ A: a ∨ (b ∧ c) ≤ (a ∨ b) ∧ (a ∨ c)
3. for every a,b,c ∈ A: (a ∧ b) ∨ (b ∧ c) ∨ (a ∧ c) ≤ (a ∨ b) ∧ (b ∨ c) ∧ (a ∨ c)
The modular inequality:
4. for every a,b,c ∈ A: (a ∧ b) ∨ (a ∧ c) ≤ a ∧ (b ∨ (a ∧ c))
FACT 2:
For any lattice <A,≤>: 5 holds in <A,≤> iff 6 holds in <A,≤> iff 7 holds in <A,≤>:
5. for every a,b,c ∈ A: a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c)
6. for every a,b,c ∈ A: a ∨ (b ∧ c) = (a ∨ b) ∧ (a ∨ c)
7. for every a,b,c ∈ A: a ∨ (b ∧ c) ≤ b ∧ (a ∨ c).
FACT 3:
For any lattice <A,≤>: 8 holds in <A,≤> iff 9 holds in <A,≤>:
8. for every a,b,c ∈ A:(a ∧ b) ∨ (a ∧ c) = a ∧ (b ∨ (a ∧ c))
9. for every a,b,c ∈ A: if a ≤ b then a ∨ (b ∧ c) = b ∧ (a ∨ c)
o1 o1
oz oy xo oy oz
ox o0
o0
THEOREM 5: A lattice is modular iff the pentagon cannot be embedded in it.
PROOF:
1. The pentagon is not modular.
x≤y
x ∨ ( y ∧ z) = x
y ∧ (x ∨ z) = y
The class of modular lattices is defined by identity 8, hence it is closed under sublattices:
every sublattice of a modular lattice is itself a modular lattice.
If the pentagon can be embedded in a lattice, then that lattice has a non-modular
sublattice, hence it is not modular.
We first show:
a < b, ¬(c ≤ a), ¬(a ≤ c), ¬(c ≤ b), ¬(b ≤ c)
a<b
Namely:
a ≤ b. If a = b, then a ∨ (b ∧ c) = a ∨ (a ∧ c) = a and b ∧ (a ∨ c) = a ∧ (a ∨ c) = a.
Hence a ∨ (b ∧ c) = b ∧ (a ∨ c), contradicting the assumption. Hence a ≠ b.
Hence a < b.
¬(a ≤ c)
Namely:
If a ≤ c, then a ∨ c = c, hence b ∧ (a ∨ c) = b ∧ c.
Since a ≤ b and a ≤ c, a ≤ b ∧ c. Then a ∨ (b ∧ c) = b ∧ c. Hence
b ∧(a ∨ c) = a ∨ (b ∧ c), contradicting the assumption.
Hence ¬(a ≤ c).
¬(c ≤ a)
Namely:
If c ≤ a, then c ≤ b, hence b ∧ c = c, hence a ∨ (b ∧ c) = a ∨ c = a.
Similarly, b ∧ (a ∨ c) = b ∧ a = a. Then b ∧(a ∨ c) = a ∨ (b ∧ c), contradicting the
assumption.
Hence ¬(c ≤ a).
¬(b ≤ c)
Namely:
If b ≤ c, then b ∧ c = b. Then a ∨ (b ∧ c) = b. Also a ∨ c = c, hence
b ∧ (a ∨ c) = b. Then b ∧(a ∨ c) = a ∨ (b ∧ c), contradicting the assumption.
Hence ¬(b ≤ a).
¬(c ≤ b)
Namely:
If c ≤ b, then b ∧ c = c, hence a ∨ (b ∧ c) = a ∨ c. Since a ≤ b and c ≤ b,
a ∨ c ≤ b. Hence b ∧ (a ∨ c) = (a ∨ c). Then b ∧(a ∨ c) = a ∨ (b ∧ c), contradicting the
assumption. Hence ¬(c ≤ b).
Now let:
1' = a ∨ c
z=c
y = b ∧ (a ∨ c)
x = a ∨ (b ∧ c)
0' = b ∧ c
0' < x
Namely:
b ∧ c ≤ a ∨ (b ∧ c)
If b ∧ c = a ∨ (b ∧ c), then a ≤ b ∧ c, and hence a ≤ c. But ¬(a ≤ c).
Hence b ∧ c ≠ a ∨ (b ∧ c).
Hence 0' < x.
x<y
Namely:
(2.) under FACT 1, tells us that a ∨ (b ∧ c) ≤ (a ∨ b) ∧ (a ∨ c).
Since a < b, a ∨ b = b, Hence we know that:
a ∨ (b ∧ c) ≤ b ∧ (a ∨ c).
By the assumption, it follows that:
a ∨ (b ∧ c) < b ∧ (a ∨ c).
Hence x < y.
y < 1'
Namely:
b ∧ (a ∨ c) ≤ a ∨ c
If b ∧ (a ∨ c) = a ∨ c, then a ∨ c ≤ b, and hence c ≤ b. But ¬(c ≤ b).
Hence b ∧ (a ∨ c) ≠ a ∨ c.
Hence y < 1'.
0<z
Namely:
b∧c≤c
If b ∧ c = c, c ≤ b. But ¬(c ≤ b).
Hence b ∧ c ≠ c.
Hence 0' < z.
z < 1'
Namely:
c≤a∨c
If c = a ∨ c, then a ≤ c. But ¬(a ≤ c).
Hence c ≠ a ∨ c.
Hence z < 1'.
z ∧ y = 0'
Namely:
z ∧ y = c ∧ (b ∧ (a ∨ c)) = (c ∧ (a ∨ c)) ∧ b = b ∧ c = 0'
z ∨ x = 1'
Namely:
z ∨ x = c ∨ (a ∨ (b ∧ c)) = (c ∨ (b ∧ c)) ∨ a = a ∨ c = 1'
z ∧ x = 0'
Namely:
z ∧ y = 0' and 0' ≤ x, hence z ∧ y ≤ x. z ∧ y ≤ z, hence z ∧ y ≤ z ∧ x.
x ≤ y, hence z ∧ x ≤ y. z ∧ x ≤ z, hence z ∧ x ≤ z ∧ y.
Hence z ∧ x = z ∧ y, hence z ∧ x = 0'.
z ∨ y = 1'
Namely:
z ∨ x = 1' and y ≤ 1', hence y ≤ z ∨ x. z ≤ z ∨ x, hence z ∨ y ≤ z ∨ x.
x ≤ y, hence x ≤ z ∨ y. z ≤ z ∨ y, hence z ∨ x ≤ z ∨ y.
Hence z ∨ y = z ∨ x , hence z ∨ y = 1'.
What we have shown now is that {0',x,y,z,1'} ⊆ A is closed under join and meet. Hence
<{0',x,y,z,1'},≤⌠{0',x,y,z,1'}> is a sublattice of <A,≤>. But, of course, this sublattice of
<A,≤> is isomorphic to the pentagon, hence the pentagon can be embedded in <A,≤>. ◄
THE STORY IN PICTURES
b∨c
b a∨c
b ∧ (a ∨ c)
c
a ∨ (b ∧ c)
a b∧c
a∧c
We need to check now which of the lines in this picture represent 'smaller than' and
which represent 'smaller or equal than'. This is done in the following picture: thick and
double lines represent 'smaller than', thin lines represent 'smaller or equal than':
b
1'
y
z=c
x
0'
a
Homomorphisms can contract thin lines, but not thick or double lines. This means that
the picture really stands for two structures: A1, where a < x, A1 = AF, and A2 where a =
x. A2 is the pentagon.
We know then that A contains the sublattice in the picture, [{a,b,c}], which is either AF,
which contains the pentagon as a sublattice, or the pentagon itself.
THEOREM 6: A modular lattice is distributive iff the diamond cannot be embedded
in it.
PROOF:
1. The diamond is modular, but not distributive.
That the diamond is modular follows from theorem 5. Obviously the pentagon cannot be
embedded in it.
The diamond is not distributive:
y ∨ (x ∧ z) = y
(y ∨ x) ∧ (y ∨ z) = 1
The class of distributive lattices is defined by identity 5, hence it is closed under
sublattices: every sublattice of a distributive lattice is itself a distributive lattice.
If the diamond can be embedded in a lattice, then that lattice has a non-distributive
sublattice, hence it is not distributive.
Namely:
If a ≤ b, then a ∧ b = a. Hence (a ∧ b) ∨ (a ∧ c) = a ∨ (a ∧ c) = a
Then a < a ∧ (b ∨ c), which is impossible. Hence ¬(a ≤ b).
Obviously, the same argument shows that ¬(a ≤ c) and ¬(c ≤ a).
1' = (a ∨ b) ∧ (a ∨ c) ∧ (b ∨ c)
x = (a ∧ 1') ∨ 0'
y = (b ∧ 1') ∨ 0'
z = (c ∧ 1') ∨ 0'
0' = (a ∧ b) ∨ (a ∧ c) ∨ (b ∧ c)
0 ≤ 1' .
This is (3.) of FACT 1.
(a ∧ 1') = a ∧ (b ∨ c)
Namely:
1. (a ∧ 1') =
2. a ∧ ((a ∨ b) ∧ (a ∨ c) ∧ (b ∨ c)) =
3. a ∧ (b ∨ c)
Similarly:
(a ∨ 0') = a ∨ (b ∧ c)
(a ∧ 0') = (a ∧ b) ∨ (a ∧ c)
Namely:
1. (a ∧ 0') =
2. a ∧ ((a ∧ b) ∨ (a ∧ c) ∨ (b ∧ c)) =
3. a ∧ (((a ∧ b) ∨ (b ∧ c)) ∨ (a ∧ c)) = [by modularity]
4. (a ∧ ((a ∧ b) ∨ (b ∧ c))) ∨ (a ∧ c) =
5. ((a ∧ ((b ∧ c) ∨ (a ∧ b))) ∨ (a ∧ c) = [by modularity]
6. ((a ∧ (b ∧ c)) ∨ (a ∧ b)) ∨ (a ∧ c) =
7. (a ∧ b ∧ c) ∨ (a ∧ b) ∨ (a ∧ c).= [since a ∧ b ∧ c ≤ a ∧ b]
8. (a ∧ b) ∨ (a ∧ c)
Similarly:
(a ∨ 1') = (a ∨ b) ∧ (a ∨ c)
(a ∧ x) = (a ∧ 1')
Namely:
1. (a ∧ x) =
2. (a ∧ ((a ∧ 1') ∨ 0') =
3. (a ∧ (0' ∨ (a ∧ 1'))) = [by modularity]
4. (a ∧ 0') ∨ (a ∧ 1') = [because, by (1) of FACT 1, (a ∧ 0') ≤ (a ∧ 1')]
5. (a ∧ 1').
x ∧ y = 0'
Namely:
1. x ∧ y =
2. ((a ∧ 1') ∨ 0') ∧ ((b ∧ 1') ∨ 0')
2. ((a ∧ 1') ∨ 0') ∧ ((b ∧ 1') ∨ 0') = [by 0/(b ∧ 1') ∨ 0' modulation]
3. ((a ∧ 1') ∧ ((b ∧ 1') ∨ 0')) ∨ 0'
a ∧ 1' = a ∧ (b ∨ c)
b ∨ 0' = b ∨ (a ∧ c)
So,
6. ((a ∧ 1') ∧ (b ∨ 0')) ∨ 0' =
7. ((a ∧ (b ∨ c)) ∧ (b ∨ (a ∧ c))) ∨ 0' =
8. ((b ∨ c) ∧ (a ∧ (b ∨ (a ∧ c)))) ∨ 0' = [modularity]
9. ((b ∨ c) ∧ ((a ∧ b) ∨ (a ∧ c))) ∨ 0'
By (1) of FACT 1:
((a ∧ b) ∨ (a ∧ c)) ≤ (b ∨ c),
Hence:
(b ∨ c) ∧ ((a ∧b) ∨ (a ∧ c)) = (a ∧b) ∨ (a ∧ c),
and hence:
x ∨ y = 1'
Namely:
1. x ∨ y =
2. ((a ∧ 1') ∨ 0') ∨ ((b ∧ 1') ∨ 0') = [by twice 0'/1' modulation]
3. ((a ∨ 0') ∧ 1') ∨ ((b ∨ 0') ∧ 1')
3. ((a ∨ 0') ∧ 1') ∨ ((b ∨ 0') ∧ 1') = [by (b ∨ 0') ∧ 1'/1' modulation]
4. ((a ∨ 0') ∨ ((b ∨ 0') ∧ 1')) ∧ 1'
a ∨ 0' = a ∨ (b ∧ c)
b ∧ 1' = b ∧ (a ∨ c)
So,
6. ((a ∨ 0') ∨ (b ∧ 1')) ∧ 1' =
7. ((a ∨ (b ∧ c)) ∨ (b ∧ (a ∨ c))) ∧ 1' =
8. ((b ∧ c) ∨ (a ∨ (b ∧ (a ∨ c)))) ∧ 1' = [with a/a ∨ c modulation]
9. ((b ∧ c) ∨ ((a ∨ c) ∧ (a ∨ b))) ∧ 1'
We know that:
0' ≤ x ≤ 1', 0 ≤ y ≤ 1, 0 ≤ z ≤ 1'.
0' < x
Namely:
(a ∧ x) = (a ∧ 1')
If x = 0', then (a ∧ x) = (a ∧ 0').
Hence (a ∧ 0') = (a ∧ 1').
But (a ∧ 0') < (a ∧ 1').
Hence x ≠ 0.
Since 0' ≤ x, 0' < x.
0' < y
Namely:
x ∨ y = 1'.
If y = 0', then x ∨ y = x ∨ 0', hence x ∨ 0' = 1, hence x = 1'.
Since x ∧ z = 0', then 1' ∧ z = 0', hence z = 0'.
But then y ∨ z = 0' ∨ 0' = 0'. But y ∨ z = 1' and 0' < 1'.
Hence y ≠ 0'.
Since 0' ≤ y, 0' < y.
x < 1'
Namely:
x ∧ y = 0'
If x = 1', then, x ∧ y = 1' ∧ y, hence 1' ∧ y = 0', hence y = 0'.
But 0' < y. Hence x ≠ 1.
Since x ≤ 1', x < 1'.
Similarly, y < 1', z < 1'.
¬(x ≤ y)
Namely:
x ∧ y = 0'.
If x ≤ y, then x ∧ y = x, hence x = 0. But 0 < x, hence ¬(x ≤ y).
What we have shown now is that {0',x,y,z,1'} ⊆ A is closed under join and meet. Hence
<{0',x,y,z,1'},≤⌠{0',x,y,z,1'}> is a sublattice of <A,≤>. But, of course, this sublattice of
<A,≤> is isomorphic to the diamond, hence the diamond can be embedded in <A,≤>. ◄
CORROLLARY 7: A lattice is distributive iff the pentagon and the diamond cannot
be embedded in it.
THE STORY IN PICTURES
The partial order below represents the obvious information you can extract from this:
a∨b∨c
a∨c
a∨b b∨c
(a ∨ b) ∧ (a ∨ c) ∧ (b ∨ c) = 1'
b c
a
a ∧ 1'= a ∧ (b ∨ c)
(a ∧ b) ∨ (a ∧ c) ∨ (b ∧ c) = 0'
a ∧ 0' = (a ∧ b) ∨ (a ∧ c) c ∧ 0'
b ∧ 0'
a∧b b∧c
a∧c
a∧b∧c
First we add the join of a ∧ (b ∨ c) and 0', which is x, and the join of x and a, which is a ∨
0'.
a∨b∨c
1'
a ∨ 0'
b c
a x
a ∧ 1'
0'
a ∧ 0' c ∧ 0'
b ∧ 0'
a∧b∧c
The idea, now, about modularity, is that similar joins and meets relative to b,
(b ∨ 0') and (b ∧ 1'), and relative to c, (c ∨ 0') and (c ∧ 1') are added in exactly the same
way.
1'
c ∨ 0'
a ∨ 0'
b c
a x z
c ∧ 1'
a ∧ 1'
0'
a ∧ 0' c ∧ 0'
b ∧ 0'
a∧b∧c
1' b ∨ 0'
c ∨ 0'
a ∨ 0'
y b c
a x z
c ∧ 1'
a ∧ 1'
b ∧ 1'
0'
a ∧ 0' c ∧ 0'
b ∧ 0'
a∧b∧c
The structure we have derived, we call AF. AF is a modular lattice. As before, with the
pentagon, we need to check now, which lines in the diagram here represent 'smaller than'
and which represent 'smaller or equal than'. This is given in the following picture, which
is a picture of modular sublattice of A [{a,b,c}].:
a∨b∨c
1'
y b c
a z
0'
a∧b∧c
Again, thick lines or double lines cannot contract under homorphism, but thin lines can.
So we can contract a to a ∨ 0', or to a ∧ 1', or to x, and similarly for b and for c. This
means that the picture really stands for 64 structures, the maximal one of which is AF,
and the minimal one of which, in which a =x and b = y and c = z, is the diamond. As can
clearly be seen in the picture, the lines of the diamond in the middle cannot contract.
Hence each of these 64 structures has the diamond as a substructure. Thus sublattice
[{a,b,c}] of A has the diamond as a substructure, hence A has the diamond as a
substructure.
The free modular lattice with three generators.
a∨b∨c
1'
y b c
a z
0'
a∧b∧c
a∨b∨c
a u b c
'
a∧b∧c
In this picture, the former diamond has contracted into point u. Obviously, the free
distributive lattice is not complemented: in fact, only 0 and 1 have a complement.
Now we are interested in turning this, minimally, into a Boolean lattice with generators a,
b, c.
This means that we're only interested in contractions that contract a,b,c into independent
elements. It is simple to see that there are exactly two ways of doing that:
a = a ∨ u, b = b ∨ u, c = c ∨ u, u = 0
a = a ∧ u, b = b ∧ u, c = c ∧ u, u = 1
a∨b∨c a∨b∨c
b
a c
a∧b∧c=u
a u b c
'
a∧b∧c
The result is, of course, the free Boolean lattice with three generators (i.e. with three
atoms).