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 representation for Boolean algebras

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let B be a Boolean algebra (Boolean algebra and Boolean ultrafilter) and let Ult(B) be its ultrafilter space with the topology generated by the sets [b]={U:bU} (Stone space and clopen algebra). Then:

  1. the map b[b] is an isomorphism of Boolean algebras from B onto Clop(Ult(B)), the algebra of clopen subsets of the ultrafilter space;
  2. Ult(B) is a Stone space: compact, Hausdorff, with a basis of clopen sets.

For the trivial Boolean algebra, Ult(B)= and the clopen algebra is the one-element algebra {}, isomorphic to B. The proof of compactness is a direct filter argument and does not use Tychonoff's theorem for products.

Facts & Assumptions

Given: AC, a Boolean algebra B (possibly trivial), and X=Ult(B).

[F1]

A proper Boolean filter contains 1, omits 0, is meet-closed and upward closed; an ultrafilter is maximal among proper filters. Boolean operations satisfy the distributive, complement and absorption laws. The topology on X is generated by [b]={U:bU}; clopen subsets have the set-theoretic Boolean operations. (Boolean algebra and Boolean ultrafilter, Stone space and clopen algebra).

[F2]

Under AC every proper Boolean filter extends to an ultrafilter, and distinct Boolean elements are separated by an ultrafilter containing exactly one of them. (Boolean ultrafilter extension, The Axiom of Choice).

Proof

technique · direct
1.1

Derive the dichotomy. Let U be an ultrafilter and aU. If ua0 for every uU, then V={b:(ua)b for some uU} is a proper filter containing U and a. It contains 1 and is upward closed; if two witnesses are u,v, their meet has witness uvU. It omits 0 by the assumed nonzero meets. Thus it strictly extends U, contradicting maximality. Hence some uU satisfies ua=0. Distributivity gives u=u(a¬a)=(ua)(u¬a)=u¬a, so u¬a and ¬aU. Both a and ¬a cannot belong to a proper filter, since their meet is 0. This proves exactly one belongs, without attributing the claim to the extension interface.

F1algebra
1.2

Injectivity. If ab, [F2] supplies an ultrafilter in exactly one of [a],[b], so these subsets differ. Thus b[b] is injective.

F2algebra
2.1

Boolean operations and basis. Meet closure and upward closure give [ab]=[a][b]. If abU but neither summand belongs to U, step 1.1 puts both complements in U; their meet has zero meet with ab by distributivity, contradicting properness. Conversely either summand in U puts their join in U. Thus [ab]=[a][b]. Also [¬a]=X[a], [0]= and [1]=X. Hence the map preserves all Boolean operations and every [a] is clopen. The generating family contains X and is closed under finite intersections, so it is a basis for the generated topology.

F1step 1.1algebra
3.1

Hausdorff separation. Distinct ultrafilters cannot be properly included in each other, by their maximality among proper filters. Thus for UV some bUV exists. Step 1.1 gives ¬bV, so the disjoint open sets [b] and [¬b] separate them.

F1step 1.1step 2.1algebra
3.2

Compactness for basic covers. Suppose {[bi]:iI} covers X but has no finite subcover. For every finite JI there exists an ultrafilter outside its union, so cJ=iJ¬bi lies in a proper filter and is nonzero, using step 1.1; for J= this uses cJ=1 and the fact that failure of the empty subcover implies X. The family F={b:cJb for some finite JI} is a proper filter: it contains 1, is upward closed, is meet-closed using JJ, and omits 0 because every cJ0. By [F2] extend it to an ultrafilter U. It contains every ¬bi, hence no bi, contradicting the cover. No simultaneous choice of witnessing ultrafilters for the finite J is made.

F1F2step 1.1step 2.1algebra
4.1

General covers and clopens. Any open cover has the refinement of all basic sets contained in one of its members. This covers by step 2.1, so step 3.2 yields finitely many basic sets. For these finitely many sets choose containing original members, yielding a finite original subcover (finite choice, available under AC). Thus X is compact. If CX is clopen, [F3] makes C compact. The basic sets contained in C cover it, so finitely many suffice and C=[b1][br]=[b1br] by step 2.1. When C= take the empty finite join, namely 0. Thus the Boolean homomorphism is onto all clopens.

F2F3step 2.1step 3.2algebra
5.1

Conclusion and trivial case. By steps 1.2, 2.1 and 4.1 the map is a bijective Boolean homomorphism; its inverse preserves the operations by applying injectivity to each homomorphism identity. By steps 2.1, 3.1 and 4.1 the space is compact Hausdorff with a clopen basis. If 0=1 no proper filter can both contain 1 and omit 0, so X= and its only clopen is ; the asserted isomorphism is the unique map between one-element Boolean algebras. Every cover of the empty space has the empty finite subcover. The extension supplier uses AC/Zorn, and this proof uses no product-Tychonoff argument.

F1F2step 1.2step 2.1step 3.1step 4.1algebra

Depends on

Used by

Dependency tree · two levels

13 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