Math 2.0

Order, lattices, ordered algebraic structures Boolean algebras Theorem

Stone duality

Builds on Boolean algebraStone spaceUltrafilter on a Boolean algebraClopen setEquivalence of categoriesStone's representation theorem for Boolean algebras

Statement

Let 𝐁𝐨𝐨π₯\mathbf{Bool} be the category of Boolean algebras with Boolean algebra homomorphisms. Let π’π­π¨π§πž\mathbf{Stone} be the category of Stone spaces with continuous maps. Then 𝐁𝐨𝐨π₯\mathbf{Bool} is equivalent to the opposite category of π’π­π¨π§πž\mathbf{Stone}, by the following functors.

  1. A Boolean algebra BB goes to its space S(B)S(B) of ultrafilters, with basic open sets {U:a∈U}\set{U : a \in U} for a∈Ba \in B. A homomorphism h ⁣:Aβ†’Bh \colon A \to B goes to the continuous map S(B)β†’S(A)S(B) \to S(A), U↦hβˆ’1(U)U \mapsto h^{-1}(U).
  2. A Stone space XX goes to the Boolean algebra Clop⁑(X)\operatorname{Clop}(X) of its clopen subsets; a continuous map f ⁣:Xβ†’Yf \colon X \to Y goes to the homomorphism Clop⁑(Y)β†’Clop⁑(X)\operatorname{Clop}(Y) \to \operatorname{Clop}(X), C↦fβˆ’1(C)C \mapsto f^{-1}(C).
  3. The maps Bβ†’Clop⁑(S(B))B \to \operatorname{Clop}(S(B)), a↦{U:a∈U}a \mapsto \set{U : a \in U}, and Xβ†’S(Clop⁑(X))X \to S(\operatorname{Clop}(X)), x↦{C:x∈C}x \mapsto \set{C : x \in C}, are natural isomorphisms.

Remarks

The first isomorphism in clause 3 is Stone's representation theorem. The second one holds for this reason. In a compact Hausdorff space with a basis of clopen sets, the members of an ultrafilter of clopen sets have exactly one common point. Under the duality, injective homomorphisms correspond to surjective continuous maps, and quotients of BB correspond to closed subspaces of S(B)S(B). For example, the free Boolean algebra on a set II corresponds to the product space {0,1}I\set{0, 1}^I, and the finite Boolean algebras correspond to the finite discrete spaces.

Going deeper

For a student

Stone duality lets one prove facts about Boolean algebras by topology and facts about Stone spaces by algebra. For instance, a Boolean algebra is complete exactly when its Stone space is extremally disconnected, and an atom of the algebra corresponds to an isolated point of the space. It is the model for many later dualities: Priestley duality for distributive lattices, Esakia duality for Heyting algebras, and the duality between spatial frames and sober spaces.

Reading path

To understand this page from the ground up, read these 8 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Algebra of sets concept
  2. Boolean algebra concept
  3. Clopen set concept
  4. Equivalence of categories concept
  5. Stone space concept
  6. Ultrafilter on a Boolean algebra concept
  7. Stone's representation theorem for Boolean algebras statement
  8. Stone duality statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Stone_duality
About this page
TagB9T33D5MJK
URIm2://B9T33D5MJK
Kindstatement, theorem
WritingW0 stub
MSC06E15, 18F70
StatusThis copy of the site has no build data. Run m2 status B9T33D5MJK.
AboutBoolean algebra, Stone space
UsesBoolean algebra, Stone space, Ultrafilter on a Boolean algebra, Clopen set, Equivalence of categories, Stone's representation theorem for Boolean algebras
Changed2 November 2026

Markdown Β· JSON Β· Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.