Axiom of countable choice
From Wikipedia, the free encyclopedia
The axiom of countable choice, denoted ACω, or axiom of denumerable choice, is an axiom of set theory, similar to the axiom of choice. It states that any countable collection of non-empty sets must have a choice function. Paul Cohen showed that ACω is not provable in Zermelo-Fraenkel set theory (ZF).
ZF + ACω suffices to prove that the union of countably many countable sets is countable. It also suffices to prove that every infinite set is Dedekind-infinite (and hence has a countably infinite subset). ACω is particularly useful for the development of analysis, where many results depend on having a choice function for a countable set of real numbers (considered as sets of Cauchy sequences of rationals).
ACω is a weak form of the axiom of choice (AC) which states that every collection of non-empty sets must have a choice function. AC clearly implies the axiom of dependent choice (DC), and DC is sufficient to show ACω. However ACω is strictly weaker than DC (and DC is strictly weaker than AC).
This article incorporates material from axiom of countable choice on PlanetMath, which is licensed under the GFDL.
 |
This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |
