How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Stone duality
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be the category of Boolean algebras (Boolean algebra and Boolean ultrafilter) with Boolean homomorphisms, and let be the category of Stone spaces (Stone space and clopen algebra) with continuous maps. Then
together with , , on continuous maps and , , on Boolean homomorphisms, define a contravariant equivalence of categories: the evaluation maps
are natural isomorphisms, and the two arrow assignments are mutually inverse under them. No prime-spectrum machinery is used.
Facts & Assumptions
Given: The Axiom of Choice, the categories and as described, and the assignments above.
For every Boolean algebra the map is an isomorphism of Boolean algebras onto , and is a Stone space (Stone representation for Boolean algebras, The Axiom of Choice).
For a Stone space , is a Boolean algebra and is the ultrafilter space of clopens with basic opens (Stone space and clopen algebra).
The preimage of an ultrafilter under a Boolean homomorphism is an ultrafilter: if is an ultrafilter in and is a Boolean homomorphism, then contains , omits , is closed under and upward closed (all by the homomorphism identities), and decides every element because or . [algebra]
A continuous map between Stone spaces has clopen for every clopen , and preimages preserve the Boolean operations; distinct points of a Stone space are separated by a clopen set, since the space is Hausdorff and has a clopen basis. [algebra]
Proof
A Boolean homomorphism induces , , which is well defined by [L3] and continuous because for ; moreover and for composable homomorphisms , .
A continuous map between Stone spaces induces , , which is a Boolean homomorphism by [L4]; identity and composition are preserved in the reversed order, since .
For a Stone space the map is a bijection: is a proper filter of clopens (it contains , omits , is closed under intersections and upward closed) which decides every clopen because exactly one of , holds, so it is an ultrafilter by the dichotomy; it is injective because distinct points are separated by a clopen set by [L4]; and it is surjective, since for an ultrafilter of clopens the family has the finite intersection property, so by compactness, and if both lie in the intersection then a clopen containing exactly one of them belongs to by the dichotomy and excludes the other, a contradiction, so the intersection is a single point and then for every clopen containing (because has finite subfamily with empty intersection, giving for some ).
For every Stone space the map is continuous, since is open, and it is a homeomorphism because it is a continuous bijection from the compact space to the Hausdorff space .
Naturality: for a Boolean homomorphism and one has , that is, ; for a continuous and one has , that is, .
The two functors are mutually inverse on hom-sets: given the naturality of [step 2.2] and invertibility of (from [L1]) give , so is determined by , and symmetrically for continuous maps using [step 2.1]; since [step 1.1] and [step 1.2] show that the assignments preserve identities and composition, they define a contravariant equivalence of categories.
The statement is proved: is a natural isomorphism by [L1] and [step 2.2], is a natural isomorphism by [step 2.1] and [step 2.2], and the arrow assignments are mutually inverse by [step 3.1].
Remarks
- Both directions of the arrow correspondence are used. Surjectivity of uses compactness; injectivity uses the clopen basis in the Hausdorff form; and naturality is a pure membership computation.
- No choice beyond AC appears. Ultrafilters are produced by the extension lemma only, which is the declared AC/Zorn implementation.
Depends on
Used by
Dependency tree · two levels
8 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Marcus Tressl, Stone Duality for Boolean Algebras — Theorem 3.1.6, p. 12; Lemma 4.1, Definitions 4.2–4.3, p. 16; Theorem 4.4, pp. 16–17 (standard reference, not scraped)