Metraipolis › archive › dc_a135e8eaa722

Axiom of choice — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Axiom_of_choice
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T21:48:24.527Z
SHA-256 of the archived text
21803f91bd1b7fef394501b1c524a5e2e538be2d2cef8b447f283a72c398be78
Stable URL of this page
https://metraipolis.com/documento/dc_a135e8eaa722

How to cite

Axiom of choice — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Axiom_of_choice (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a135e8eaa722 (Metraipolis archive dc_a135e8eaa722, sha256 21803f91bd1b7fef394501b1c524a5e2e538be2d2cef8b447f283a72c398be78)
BibTeX
@misc{dca135e8eaa722,
  title = {Axiom of choice — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Axiom_of_choice},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a135e8eaa722; sha256 21803f91bd1b7fef394501b1c524a5e2e538be2d2cef8b447f283a72c398be78},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Axiom_of_choice. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In mathematics, the axiom of choice, abbreviated AC or AoC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of non-empty sets, one can identify another set containing one element chosen from each set, even if the collection is infinite. Formally, the axiom establishes existence rather than a construction; it states that for every set I {\displaystyle I} and every I {\displaystyle I} -indexed family ( S i ) i ∈ I {\displaystyle (S_{i})_{i\in I}} of nonempty sets, there exists an I {\displaystyle I} -indexed set ( x i ) i ∈ I {\displaystyle (x_{i})_{i\in I}} of elements of ∪ i ∈ I S i {\displaystyle \cup _{i\in I}S_{i}} such that x i ∈ S i {\displaystyle x_{i}\in S_{i}} for every i ∈ I {\displaystyle i\in I} . The axiom of choice was formulated in 1904 by Ernst Zermelo in order to formalize his proof of the well-ordering theorem. In many cases, a set created by choosing elements can be made without invoking the axiom of choice, particularly if the number of sets from which to choose the elements is finite (in which induction can be applied), or if a canonical rule on how to choose the elements is available – some distinguishing property that happens to hold for exactly one element in each set. An illustrative example is sets picked from the natural numbers. From such sets, one may always select the smallest number, e.g. given the sets {{4, 5, 6}, {10, 12}, {1, 400, 617, 8000}}, the set containing each smallest element is {4, 10, 1}. In this case, "select the smallest number" is a choice function. Even if infinitely many sets are collected from the natural numbers, it will always be possible to form a choice function from choosing the smallest element from each set to produce a set; the axiom of choice is not needed here. On the other hand, for the collection of all non-empty subsets of the real numbers, there is no known canonical rule by which one can choose one element from each of these subsets. In that case, the axiom of choice must be invoked to construct the desired choice function. Bertrand Russell coined an analogy: for any (even infinite) collection of unordered pairs of shoes, one can pick out the left shoe from each pair to obtain an appropriate collection (i.e. set) of shoes; this makes it possible to define a choice function without using the axiom of choice. However, for an infinite collection of unordered pairs of socks (assumed to have no distinguishing features such as being a left sock rather than a right sock), there is no natural (i.e., canonical) way of choosing one sock from each pair, so one must appeal to the axiom of choice to construct the desired choice function. Although originally controversial, the axiom of choice is now used without reservation by most mathematicians, and is included in the standard form of axiomatic set theory, Zermelo–Fraenkel set theory with the axiom of choice (ZFC). One motivation for this is that a number of generally accepted mathematical results, s

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «category theory»).
Fonte: Wikipedia in inglese, voce «Axiom of choice» — https://en.wikipedia.org/wiki/Axiom_of_choice
Wikidata Q179692 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q179692
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Axiom_of_choice?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1379080484, consultata il 2026-10-07T21:23:28.721Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 91da4dda0d92e3baa3883e2b315b1fb582c7090e6f70a2021a0914072f6f04e4