Axiom of choice: Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (new entry, just a stub, needs a ''lot'' more work) |
mNo edit summary |
||
(5 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
{{subpages}} | |||
In [[mathematics]], the '''Axiom of Choice''' or '''AC''' is a fundamental principle in [[set theory]] which states that it is possible to choose an element out of each of infinitely many sets simultaneously. The validity of the axiom is not universally accepted among mathematicians and [[Kurt Gödel]] showed that it was independent of the other axioms of set theory. | In [[mathematics]], the '''Axiom of Choice''' or '''AC''' is a fundamental principle in [[set theory]] which states that it is possible to choose an element out of each of infinitely many sets simultaneously. The validity of the axiom is not universally accepted among mathematicians and [[Kurt Gödel]] showed that it was independent of the other axioms of set theory. | ||
The axiom states that if <math>\mathcal A</math> is a family of non-empty sets, there is a ''choice function'' <math>f : \mathcal{A} \rightarrow \cup \mathcal A</math> such that for each <math>A \in \mathcal A</math> we have <math>f(A) \in A</math>: that is, <math>f</math> "chooses" an element of each member of the family <math>\mathcal A</math>. | |||
A closely related formulation of the axiom is that the [[Cartesian product]] of any family of non-empty sets is again non-empty. | |||
== | ==Equivalent formulations== | ||
* | There are a number of statements equivalent to the Axiom of Choice. | ||
* [[Zorn's Lemma]]: If every [[linear order|chain]] in a [[Partial order|partially ordered set]] has an upper bound, then the set has a maximal element. | |||
* The [[Well-ordering Principle]]: Every set can be well-ordered. | |||
* [[Tukey's Lemma]]: Every non-empty system of finite character has a maximal element. | |||
* [[Zermelo's Postulate]]: If <math>\mathcal A</math> is a family of non-empty sets, there is a set <math>C</math> such that <math>C \cap A</math> has exactly one element for each <math>A \in \mathcal A</math>. | |||
* [[Tychonov's Theorem]]: The product of a family of non-empty [[compact space|compact topological space]]s is compact in the [[product topology]].[[Category:Suggestion Bot Tag]] |
Latest revision as of 07:01, 15 July 2024
![](http://s9.addthis.com/button1-share.gif)
In mathematics, the Axiom of Choice or AC is a fundamental principle in set theory which states that it is possible to choose an element out of each of infinitely many sets simultaneously. The validity of the axiom is not universally accepted among mathematicians and Kurt Gödel showed that it was independent of the other axioms of set theory.
The axiom states that if is a family of non-empty sets, there is a choice function such that for each we have : that is, "chooses" an element of each member of the family .
A closely related formulation of the axiom is that the Cartesian product of any family of non-empty sets is again non-empty.
Equivalent formulations
There are a number of statements equivalent to the Axiom of Choice.
- Zorn's Lemma: If every chain in a partially ordered set has an upper bound, then the set has a maximal element.
- The Well-ordering Principle: Every set can be well-ordered.
- Tukey's Lemma: Every non-empty system of finite character has a maximal element.
- Zermelo's Postulate: If is a family of non-empty sets, there is a set such that has exactly one element for each .
- Tychonov's Theorem: The product of a family of non-empty compact topological spaces is compact in the product topology.