Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 and its natural maps

Statement

Under BPI over ZF, Boolean algebras with bound-preserving homomorphisms and Stone spaces with continuous maps are contravariantly equivalent. On maps the assignments are h:BCh:Vh1[V] and f:XYf:Df1[D]. Their composites are naturally isomorphic to the identity by ϵB(b)=[b] and ηX(x)={D:xD}.

Facts & Assumptions

[F1]

Stone clopen representation under BPI gives the isomorphisms ϵB and Stone ultrafilter spaces under BPI.

[F2]

A Stone space is recovered from its clopens gives the homeomorphisms ηX.

[F3]

Boolean homomorphisms and quotient relation requires homomorphisms to preserve both bounds and every Boolean operation.

Proof

Given: BPI, a Boolean homomorphism h:BC and a continuous map f:XY of Stone spaces.

1.1

If V is an ultrafilter of C, its inverse image under h contains 1, excludes 0, and is upward and meet closed by F3. It decides complements because h(¬b)=¬h(b) and V decides complements. Such a proper filter is maximal: adjoining a missing b includes both it and its complement. Thus h(V) is an ultrafilter. For each b, (h)1([b])=[h(b)], since bh1[V] exactly when h(b)V. Hence h is continuous. Equivalently its character is χVh, with this order of composition.

F1F3algebra
1.2

The inverse image of a clopen DY is open by continuity of f and closed because its complement is the inverse image of the open complement of D. Preimages preserve intersections, unions, complements and the empty and whole sets. Thus f is a Boolean homomorphism.

F3givenalgebra
2.1

For composable maps h:BC and k:CD, (kh)1[V]=h1[k1[V]], so (kh)=hk. The identical preimage computation proves the composition law for continuous maps, and the identity map has identity preimage on every subset. Thus both assignments are contravariant functors on the stated objects.

F1F2step 1.1step 1.2algebra
3.1

For bB, the identity of step 1.1 says (h)(ϵB(b))=[h(b)]=ϵC(h(b)). For xX and a clopen DY, membership of D in (f)(ηX(x)) means xf1[D], equivalently f(x)D; hence (f)ηX=ηYf. These are the two naturality equations, and F1 and F2 make their components isomorphisms. The formulas also apply to empty Stone spaces and trivial algebras whenever the indicated maps exist, since bound preservation is required throughout. QED.

F1F2step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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