Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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 BA be the category of Boolean algebras (Boolean algebra and Boolean ultrafilter) with Boolean homomorphisms, and let Stone be the category of Stone spaces (Stone space and clopen algebra) with continuous maps. Then

BUlt(B),XClop(X),

together with ff, f(C):=f1(C), on continuous maps and φφ, φ(U):=φ1(U), on Boolean homomorphisms, define a contravariant equivalence of categories: the evaluation maps

ηB:BClop(Ult(B)),ηB(b)=[b],εX:XUlt(Clop(X)),εX(x)={C:xC}

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 BA and Stone as described, and the assignments above.

[L1]

For every Boolean algebra B the map ηB:b[b] is an isomorphism of Boolean algebras onto Clop(Ult(B)), and Ult(B) is a Stone space (Stone representation for Boolean algebras, The Axiom of Choice).

[L2]

For a Stone space X, Clop(X) is a Boolean algebra and Ult(Clop(X)) is the ultrafilter space of clopens with basic opens [C]={U:CU} (Stone space and clopen algebra).

[L3]

The preimage of an ultrafilter under a Boolean homomorphism is an ultrafilter: if U is an ultrafilter in B and φ:AB is a Boolean homomorphism, then φ1(U) contains 1A, omits 0A, is closed under and upward closed (all by the homomorphism identities), and decides every element because φ(a)U or ¬φ(a)=φ(¬a)U. [algebra]

[L4]

A continuous map f:XY between Stone spaces has f1(C) clopen for every clopen C, 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

technique · direct
1.1

A Boolean homomorphism φ:AB induces φ:Ult(B)Ult(A), φ(U):=φ1(U), which is well defined by [L3] and continuous because (φ)1([a])=[φ(a)] for aA; moreover (idA)=id and (ψφ)=φψ for composable homomorphisms φ:AB, ψ:BC.

L3algebra
1.2

A continuous map f:XY between Stone spaces induces f:Clop(Y)Clop(X), f(C):=f1(C), which is a Boolean homomorphism by [L4]; identity and composition are preserved in the reversed order, since (gf)1=f1g1.

L4algebra
1.3

For a Stone space X the map εX:XUlt(Clop(X)) is a bijection: εX(x) is a proper filter of clopens (it contains X, omits , is closed under intersections and upward closed) which decides every clopen C because exactly one of xC, xXC 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 U of clopens the family U has the finite intersection property, so CUC by compactness, and if xy both lie in the intersection then a clopen C containing exactly one of them belongs to U by the dichotomy and excludes the other, a contradiction, so the intersection is a single point x and then CU for every clopen C containing x (because {CC:CU} has finite subfamily with empty intersection, giving CC for some CU).

L2L4algebra
2.1

For every Stone space X the map εX is continuous, since εX1([C])=C is open, and it is a homeomorphism because it is a continuous bijection from the compact space X to the Hausdorff space Ult(Clop(X)).

step 1.3L1L2
2.2

Naturality: for a Boolean homomorphism φ:AB and aA one has ηB(φ(a))=[φ(a)]=(φ)1([a])=φ(ηA(a)), that is, ηBφ=φηA; for a continuous f:XY and xX one has εY(f(x))={C:f(x)C}={C:xf1(C)}=f(εX(x)), that is, εYf=fεX.

step 1.1step 1.2step 1.3algebra
3.1

The two functors are mutually inverse on hom-sets: given φ:AB the naturality of [step 2.2] and invertibility of ηA,ηB (from [L1]) give φ=ηB1φηA, 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.

step 1.1step 1.2step 2.1step 2.2L1
4.1

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].

step 2.1step 2.2step 3.1L1

Remarks

  • Both directions of the arrow correspondence are used. Surjectivity of εX 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