The axiom of countable choice or axiom of denumerable choice, denoted ACω, is an axiom of set theory that states that every countable collection of non-empty sets must have a choice function. That is, given a function A with domain \mathbb{N} (where \mathbb{N} denotes the set of natural numbers) such that A(n) is a non-empty set for every, there exists a function f with domain \mathbb{N} such that for every.

Applications

ACω is particularly useful for the development of mathematical analysis, where many results depend on having a choice function for a countable collection of sets of real numbers. For instance, in order to prove that every accumulation point x of a set is the limit of some sequence of elements of, one needs (a weak form of) the axiom of countable choice. When formulated for accumulation points of arbitrary metric spaces, the statement becomes equivalent to ACω. The ability to perform analysis using countable choice has led to the inclusion of ACω as an axiom in some forms of constructive mathematics, despite its assertion that a choice function exists without constructing it.

Example: infinite implies Dedekind-infinite

As an example of an application of ACω, here is a proof (from ZF + ACω) that every infinite set is Dedekind-infinite: Let X be infinite. For each natural number n, let A_n be the set of all n-tuples of distinct elements of X. Since X is infinite, each A_n is non-empty. Application of ACω yields a sequence where each B_n is an n-tuple. One can then concatenate these tuples into a single sequence of elements of X, possibly with repeating elements. Suppressing repetitions produces a sequence of distinct elements, where This i exists, because when selecting c_n it is not possible for all elements of B_{n+1} to be among the n elements selected previously. So X contains a countable set. The function that maps each c_n to c_{n+1} (and leaves all other elements of X fixed) is a one-to-one map from X into X which is not onto, proving that X is Dedekind-infinite.

Relation to other axioms

Stronger and independent systems

The axiom of countable choice (ACω) is strictly weaker than the axiom of dependent choice (DC), which in turn is weaker than the axiom of choice (AC). DC, and therefore also ACω, hold in the Solovay model, constructed in 1970 by Robert M. Solovay as a model of set theory without the full axiom of choice, in which all sets of real numbers are measurable. Urysohn's lemma (UL) and the Tietze extension theorem (TET) are independent of ZF+ACω: there exist models of ZF+ACω in which UL and TET are true, and models in which they are false. Both UL and TET are implied by DC.

Weaker systems

Paul Cohen showed that ACω is not provable in Zermelo–Fraenkel set theory (ZF) without the axiom of choice. However, some countably infinite sets of non-empty sets can be proven to have a choice function in ZF without any form of the axiom of choice. For example, has a choice function, where V_{\omega} is the set of hereditarily finite sets, i.e. the first set in the Von Neumann universe of non-finite rank. The choice function is (trivially) the least element in the well-ordering. Another example is the set of proper and bounded open intervals of real numbers with rational endpoints. ZF+ACω suffices to prove that the union of countably many countable sets is countable. These statements are not equivalent: Cohen's First Model supplies an example where countable unions of countable sets are countable, but where ACω does not hold.

Equivalent forms

There are many equivalent forms to the axiom of countable choice, in the sense that any one of them can be proven in ZF assuming any other of them. They include the following: