Section 19.2 Boolean Algebras
Theorem 19.15.
A lattice
for all
Proof.
Let us assume that
The converse follows directly from the Duality Principle.
Theorem 19.16.
A set
and for and for and forThere exist elements
and such that and for allFor every
there exists an such that and
Proof.
Let
Observe that
Consequently, the first of the two absorption laws holds, since
The other idempotent and absorption laws are proven similarly. Since
For
or
Conversely, suppose that
Theorem 19.17.
Let
and for allIf
and for thenIf
and then for all and and (De Morgan's Laws).
Proof.
We will prove only (2). The rest of the identities are left as exercises. For
Subsection Finite Boolean Algebras
A Boolean algebra is a finite Boolean algebra if it contains a finite number of elements as a set. Finite Boolean algebras are particularly nice since we can classify them up to isomorphism. LetLemma 19.18.
Let
Proof.
If
Since
Lemma 19.19.
Let
Proof.
Since
Lemma 19.20.
Let
Proof.
(1)
(2)
(3)
Thus,
Lemma 19.21.
Let
Proof.
By Lemma 19.20,
Lemma 19.22.
Let
Proof.
Let
Now suppose that
But each term is
Theorem 19.23.
Let
Proof.
We will show that
Clearly,
Now let
The join of
Similarly,
Corollary 19.24.
The order of any finite Boolean algebra must be