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.
The tail-flip symmetric model refutes BPI
Statement
The Boolean Prime Ideal Theorem and the equivalent set Ultrafilter Lemma fail in .
Facts & Assumptions
Given: The transitive ZF model .
The tail-flip symmetric model has no free ultrafilter on omega proves that every ultrafilter on in the model is principal.
The Boolean prime ideal principle states BPI and the set Ultrafilter Lemma as principles over ZF.
BPI and the set ultrafilter lemma are equivalent proves in ZF that BPI is equivalent to extension of every proper set filter to an ultrafilter.
Ultrafilter fixes the principal/free distinction.
Proof
Let . It contains , excludes because is infinite, is upward closed, and is closed under finite intersections because the complement of an intersection is the finite union of the complements. Hence is a proper set filter in the model.
Suppose BPI holds. By F3, the set Ultrafilter Lemma extends to an ultrafilter on . For every , the cofinite set belongs to . But the principal ultrafilter at omits that set, so is not principal at any point and is free by F4. This contradicts F1.
Therefore BPI fails. Since F3 proves both directions of the equivalence, the set Ultrafilter Lemma fails as well. The empty-set UFL instance is vacuous, while the explicit nonempty witness is the cofinite filter on from step 1.1.
Depends on
Used by
Dependency tree · two levels
12 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.