Axiom of Dependent Choice¶
Assert an infinite coherent sequence whenever every element of a nonempty set has a permitted successor.
Core Idea¶
The axiom of dependent choice says that a nonempty set with a binary relation giving every element at least one successor has an infinite sequence whose successive terms follow that relation. It asserts one coherent ω-sequence, not merely that a path exists for each finite length. The next choice may depend on the previous one. Over ZF it is strictly stronger than countable choice and strictly weaker than full choice.[^ref-f0b84da902ad]
Scope of Application¶
DC supports countably many dependent choices in mathematical proofs. An original foundations result equates it, over ZF, with the appropriate Baire Category Theorem for arbitrary complete metric spaces. It also turns a nonempty subset without a minimal element into an infinite descending chain; the converse direction needs no DC. The exact theorem formulation and base theory matter.[ref-718095ed07b4][ref-e6fc614ed732]
Clarity¶
For nonempty A and a relation R with ∀x∈A ∃y∈A xRy, DC supplies f:ℕ→A such that f(n) R f(n+1) for every n. Seriality promises a successor, not a unique formula for one. Predetermined countable nonempty sets instead pose a countable-choice problem; their options need not depend on earlier selections.[^ref-f0b84da902ad]
Manages Complexity¶
The axiom isolates the logical premise of an infinite sequential construction. A proof can state DC when it only needs dependent natural-number-length choices, instead of invoking full choice. Finite induction alone does not turn separate finite witnesses into one completed compatible sequence; this is a proof gap, not an opposed-cost design tension. A comparison of foundational economy and theorem reach needs an exact ZF-relative theorem; the cited Baire equivalence was checked only at abstract level.[ref-f0b84da902ad][ref-718095ed07b4]
Abstract Reasoning¶
If a relation has no dead ends, a starting point can be extended once, then again, and to every finite length. DC provides a single path containing all these steps. In a non-well-founded subset, take “is strictly smaller” as the relation: each current element has a smaller successor, so DC yields an infinite descent.[^ref-e6fc614ed732]
Knowledge Transfer¶
The same proof schema applies to nested approximations, order descent and other countably staged constructions once the carrier and successor premise are explicit. It does not automatically establish transfinite choice or every restricted Baire theorem. The named principle remains a set-theoretic axiom and a strict child of the prime Axiom, rather than a new prime itself.[ref-f0b84da902ad][ref-718095ed07b4]
[^ref-f0b84da902ad]: Thomas Jech, The Axiom of Choice (1973), §2.4 and §8.1. [^ref-718095ed07b4]: Robert Goldblatt, “On the role of the Baire Category Theorem and Dependent Choice in the foundations of logic”, Journal of Symbolic Logic 50(2), 1985, 412–422, DOI 10.2307/2274230; publisher abstract on complete-metric Baire equivalence. [^ref-e6fc614ed732]: Martin David Coen, Interactive Program Derivation, University of Cambridge Computer Laboratory Technical Report UCAM-CL-TR-272 (1992), Appendix A.1.
Relationships to Other Abstractions¶
Current abstraction Axiom of Dependent Choice Domain-specific
Parents (1) — more general patterns this builds on
-
Axiom of Dependent Choice is a kind of Axiom Prime
Dependent Choice is a specified axiom adopted over ZF set theory.
Hierarchy path (1) — routes to 1 parentless root
- Axiom of Dependent Choice → Axiom → Epistemic Mode Of A Proposition
Neighborhood in Abstraction Space¶
Axiom of Dependent Choice sits in a moderately populated region (55th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Formal Models & Logical Foundations (33 abstractions)
Nearest neighbors
- Natural Number — 0.87
- Well-founded set — 0.85
- Floyd's Cycle-Finding Algorithm — 0.85
- Big O in probability notation — 0.85
- Julia set — 0.85
Computed from structural-signature embeddings · 2026-10-08