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 Ultrafilter Lemma and BPI are not theorems of ZF
Statement
Assuming , neither the set Ultrafilter Lemma nor the Boolean Prime Ideal Theorem is provable in ZF.
Facts & Assumptions
Given: for the fixed formalization.
Relative consistency of no free ultrafilter on omega over ZF proves the consistency of
BPI and the set ultrafilter lemma are equivalent proves in ZF that BPI is equivalent to the set Ultrafilter Lemma (UFL).
Proof
Proof technique: contradiction by adjoining a hypothetical ZF proof to the consistent countertheory.
By F1, is consistent. Suppose for contradiction that . Because every axiom of ZF is an axiom of , the same finite derivation is a -derivation of BPI. But is an axiom of , so would be inconsistent, contradicting F1. Thus .
Suppose instead that . The UFL-to-BPI implication in F2 is itself a ZF theorem, so concatenating the two finite proofs would give , contradicting step 1.1. Hence .
Both nonprovability conclusions use the stated consistency hypothesis. They are syntactic consequences of a consistent countertheory; no completeness theorem, countable transitive model, or assertion of absolute truth is used.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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
- Solomon Feferman, Some applications of the notions of forcing and generic sets, Theorem 4.12, printed pp. 343–344 (standard reference, not scraped)