# Axiom of Choice

The Axiom of Choice (AC)[1] is an axiom of Zermelo-Fraenkel set theory holding that:[2]

given any collection of sets, however large, we can pick one element from each set in the collection.

In layman's terms, the Axiom of Choice is "For every nonempty set there is a choice function." Or, "We can choose one element from every element of a nonempty set of disjoint sets and this process by which we choose these sets will set up a new set." More precisely, the Axiom of Choice states that:

For every collection of nonempty sets S, there exists a function f such that f(S) is a member of S for every possible S.

Mathworld explains the Axiom of Choice as follows:[3]

Given any set of mutually disjoint nonempty sets, there exists at least one set that contains exactly one element in common with each of the nonempty sets.

Yet another helpful explanation of the Axiom of Choice is this:[4]

If you have a collection of sets C (which may potentially contain an uncountably large number of sets), then there exists a set H, called the choice set, which contains precisely one element from each (non-empty) set in C. H is called the "choice set" because you are essentially going through each set in C and choosing one element from it. One feature of the Axiom of Choice is that H is simply assumed to exist; there is no algorithm given which might tell you how to construct an example of H.

The Axiom of Choice has many equivalent statements, such as the Tychonoff theorem, the Well-Ordering Theorem, the existence of cardinal numbers, the existence of a basis for every vector space, and the existence of subsets of the real line which do not have a well-defined Lebesgue measure. In algebra it is common to use Zorn's Lemma (also equivalent to the Axiom of Choice) to study ideals in infinite Noetherian rings.

Despite its usefulness, many mathematicians reject the Axiom of Choice. "It bothers some people because it asserts the existence of a set ... without giving enough information to determine that set uniquely (by applying a finite number of rules), and it is the only formal set-theoretical axiom which does this. For this reason it is customary to mention the axiom of choice whenever it is used. It need not be used if the number of sets is finite."[5]

The rejection of the Axiom of Choice reflects a preference for constructive mathematical proofs. AC, by its very nature, is nonconstructive, since it merely asserts that a choice function exists, but does not give an explicit method for its construction. Since the Axiom of Choice is independent of the other axioms, results provable with it may be verified with the other axioms.

Use of the Axiom of Choice has led to some seemingly absurd results. In the Banach-Tarski Paradox, the Axiom of Choice is used to prove that a solid sphere of infinitely divisible parts may be chopped up and reconstructed as two new spheres of identical size, thereby creating 2 out of only 1. This paradox is proven only through use of the Axiom of Choice, and the authors of this proof did so to criticize this Axiom. One attempt to resolve this apparent contradiction is to show that physical spheres are not Lebesgue measurable.[6]

## Use of the Axiom of Choice

The highly publicized proof of Fermat's Last Theorem relies on the Axiom of Choice.[Citation Needed]

## References

1. There are numerous equivalent mathematical descriptions of the Axiom of Choice. Here are two:

and

2. Stephen Willard, "General Topology" 1.17, p. 9 (Dover 2004)
3. http://mathworld.wolfram.com/AxiomofChoice.html
4. http://www.kuro5hin.org/story/2003/5/23/134430/275
5. Willard, supra, 1.17, p. 9.
6. http://www.kuro5hin.org/story/2003/5/23/134430/275