In set theory, the axiom of dependent choice (DC) states that if is a nonempty (inhabited) set and if is a total binary relation on , then there exists a sequence such that belongs to for all . It is strictly weaker than the full axiom of choice, but strictly stronger than the axiom of countable choice. It is called dependent choice because the available choices for depend on the choice of made at the previous stage.
There is another way to express the axiom of dependent choice which uses surjections instead of entire relations:
The axiom of dependent choice states that given a family of sets and a family of surjections indexed by natural numbers :
the projection function to from the sequential limit of the above diagram is a surjection.
More generally, given an elementary topos or a pretopos with sequential limits, the axiom of dependent choice states that given a sequence of objects and a dependent sequence of epimorphisms indexed by , the projection function to from the sequential limit of the above diagram is an epimorphism.
Typical applications of dependent choice include Kőnig's lemma? and the Baire category theorem for complete metric spaces.
The axiom of dependent choice holds in the topos of condensed sets and the topos of light condensed sets, assuming the axiom of choice in the category of sets.
For a number of schools of constructive mathematics, dependent choice is considered an acceptable alternative to full AC, and the principle holds (assuming that it holds in Set) in quite a few toposes of interest in which full AC doesn’t hold, including all presheaf toposes and the effective topos. In fact, it follows from the stronger presentation axiom, which holds in many of these toposes and also has a constructive justification.
Like countable choice, it fails for sheaves over the space of real numbers.
Wikipedia, Axiom of dependent choice
Felix Cherubini, Thierry Coquand, Freek Geerligs, Hugo Moeneclaey, A Foundation for Synthetic Stone Duality (arXiv:2412.03203, summary)
Mathieu Anel, Reid Barton, Choice axioms and Postnikov completeness (arXiv:2403.19772)
Last revised on December 10, 2025 at 22:45:19. See the history of this page for a list of all contributions to it.