Boolean Algebras and Stone Duality
Clopen Sets and the Duality Dictionary
Working with the duality in practice: how to translate a specific problem into its dual form, and the properties that correspond on each side.
Learning objectives
- Apply the dictionary to translate concrete statements
- Identify which side a given problem is easier on
- Prepare the topological setting for Boolean products
Worked translations
Example 1 — Atomlessness
Algebraic statement. B is atomless: every non-zero element strictly dominates a non-zero element.
Dual statement. B* has no isolated points: every non-empty clopen set properly contains a non-empty clopen set.
Consequence. A countable atomless Boolean algebra has Stone space a compact metrisable space with no isolated points and a basis of clopen sets — which characterises the Cantor set. So the countable atomless algebra is unique, recovering the earlier result topologically.
Example 2 — Finiteness
Algebraic statement. B is finite.
Dual statement. B* is finite and discrete.
Consequence. A finite Boolean space is a finite discrete space, whose clopen algebra is the full power set. This recovers the classification of finite Boolean algebras.
Example 3 — Quotients
Algebraic statement. B/F for a filter F.
Dual statement. The closed subspace of B* consisting of ultrafilters containing F.
Consequence. The lattice of filters corresponds to the lattice of closed subsets, reversed. Maximal filters correspond to single points, which is why ultrafilter quotients are 2.
Choosing a side
| Problem type | Easier side | Reason |
|---|---|---|
| Existence of homomorphisms | Topological | Continuous maps are often easier to construct |
| Cardinality questions | Algebraic | Counting elements is direct |
| Compactness or covering arguments | Topological | Compactness is the defining tool |
| Identity verification | Algebraic | Reduces to truth tables in 2 |
| Limits and colimits | Topological | Inverse limits of finite spaces are transparent |
| Congruence structure | Either | Filters and closed sets are equally tractable |
Every Boolean space is an inverse limit of finite discrete spaces, dually every Boolean algebra is a direct limit of finite Boolean algebras. This profinite description is frequently the most useful form for constructions, and it is visible only from the topological side.
Preparing for Boolean products
The Boolean product construction of Chapter IV §8 represents an algebra as a subalgebra of a product of algebras indexed by a Boolean space, with continuity-like conditions replacing the arbitrary choice permitted in a subdirect product.
Without a topology on the index set there is no notion of two elements agreeing on an open set, and no gluing condition can be stated. Stone duality supplies exactly the topology needed, which is why Chapter IV develops the duality before the products.
Frequently asked questions
Is there a mechanical procedure for translating statements?
For statements in the first-order language of Boolean algebras, largely yes — elements become clopen sets and quantifiers over elements become quantifiers over clopen sets. Statements involving infinite joins do not translate mechanically, since arbitrary unions of clopen sets need not be clopen.
What corresponds to a complete Boolean algebra?
An extremally disconnected space — one in which the closure of every open set is open. Completeness is exactly what makes arbitrary unions of clopen sets have clopen closures.
Source. S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, The Millennium Edition — a corrected re-typesetting of Springer-Verlag Graduate Texts in Mathematics 78 (1981). Section IV.4, book pages 155-158.
This page is an original exposition prepared for the KEVOS® knowledge library. It restates and reorganises mathematical results; it is not a reproduction of the source text.