Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

BPI does not imply DMC

Statement

Relative to Con(ZF), BPI (The Boolean prime ideal principle) does not imply DMC (Dependent multiple choice in finite-level tree form) over ZF: there is a model of ZF+BPI in which DMC fails.

Facts & Assumptions

Given: The assumed consistency of ZF.

[F1]

Relative to Con(ZF), the theory ZF+BPI+¬URY is consistent, where ¬URY asserts the existence of a normal space with two disjoint closed sets that admit no continuous separation (Relative consistency of BPI without Urysohn's lemma, Normal spaces and T4 spaces, with the source disagreement over whether normality includes T1 stated explicitly).

[F2]

Over ZF, DMC implies Urysohn's lemma: in every normal space any two disjoint closed sets are separated by a continuous function (DMC implies Urysohn's lemma, Dependent multiple choice in finite-level tree form).

Proof

technique · contradiction
1.1

Assume Con(ZF) and suppose, for the sake of contradiction, that ZF+BPI proves DMC.

assume-contragiven
2.1

By [F2] the theory ZF+BPI+¬URY then proves DMC and hence proves URY, since DMC implies Urysohn's lemma in ZF; but it also proves ¬URY by its own axiom, so it is inconsistent.

step 1.1F2
3.1

This contradicts the consistency of ZF+BPI+¬URY given by [F1] under the assumption Con(ZF); hence BPI does not imply DMC over ZF, conditionally on the consistency of ZF.

step 2.1F1discharge-contradiction

Depends on

Used by

Dependency tree · two levels

34 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