Global Information Lookup Global Information

Axiom of choice information


Illustration of the axiom of choice, with each set Si represented as a jar and its elements represented as marbles. Each element xi is represented as a marble on the right. Colors are used to suggest a functional association of marbles after adopting the choice axiom. The existence of such a choice function is in general independent of ZF for collections of infinite cardinality, even if all Si are finite.
(Si) is an infinite indexed family of sets indexed over the real numbers R; that is, there is a set Si for each real number i, with a small sample shown above. Each set contains at least one, and possibly infinitely many, elements. The axiom of choice allows us to select a single element from each set, forming a corresponding family of elements (xi) also indexed over the real numbers, with xi drawn from Si. In general, the collections may be indexed over any set I, (called index set whose elements are used as indices for elements in a set) not just R.

In mathematics, the axiom of choice, abbreviated AC or AoC, is an axiom of set theory equivalent to the statement that a Cartesian product of a collection of non-empty sets is non-empty. Informally put, the axiom of choice says that given any collection of sets, each containing at least one element, it is possible to construct a new set by choosing one element from each set, even if the collection is infinite. Formally, it states that for every indexed family of nonempty sets, there exists an indexed set such that for every . The axiom of choice was formulated in 1904 by Ernst Zermelo in order to formalize his proof of the well-ordering theorem.[1]

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, 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 choose the smallest element from each set to produce a set. That is, the choice function provides the set of chosen elements. But no definite choice function is known for the collection of all non-empty subsets of the real numbers. In that case, the axiom of choice must be invoked.

Bertrand Russell coined an analogy: for any (even infinite) collection of 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 directly. For an infinite collection of pairs of socks (assumed to have no distinguishing features), there is no obvious way to make a function that forms a set out of selecting one sock from each pair without invoking the axiom of choice.[2]

Although originally controversial, the axiom of choice is now used without reservation by most mathematicians,[3] 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, such as Tychonoff's theorem, require the axiom of choice for their proofs. Contemporary set theorists also study axioms that are not compatible with the axiom of choice, such as the axiom of determinacy. The axiom of choice is avoided in some varieties of constructive mathematics, although there are varieties of constructive mathematics in which the axiom of choice is embraced.

  1. ^ Zermelo 1904.
  2. ^ Jech 1977, p. 351
  3. ^ Jech, 1977, p. 348ff; Martin-Löf 2008, p. 210. According to Mendelson 1964, p. 201:
    The status of the Axiom of Choice has become less controversial in recent years. To most mathematicians it seems quite plausible and it has so many important applications in practically all branches of mathematics that not to accept it would seem to be a wilful hobbling of the practicing mathematician.

and 20 Related for: Axiom of choice information

Request time (Page generated in 1.022 seconds.)

Axiom of choice

Last Update:

the axiom of choice, abbreviated AC or AoC, is an axiom of set theory equivalent to the statement that a Cartesian product of a collection of non-empty...

Word Count : 8013

Axiom of dependent choice

Last Update:

In mathematics, the axiom of dependent choice, denoted by D C {\displaystyle {\mathsf {DC}}} , is a weak form of the axiom of choice ( A C {\displaystyle...

Word Count : 947

Axiom of countable choice

Last Update:

The axiom of countable choice or axiom of denumerable choice, denoted ACω, is an axiom of set theory that states that every countable collection of non-empty...

Word Count : 744

Axiom of global choice

Last Update:

theories, the axiom of global choice is a stronger variant of the axiom of choice that applies to proper classes of sets as well as sets of sets. Informally...

Word Count : 458

Set theory

Last Update:

foundational system for the whole of mathematics, particularly in the form of Zermelo–Fraenkel set theory with the axiom of choice. Besides its foundational role...

Word Count : 5015

List of axioms

Last Update:

lemma Axiom of global choice Axiom of countable choice Axiom of dependent choice Boolean prime ideal theorem Axiom of uniformization Axiom of real determinacy...

Word Count : 270

Uncountable set

Last Update:

first three of these characterizations can be proven equivalent in Zermelo–Fraenkel set theory without the axiom of choice, but the equivalence of the third...

Word Count : 826

Transfinite induction

Last Update:

satisfy the axiom of dependent choice but not the full axiom of choice, the knowledge that a particular proof only requires dependent choice can be useful...

Word Count : 1141

Aleph number

Last Update:

set (with cardinality ℵ0) of positive integers. If the axiom of countable choice (a weaker version of the axiom of choice) holds, then ℵ0 is smaller...

Word Count : 1961

Axiom of determinacy

Last Update:

L(R) of a set theory, which accepts only a weak form of the axiom of choice (AC) but contains all real and all ordinal numbers. Some consequences of AD...

Word Count : 2395

Cardinal number

Last Update:

If the axiom of choice is true, this transfinite sequence includes every cardinal number. If the axiom of choice is not true (see Axiom of choice § Independence)...

Word Count : 3808

Equivalents of the Axiom of Choice

Last Update:

Equivalents of the Axiom of Choice is a book in mathematics, collecting statements in mathematics that are true if and only if the axiom of choice holds. It...

Word Count : 655

Axiom of regularity

Last Update:

that ai+1 is an element of ai for all i. With the axiom of dependent choice (which is a weakened form of the axiom of choice), this result can be reversed:...

Word Count : 2937

Choice function

Last Update:

and f({2, 7}) = 2 is a choice function on X. Ernst Zermelo (1904) introduced choice functions as well as the axiom of choice (AC) and proved the well-ordering...

Word Count : 721

Baire category theorem

Last Update:

proof of BCT1 for arbitrary complete metric spaces requires some form of the axiom of choice; and in fact BCT1 is equivalent over ZF to the axiom of dependent...

Word Count : 1479

Axiom of constructibility

Last Update:

properties). Generalizations of this axiom are explored in inner model theory. The axiom of constructibility implies the axiom of choice (AC), given Zermelo–Fraenkel...

Word Count : 968

Product topology

Last Update:

specialization of Tychonoff's theorem that requires only the ultrafilter lemma (and not the full strength of the axiom of choice) states that any product of compact...

Word Count : 2191

Continuum hypothesis

Last Update:

cardinality of the real numbers." In Zermelo–Fraenkel set theory with the axiom of choice (ZFC), this is equivalent to the following equation in aleph numbers:...

Word Count : 3909

Finite set

Last Update:

(Zermelo–Fraenkel axioms without the axiom of choice) alone. The axiom of countable choice, a weak version of the axiom of choice, is sufficient to prove...

Word Count : 2961

Constructible universe

Last Update:

ZF set theory (that is, of Zermelo–Fraenkel set theory with the axiom of choice excluded), and also that the axiom of choice and the generalized continuum...

Word Count : 6092

PDF Search Engine © AllGlobal.net