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.
Relative consistency of BPI without Choice over ZF
Statement
Writing consistency as the absence of a standard finite refutation in the coding of The standard certified provability predicate,
Consequently, conditional on the consistency of ZF, BPI does not imply AC over ZF. This is an external syntactic relative-consistency implication; it does not infer a transitive model from bare consistency, and it does not claim that PA proves the displayed implication.
Facts & Assumptions
Given: Assume and suppose, for contradiction, that the target theory has a coded finite refutation.
Formal consistency of ZFC plus GCH relative to ZF transfers the hypothesis to .
Fixed finite-fragment verification for the basic Cohen symmetric model says that, for every externally fixed finite fragment of , ZFC proves a set model of , using only a finite source fragment depending on . It explicitly makes no claim of a PA-verified uniform selector for these proofs.
Search-and-shift prime-ideal construction in the basic Cohen model is one fixed finite ZFC proof that the same symmetric construction satisfies BPI; its forcing recursion, finite Ramsey instances, Erdős--Rado instance, collapse comparison, and name recursion use only finitely many ZFC axioms and schema instances.
The basic Cohen model satisfies BPI and fails Choice identifies the resulting semantic target, while The standard certified provability predicate supplies primitive-recursive proof checking and the meaning of both consistency formulas.
Proof
A standard finite refutation of contains only finitely many ZF schema instances. Fix this particular , and let consist of those instances together with ; BPI is retained as its single displayed target sentence. This is an external extraction from one alleged finite proof, not a claimed uniform construction formalized in PA.
Since is now one externally fixed fragment, F2 gives one finite ZFC proof that the basic Cohen symmetric construction has a set interpretation satisfying . Append the fixed set-theoretic proof F3 to the same finite construction, enlarging the finite source fragment for the finitely many forcing, cardinal, name-rank, and symmetry instances occurring in F3. The result is a finite ZFC proof that this set interpretation also satisfies BPI, hence a finite ZFC proof of a model of . No effective dependence of this proof on arbitrary input codes is used.
Relativize every line of the fixed refutation to that set interpretation and append the ordinary finite satisfaction induction for the finitely many formulas occurring in . This gives a finite contradiction proof in ZFC. No countable-transitive-model inference is made.
F1 says the assumed consistency of ZF implies consistency of the ZFC+GCH source and therefore of ZFC, contradicting step 3.1. Hence no standard finite target refutation exists, which is exactly the displayed external relative-consistency implication. The resulting consistent extension contains BPI and , so, under the same antecedent, ZF+BPI cannot prove AC.
Depends on
Used by
- Relative consistency of BPI without Choice together with Halpern–Läuchli Corollary
- BPI is equivalent to the Axiom of Choice False statement
- BPI well-orders every set False statement
- Strict relative placement of BPI between ZF and Choice Theorem
Dependency tree · two levels
28 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
- J. D. Halpern and A. Lévy, The Boolean prime ideal theorem does not imply the axiom of choice, metamathematical construction, pp.83-134 (standard reference, not scraped)
- Brian Ransom, On BPI in Symmetric Extensions Part 1, Sections 3-5 (standard reference, not scraped)