nLab dependent choice

Dependent choice

Dependent choice


In set theory, the axiom of dependent choice (DC) states that if XX is a nonempty (inhabited) set and if RR is a total binary relation on XX, then there exists a sequence x:Xx\colon \mathbb{N} \to X such that (x n,x n+1)(x_n, x_{n+1}) belongs to RR for all nn \in \mathbb{N}. 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 x n+1x_{n+1} depend on the choice of x nx_n made at the previous stage.


Typical applications of dependent choice include Kőnig's lemma? and the Baire category theorem for complete metric spaces.


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.

Last revised on December 5, 2022 at 07:19:13. See the history of this page for a list of all contributions to it.