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 , BPI (The Boolean prime ideal principle) does not imply DMC (Dependent multiple choice in finite-level tree form) over : there is a model of in which DMC fails.
Facts & Assumptions
Given: The assumed consistency of .
Relative to , the theory is consistent, where 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 spaces, with the source disagreement over whether normality includes stated explicitly).
Over , 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
Assume and suppose, for the sake of contradiction, that proves DMC.
By [F2] the theory then proves DMC and hence proves , since DMC implies Urysohn's lemma in ZF; but it also proves by its own axiom, so it is inconsistent.
This contradicts the consistency of given by [F1] under the assumption ; hence BPI does not imply DMC over , conditionally on the consistency of .
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
- Norbert Brunner, Geordnete Läuchli Kontinuen (standard reference, not scraped)