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.
BPI is equivalent to extending proper Boolean filters
Statement
Over ZF, BPI is equivalent to each of the following: every proper Boolean ideal is contained in a prime ideal; every proper Boolean filter is contained in an ultrafilter.
Facts & Assumptions
The Boolean prime ideal principle states BPI for nontrivial Boolean algebras.
Quotient operations are well defined gives the quotient homomorphism with kernel the specified ideal.
Generated filters and the complementary-pair tests gives the complement correspondence between prime ideals and ultrafilters, and the order-dual correspondence between proper ideals and proper filters.
Proof
Given: ZF, with BPI assumed only in the forward implications.
Let be a proper ideal of . By F2 its quotient map has kernel , so because . BPI therefore provides a prime ideal in . The inverse image contains , is downward and join closed by monotonicity and join preservation, contains and excludes . If is in it, then , so primality of gives or in the inverse image. This proves prime extension.
For a proper filter , let , a proper ideal by F3. Step 1.1 gives a prime ideal . The ultrafilter contains : for , precludes because is proper. Thus BPI also gives filter extension.
Conversely, if prime extension holds, apply it to the proper ideal of any nontrivial to get BPI. If filter extension holds instead, apply it to the proper filter and use F3 to take the complement of the resulting ultrafilter. Trivial algebras have neither proper ideals nor proper filters and are excluded by F1. No infinite family of choices is made in any implication. QED.
Depends on
Used by
Dependency tree · two levels
5 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, 2.3.3 (prime-filter duality); local quotient proof of the ZF equivalence (standard reference, not scraped)