Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-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.

DMC versus DC over ZF remains open

Statement

Over ZF: DC implies DMC. Strictness is known in ZFA, but whether DMC implies DC in ZF is open; no strictness over ZF is asserted.

Remarks

  • The implication. DC implies DMC over ZF by DC and finite multiple selections, which records the equivalence DC(DMCACω,fin) and hence gives the direction used here. The principles are those of The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain and Dependent multiple choice in finite-level tree form; the finite-selection form is the one in which the implication is stated, so no conversion between the tree and menu presentations is needed.

  • The ZFA strictness. Dodu and Morillon record that Fraenkel's second model of ZFA satisfies DMC but does not satisfy DC. Thus the model has a DMC menu system for every serial relation while some serial relation has no infinite dependent-choice chain. This is the direction needed to show that DMC does not imply DC in ZFA. It is not a statement about ZF, and no such statement is made here.

  • The open question. Morillon poses the reversal over ZF as an open question in the same section that records the tree form of DMC. This item reports that status and nothing more: absence of a published proof of DMCDC in ZF is not converted into a nonimplication theorem, and the separately proved independence results of this page, which refute Urysohn's lemma under principles that do not imply DMC, do not decide the reversal either.

  • Why the qualification matters for consumers. The published Baire-category ledger on the deferred catalogue asserts strictness of DMC below DC and below multiple choice in ZF and ZFA alike. That stronger wording is not a theorem here: the results proved on this page give the implication and the ZFA separation, and consumers of this item must keep the two theories apart.

Depends on

Used by

Dependency tree · two levels

14 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