Uncountable set
In mathematics, an uncountable set, informally, is an infinite set that contains too many elements to be countable.
≈ 3 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, an uncountable set, informally, is an infinite set that contains too many elements to be countable. The uncountability of a set is closely related to its cardinal number: a set is uncountable if its cardinal number is larger than aleph-null, the cardinality of the natural numbers. Examples of uncountable sets include the set of all real numbers and the set of all subsets of the natural numbers.
Characterizations
There are many equivalent characterizations of uncountability. A set is uncountable if and only if any of the following conditions hold: There is no injective function (hence no bijection) from to the set of natural numbers. is nonempty and for every ω-sequence of elements of , there exists at least one element of X not included in it.
That is, is nonempty and there is no surjective function from the natural numbers to . The cardinality of is neither finite nor equal to \aleph_0 (aleph-null). The set has cardinality strictly greater than \aleph_0 .
The first three of these characterizations can be proved equivalent in Zermelo–Fraenkel set theory without the axiom of choice, but the equivalence of the third and fourth cannot be proved without additional choice principles.
Properties
If an uncountable set is a subset of set , then is uncountable. A more abstract example of an uncountable set is the set of all countable ordinal numbers, denoted by Ω or ω 1 . The cardinality of Ω is denoted \aleph_1 (aleph-one).
It can be shown, using the axiom of choice, that \aleph_1 is the smallest uncountable cardinal number. Thus either \beth_1 , the cardinality of the reals, is equal to \aleph_1 or it is strictly larger. Georg Cantor was the first to propose the question of whether \beth_1 is equal to \aleph_1 .
In 1900, David Hilbert posed this question as the first of his 23 problems. The statement that \aleph_1 = \beth_1 is now called the continuum hypothesis, and is known to be independent of the Zermelo–Fraenkel axioms for set theory (including the axiom of choice).
Without the axiom of choice
Without the axiom of choice, there might exist cardinalities incomparable to \aleph_0 (namely, the cardinalities of Dedekind-finite infinite sets). Sets of these cardinalities satisfy the first three characterizations above, but not the fourth characterization.
Since these sets are not larger than the natural numbers in the sense of cardinality, some may not want to call them uncountable. If the axiom of choice holds, the following conditions on a cardinal \kappa are equivalent: \kappa \nleq \aleph_0; \kappa > \aleph_0; and \kappa \geq \aleph_1 , where \aleph_1 = |\omega_1 | and \omega_1 is the least initial ordinal greater than \omega.
However, these may all be different if the axiom of choice fails. So it is not obvious which one is the appropriate generalization of "uncountability" when the axiom fails. It may be best to avoid using the word in this case and specify which of these one means.
See also
Aleph number Beth number First uncountable ordinal Injective function
Text derived from https://en.wikipedia.org/w/index.php?oldid=1373487012 under CC BY-SA 4.0; modifications have been made.