Knowra Stone's representation theorem for Boolean algebras Stone's representation theorem for Boolean algebras Stone's representation theorem states that every Boolean algebra is isomorphic to the algebra of clopen subsets of a compact, Hausdorff, totally disconnected space, called its Stone space.
Stone space : The compact, Hausdorff, totally disconnected space whose clopen-set algebra represents a Boolean algebra. It is the topological space built from the algebra in the representation theorem.
Boolean algebra homomorphism : A map between Boolean algebras preserving zero, one, meet, join, and complement. The representation identifies algebraic structure through maps that preserve these operations.
Marshall Harvey Stone : An American mathematician whose work established major connections between algebra, analysis, and topology. Stone proved the representation theorem and developed its topological viewpoint.
Propositional logic : A formal system built from propositions combined by connectives such as and, or, and not. Equivalence classes of propositions form Boolean algebras with Stone spaces of maximal consistent theories.
Birkhoff representation theorem : A theorem representing finite distributive lattices as lattices of downsets of partially ordered sets. It represents finite distributive lattices using orders rather than Stone spaces.
Ultrafilter : A maximal proper filter in a Boolean algebra or a maximal family of compatible sets. Points of the Stone space are the Boolean algebra's ultrafilters.
Boolean algebra isomorphism : A bijective Boolean homomorphism whose inverse is also a Boolean homomorphism. The theorem asserts structural equivalence, not merely a correspondence between elements.
Stone's representation theorem for lattices : A representation theorem connecting distributive lattices with spaces of prime ideals or filters. Stone extended the Boolean-algebra correspondence to broader lattice structures.
Lindenbaum–Tarski algebra : The Boolean algebra of formulas modulo logical equivalence in a propositional theory. Its ultrafilters represent complete, consistent assignments of truth values.
Priestley duality : A duality between bounded distributive lattices and compact ordered spaces satisfying a separation condition. It generalizes Stone-style representation while retaining order information.
Show all 25