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.
Choice ledger for Baire, Urysohn, Stone, and Tychonoff
Statement
Ledger: separable complete metric Baire is a theorem of ; complete metric Baire is DC; compact-Hausdorff Baire is exactly DMC; Baireness of products of compact Hausdorff spaces is DC; DMC implies Urysohn's lemma, while, relative to the consistency of ZF, countable choice and BPI are each consistent with the failure of Urysohn's lemma and of bounded Tietze extension; Stone follows from AC, while relative to the consistency of ZF both DC and BPI are separately consistent with a metrizable space having an open cover with no locally finite open refinement; the stronger per-cover effective refinement assertion for discrete metrizable spaces implies AC; compact Hausdorff products and cofinite products have the strength of BPI; compact and arbitrary compact products have the strength of AC. DC implies DMC; if ZF is consistent, ZF does not prove DMC; and DMC-to-DC over remains open.
Remarks
-
Baire rows. Separable complete metric spaces are Baire in ZF is ZF, whereas Dependent Choice is equivalent to the complete-metric Baire principle over ZF proves over ZF that the unrestricted complete-metric Baire principle is equivalent to DC; DMC makes every compact Hausdorff space Baire gives DMC implies compact-Hausdorff Baire, Compact Hausdorff Baire implies DMC gives the converse and Compact Hausdorff Baire is equivalent to DMC packages the equivalence; DC is equivalent to Baireness of compact-Hausdorff products is the product row, which is DC and not merely DMC.
-
Urysohn rows. DMC implies Urysohn's lemma is the positive row; Relative consistency of Countable Choice without Urysohn's lemma and Relative consistency of BPI without Urysohn's lemma are the two separations, and Brunner's endpoint obstruction also refutes bounded Tietze extension records the bounded-Tietze consequence. The status of the converse is The converse from Urysohn's lemma to DMC is open.
-
Stone rows. Stone's theorem, under choice: every metric space is paracompact is the AC row; Relative consistency of DC with failure of Stone's theorem and Relative consistency of BPI with failure of Stone's theorem are relative-consistency separations from DC and BPI, respectively. In the BPI model the sharper obstruction is a metrizable space with an open cover having no point-finite open refinement, hence no locally finite open refinement; Effective metacompactness for discrete metric spaces implies AC is the effective strengthening, and the exact strength of the ordinary theorem is recorded as open in The exact choice strength of Stone's theorem remains open.
-
Tychonoff rows. Cofinite products and compact Hausdorff products have the strength of BPI (Products of cofinite spaces are compact exactly under BPI, and the compact Hausdorff equivalence cited there); compact products and arbitrary compact products have the strength of AC (The compact T1 product theorem is equivalent to AC, The arbitrary compact product theorem is equivalent to AC).
-
Principle rows. DC implies DMC and, assuming the consistency of ZF, DMC is not a ZF theorem (If ZF is consistent, DMC is not provable in ZF); BPI does not imply DMC (BPI does not imply DMC); the qualifications over and the openness of the reversal are in DMC, Multiple Choice, and AC qualifications and DMC versus DC over ZF remains open. No strict DMC-versus-DC claim over is made anywhere in this ledger.
Depends on
- Separable complete metric spaces are Baire in ZF
- Dependent Choice is equivalent to the complete-metric Baire principle over ZF
- DMC makes every compact Hausdorff space Baire
- Compact Hausdorff Baire is equivalent to DMC
- DC is equivalent to Baireness of compact-Hausdorff products
- DMC implies Urysohn's lemma
- DMC versus DC over ZF remains open
- Stone's theorem, under choice: every metric space is paracompact
- Products of cofinite spaces are compact exactly under BPI
- The compact T1 product theorem is equivalent to AC
- The arbitrary compact product theorem is equivalent to AC
- The converse from Urysohn's lemma to DMC is open
- The exact choice strength of Stone's theorem remains open
- Brunner's endpoint obstruction also refutes bounded Tietze extension
- BPI does not imply DMC
- If ZF is consistent, DMC is not provable in ZF
- DMC, Multiple Choice, and AC qualifications
- Relative consistency of Countable Choice without Urysohn's lemma
- Relative consistency of BPI without Urysohn's lemma
- Relative consistency of DC with failure of Stone's theorem
- Relative consistency of BPI with failure of Stone's theorem
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
116 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
- Marianne Morillon, Axiom of Choice (standard reference, not scraped)
- C. Good, I. J. Tree, and W. S. Watson, On Stone's theorem and the axiom of choice (standard reference, not scraped)
- Samuel Corson, The Independence of Stone's Theorem from the Boolean Prime Ideal Theorem (standard reference, not scraped)
- Norbert Brunner, Geordnete Läuchli Kontinuen (standard reference, not scraped)
- Kyriakos Keremedis and Eleftherios Tachtsis, Wallman Compactifications and Tychonoff's Compactness Theorem in ZF (standard reference, not scraped)