Contact lenses articles

A choice function is a mathematical function <math>f</math> whose domain <math>X</math> is a collection of nonempty sets such that for every <math>S</math> in <math>X</math>, <math>f(S)</math> is in <math>S</math>. In other words <math>f</math> chooses exactly one element from each set in <math>X</math>.

The axiom of choice (AC) states that every set of nonempty sets has a choice function. A weaker form of axiom of Choice, the axiom of countable choice (AC_ω) states that every countable set of nonempty sets has a choice function. However, in the absence of either AC or AC_ω, some sets can still be shown to have a choice function.

• If <math>X</math> is a finite set of nonempty sets, then one can construct a choice function for <math>X</math> by picking one element from each member of <math>X.</math> This requires only finitely many choices, so neither AC or AC_ω is needed.

• If every member of <math>X</math> is a well-ordered nonempty set, then it is possible to pick the least element of each member of <math>X.</math> In this case infinitely many choices may be required, but there is a rule for making the choices, so again neither AC or AC_ω is needed. The distinction between “well-ordered” and “well-orderable” is important here: if the members of <math>X</math> were merely well-orderable, it would be necessary to choose a well-ordering of each member, and this might require infinitely many arbitrary choices, and therefore AC (or AC_ω, if <math>X</math> were countably infinite).

• If every member of <math>X</math> is a nonempty set, and the union <math>\bigcup X</math> is well-orderable, then it is possible to choose a well-ordering for this union, and this induces a well-ordering on every member of <math>X</math>, so a choice function will exist as in the previous example. In this case it was possible to well-order every member of <math>X</math> by making just one choice, so neither AC nor AC_ω was needed. (This example shows that the well-ordering theorem, which states that every set can be well-ordered, implies AC. The converse is also true, but less trivial.)

See also

• Axiom of choice
• Axiom of countable choice
• Hausdorff paradox