LLMpediaThe first transparent, open encyclopedia generated by LLMs

Stone representation theorem

Generated by GPT-5-mini
Note: This article was automatically generated by a large language model (LLM) from purely parametric knowledge (no retrieval). It may contain inaccuracies or hallucinations. This encyclopedia is part of a research project currently under review.
Article Genealogy
Parent: Tarski Hop 5
Expansion Funnel Raw 51 → Dedup 0 → NER 0 → Enqueued 0
1. Extracted51
2. After dedup0 (None)
3. After NER0 ()
4. Enqueued0 ()
Stone representation theorem
NameStone representation theorem
FieldMathematics
SubfieldLogic; Topology; Algebra
Proved byMarshall H. Stone
Year1936
Also known asStone duality for Boolean algebras

Stone representation theorem

The Stone representation theorem is a foundational result connecting Boolean algebra and topology: every Boolean algebra is isomorphic to an algebra of clopen subsets of a compact totally disconnected Hausdorff space (a Stone space). It establishes a duality between the category of Boolean algebras and the category of Stone spaces, linking work of Marshall H. Stone with developments in lattice theory, set theory, and mathematical logic. The theorem underpins applications in measure theory, computer science, and model theory.

Introduction

Stone's theorem ties algebraic structure to topological structure by realizing an abstract Boolean algebra as fields of sets arising from ultrafilters. It interfaces with earlier developments by George Boole and later formal frameworks such as Alfred North Whitehead's algebraic logic and Bertrand Russell's work in Principia Mathematica. The construction exploits ultrafilter topology akin to constructions used in Tychonoff theorem proofs and employs methods related to Zorn's lemma and the axiom of choice.

Statement of the theorem

For any Boolean algebra B there exists a compact Hausdorff totally disconnected topological space X (called the Stone space of B) and a Boolean algebra isomorphism between B and the algebra of clopen subsets of X. Conversely, for any Stone space X the Boolean algebra of clopen subsets of X recovers X up to homeomorphism. This yields a categorical duality between the category of Boolean algebras and the opposite of the category of Stone spaces, echoing dualities like those of Pontryagin duality and Gelfand–Naimark theorem in their respective contexts.

Proof outline and constructions

The usual proof assigns to B the set X of ultrafilters on B and equips X with the topology generated by sets U_a = {p in X : a in p} for a in B. Each U_a is clopen; the map a ↦ U_a is a Boolean algebra homomorphism. Surjectivity and injectivity follow from the properties of ultrafilters and separation axioms derived from the topology, with compactness obtained via an argument invoking Alexander subbasis theorem or directly using the finite intersection property paired with Zorn's lemma. Key tools parallel arguments in work on Stone–Čech compactification and are related to constructions used by John von Neumann and Andrey Kolmogorov in measure and topology.

Variants and generalizations

Stone duality extends in multiple directions. Stone's representation for distributive lattices leads to Priestley duality for bounded distributive lattices, connected to Hilary Priestley. Boolean algebra duality generalizes to Boolean rings through an equivalence with zero-dimensional compact spaces, paralleling the algebra–geometry correspondences exemplified by Alexander Grothendieck's schemes and the Gelfand representation for commutative C*-algebras established by Israel Gelfand and Mark Naimark. Extensions include spectral spaces in Hochster's work linking to commutative algebra and the Zariski topology used by Oscar Zariski; and categorical formulations by Saunders Mac Lane and Samuel Eilenberg in the context of topos theory and Stone-type dualities for Heyting algebras connected to Luitzen Egbertus Jan Brouwer and Arend Heyting.

Examples and applications

Concrete examples include the Stone space of the Boolean algebra of finite/cofinite subsets of a countable set, producing the Cantor set as Stone space for the free Boolean algebra on countably many generators, linking to Cantor set studies by Georg Cantor. Applications appear in algebraic topology via profinite completions used by Emil Artin and John Tate; in model theory and ultraproduct constructions related to work by Jerzy Łoś; in computer science through Boolean satisfiability and semantics influenced by Alonzo Church and Alan Turing; and in measure theory where Stone spaces inform representation theorems related to Carathéodory and Henri Lebesgue-type constructions. The duality informs categorical semantics in Lambda calculus investigations and in domain theory influenced by Dana Scott.

Historical context and attribution

Marshall H. Stone published the theorem in 1936 while working on connections between algebra and topology; his work built on classical algebraic logic by George Boole and on topological methods refined by Felix Hausdorff and Maurice Fréchet. The recognition of a duality framework inspired parallel results by contemporaries and successors such as Henri Cartan in sheaf theory contexts and later categorical treatments by Samuel Eilenberg and Saunders Mac Lane. Stone's theorem became a pillar in 20th-century mathematics, influencing developments in functional analysis, algebraic geometry, and theoretical computer science.

Category:Boolean algebra Category:Topology Category:Mathematical theorems