Mathematical logic and foundations Axiom
Axiom of choice
Builds on Choice functionFunction
Statement
Let be a set of nonempty sets. Then there is a choice function on , that is, a function such that for each .
Remarks
An equivalent form: for each family of nonempty sets, the product is nonempty. Over ZF, it is equivalent to Zorn's lemma, to the well-ordering theorem and to the comparability of cardinals. It is independent of ZF, if ZF is consistent. Kurt Gödel showed in 1938 that ZF does not refute it, and Paul Cohen showed in 1963 that ZF does not prove it.
History
Ernst Zermelo formulated the axiom in 1904 for his proof of the well-ordering theorem.
Reading path
To understand this page from the ground up, read these 19 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Disjunction definition
- Implication definition
- Predicate definition
- Family of sets definition
- Ordered pair definition
- Union definition
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Union of a family of sets definition
- Uniqueness quantifier definition
- Binary relation definition
- Function definition
- Choice function definition
- Axiom of choice statement
Where this leads
31 pages build on this one.
- Zorn's lemma
- Hausdorff maximal principle
- Well-ordering theorem
- Every infinite set has a countably infinite subset
- Surjective iff it has a right inverse
- Comparability of cardinals
- Countable union of countable sets is countable
- Nilradical is the intersection of the prime ideals
- Ultrafilter lemma
- Diaconescu's theorem
- Kunen's inconsistency theorem
- Bourbaki–Witt theorem
- Hausdorff paradox
- Order dimension
- Birkhoff's subdirect representation theorem
- Characterizations of semisimple modules
- Midpoint convex function
- Discontinuous additive functions via a Hamel basis
- Banach–Tarski paradox
- Baer's criterion
- Alexander subbase theorem
- Transcendence degree
- Gödel's consistency of CH and AC
- Ultrafilter
- Boolean prime ideal theorem
- Szpilrajn extension theorem
- Von Neumann–Bernays–Gödel set theory
- Existence of transcendence bases
- Axiom of determinacy
- Vitali set
- Cauchy's functional equation
Further reading
- Web https://en.wikipedia.org/wiki/Axiom_of_choice, lead section
About this page
| Tag | 0HTGB13FE2 |
|---|---|
| URI | m2://0HTGB13FE2 |
| Aliases | ac, axiom-of-choice |
| Kind | statement, axiom |
| Writing | W1 stated |
| MSC | 03E25 |
| Status | This copy of the site has no build data. Run m2 status 0HTGB13FE2. |
| Uses | Choice function, Function |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Used by
- Zorn's lemma
- Hausdorff maximal principle
- Well-ordering theorem
- Every infinite set has a countably infinite subset
- Surjective iff it has a right inverse
- Comparability of cardinals
- Countable union of countable sets is countable
- Diaconescu's theorem
- Kunen's inconsistency theorem
- Hausdorff paradox
- Discontinuous additive functions via a Hamel basis
- Banach–Tarski paradox
- Gödel's consistency of CH and AC
- Boolean prime ideal theorem
- Von Neumann–Bernays–Gödel set theory
- Axiom of determinacy
- Vitali set
- Cauchy's functional equation