Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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,

Con(ZF)Con(ZF+BPI+¬AC).

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 Con(ZF) and suppose, for contradiction, that the target theory has a coded finite refutation.

[F1]

Formal consistency of ZFC plus GCH relative to ZF transfers the hypothesis to Con(ZFC+GCH).

[F2]

Fixed finite-fragment verification for the basic Cohen symmetric model says that, for every externally fixed finite fragment Δ of ZF+¬AC, 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.

[F3]

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.

[F4]

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

technique · external finite-refutation reduction
1.1

A standard finite refutation R of ZF+BPI+¬AC contains only finitely many ZF schema instances. Fix this particular R, and let Δ consist of those instances together with ¬AC; 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.

F4givenassume-contra
2.1

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 Δ+BPI. No effective dependence of this proof on arbitrary input codes is used.

F2F3F4step 1.1
3.1

Relativize every line of the fixed refutation R to that set interpretation and append the ordinary finite satisfaction induction for the finitely many formulas occurring in R. This gives a finite contradiction proof in ZFC. No countable-transitive-model inference is made.

F2F3F4step 1.1step 2.1
4.1

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 ¬AC, so, under the same antecedent, ZF+BPI cannot prove AC.

F1F4step 3.1discharge-contradiction

Depends on

Used by

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