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 clopen representation under BPI

Statement

Assume BPI over ZF. For every Boolean algebra B, the space Ult(B) is compact Hausdorff, and b[b] is a Boolean isomorphism BClop(Ult(B)).

Facts & Assumptions

[F1]

Stone ultrafilter space and its clopen basis gives the basic clopens, their Boolean identities, and the compactness and Hausdorff conventions.

[F2]

BPI is equivalent to extending proper Boolean filters extends any proper Boolean filter to an ultrafilter under BPI.

Proof

Given: BPI and a Boolean algebra B; write X=Ult(B).

1.1

If b≰c, the element d=b¬c is nonzero, and {a:da} is a proper filter. F2 extends it to U with bU and cU, since otherwise dc=0 would belong to U. Thus [b]⊈[c]. Together with the Boolean identities in F1, this shows that b[b] is an injective Boolean homomorphism, reflecting order.

F1F2algebra
1.2

If U,V are distinct ultrafilters, some b belongs to exactly one; the other contains ¬b. The disjoint open sets [b] and [¬b] separate them, so X is Hausdorff.

F1algebra
1.3

Consider a cover {[b]:bH} with no finite subcover. No finite join from H is 1, since F1 would make those finitely many clopens cover X. Hence every finite meet from {¬b:bH} is nonzero, including the empty meet (otherwise B is trivial and the empty subcover suffices). Their upward closure is a proper filter: concatenation of finite lists gives meet closure, and no witness meet is zero. F2 extends it to an ultrafilter U. For every bH, ¬bU forces U[b], contradicting the cover. Thus every basic cover has a finite subcover.

F1F2algebra
2.1

Given an arbitrary open cover O, let H consist of all b such that [b]O for some OO. The basis property in F1 makes these sets a cover; step 1.3 gives finitely many covering basic sets. For each of this finite list take one containing member of O. These form a finite subcover, proving compactness with only finite choice.

F1step 1.3algebra
3.1

For a clopen KX, all basic clopens contained in K, together with the open set XK, cover X. Step 2.1 supplies a finite subcover; intersecting its union with K gives K=[b1][bn]=[b1bn]. If the finite list is empty, K==[0]. Hence the embedding in step 1.1 is onto all clopens. If B is trivial, X= and both algebras have one element; the same identities and compactness conclusion hold. QED.

F1step 1.1step 2.1algebra

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