Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Strict relative placement of BPI between ZF and Choice

Statement

Conditional on Con(ZF), BPI is neither provable in ZF nor sufficient over ZF to prove AC. More exactly,

Con(ZF)Con(ZF+¬BPI)

and

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

These are syntactic relative-consistency and conditional nonprovability statements, not unconditional assertions that the displayed theories are consistent.

Facts & Assumptions

Given: Assume Con(ZF).

[F1]

Relative consistency of BPI without Choice over ZF supplies the second displayed implication.

[F2]

Relative consistency of no free ultrafilter on omega over ZF supplies a consistent extension of ZF in which every ultrafilter on ω is principal.

[F3]

BPI and the set ultrafilter lemma are equivalent over ZF says that BPI implies extension of every proper set filter to an ultrafilter.

[F4]

Finite intersection property includes the empty intersection and fixes the finite condition used by the cofinite filter. The standard certified provability predicate fixes the metatheoretic reading.

Proof

technique · two conditional countertheories
1.1

F1 directly gives a consistent extension of ZF in which BPI holds and AC fails. Therefore, under the given consistency hypothesis, ZF+BPI cannot prove AC.

F1given
1.2

In the theory supplied by F2, let C be the cofinite filter on ω. Every finite intersection of cofinite sets is cofinite and nonempty, including the empty intersection ω, so C is proper by F4. If BPI held, F3 would extend C to an ultrafilter U. No principal ultrafilter extends C: the ultrafilter generated by n contains {n}, whereas ω{n}C. Thus U would be free, contradicting F2.

F2F3F4construct
2.1

Hence the F2 theory proves ¬BPI, yielding the first displayed consistency implication. If ZF proved BPI, that consistent extension of ZF would satisfy BPI as well, contradicting step 1.2. Together with step 1.1 this proves both conditional strictness claims.

F2F4step 1.1step 1.2discharge-contradiction

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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