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 , the space is compact Hausdorff, and is a Boolean isomorphism .
Facts & Assumptions
Stone ultrafilter space and its clopen basis gives the basic clopens, their Boolean identities, and the compactness and Hausdorff conventions.
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 ; write .
If , the element is nonzero, and is a proper filter. F2 extends it to with and , since otherwise would belong to . Thus . Together with the Boolean identities in F1, this shows that is an injective Boolean homomorphism, reflecting order.
If are distinct ultrafilters, some belongs to exactly one; the other contains . The disjoint open sets and separate them, so is Hausdorff.
Consider a cover with no finite subcover. No finite join from is , since F1 would make those finitely many clopens cover . Hence every finite meet from is nonzero, including the empty meet (otherwise 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 . For every , forces , contradicting the cover. Thus every basic cover has a finite subcover.
Given an arbitrary open cover , let consist of all such that for some . 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 . These form a finite subcover, proving compactness with only finite choice.
For a clopen , all basic clopens contained in , together with the open set , cover . Step 2.1 supplies a finite subcover; intersecting its union with gives . If the finite list is empty, . Hence the embedding in step 1.1 is onto all clopens. If is trivial, and both algebras have one element; the same identities and compactness conclusion hold. QED.
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
- Tressl, Stone Duality for Boolean Algebras, 3.1.4–3.1.5, pp. 10–11 (standard reference, not scraped)