|
|
| Line 1: |
Line 1: |
| {{Redirect|Uncountable|the linguistic concept|Uncountable noun}}
| | The title of the author is Luther. Some time in the past he selected to reside in Idaho. What he truly enjoys performing is to play handball but he is having difficulties to find time for it. Bookkeeping has been his day job for a while.<br><br>Here is my webpage :: [http://Besiki.ge/profile/jerhein.html extended car warranty] |
| | |
| In [[mathematics]], an '''uncountable set''' is an infinite [[Set (mathematics)|set]] that contains too many [[element_(mathematics)|elements]] to be [[countable set|countable]]. The uncountability of a set is closely related to its [[cardinal number]]: a set is uncountable if its cardinal number is larger than that of the set of all [[natural number]]s.
| |
| ==Characterizations==
| |
| | |
| There are many equivalent characterizations of uncountability. A set ''X'' is uncountable if and only if any of the following conditions holds:
| |
| * There is no [[injective function]] from ''X'' to the set of natural numbers.
| |
| * ''X'' is nonempty and every ω-[[sequence]] of elements of ''X'' fails to include at least one element of ''X''. That is, ''X'' is nonempty and there is no [[surjective function]] from the natural numbers to ''X''.
| |
| * The [[cardinality]] of ''X'' is neither finite nor equal to <math>\aleph_0</math> ([[aleph number|aleph-null]], the cardinality of the [[natural number]]s).
| |
| * The set ''X'' has cardinality strictly greater than <math>\aleph_0</math>.
| |
| | |
| The 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 and fourth cannot be proved without additional choice principles.
| |
| | |
| ==Properties==
| |
| * If an uncountable set ''X'' is a subset of set ''Y'', then ''Y'' is uncountable.
| |
| | |
| == Examples ==
| |
| | |
| The best known example of an uncountable set is the set '''R''' of all [[real number]]s; [[Cantor's diagonal argument]] shows that this set is uncountable. The diagonalization proof technique can also be used to show that several other sets are uncountable, such as the set of all infinite [[sequence]]s of [[natural number]]s and the set of all [[subset]]s of the set of natural numbers. The cardinality of '''R''' is often called the [[cardinality of the continuum]] and denoted by ''c'', or <math>2^{\aleph_0}</math>, or <math>\beth_1</math> ([[cardinality of the continuum|beth-one]]).
| |
| | |
| The [[Cantor set]] is an uncountable subset of '''R'''. The Cantor set is a [[fractal]] and has [[Hausdorff dimension]] greater than zero but less than one ('''R''' has dimension one). This is an example of the following fact: any subset of '''R''' of Hausdorff dimension strictly greater than zero must be uncountable.
| |
| | |
| Another example of an uncountable set is the set of all [[Function (mathematics)|function]]s from '''R''' to '''R'''. This set is even "more uncountable" than '''R''' in the sense that the cardinality of this set is <math>\beth_2</math> ([[beth two|beth-two]]), which is larger than <math>\beth_1</math>.
| |
| | |
| A more abstract example of an uncountable set is the set of all countable [[ordinal number]]s, denoted by Ω or ω<sub>1</sub>. The cardinality of Ω is denoted <math>\aleph_1</math> ([[aleph number|aleph-one]]). It can be shown, using the [[axiom of choice]], that <math>\aleph_1</math> is the ''smallest'' uncountable cardinal number. Thus either <math>\beth_1</math>, the cardinality of the reals, is equal to <math>\aleph_1</math> or it is strictly larger. [[Georg Cantor]] was the first to propose the question of whether <math>\beth_1</math> is equal to <math>\aleph_1</math>. In 1900, [[David Hilbert]] posed this question as the first of his [[Hilbert's problems|23 problems]]. The statement that <math>\aleph_1 = \beth_1</math> 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 [[Comparability|incomparable]] to <math>\aleph_0</math> (namely, the cardinalities of [[Dedekind-finite]] infinite sets). Sets of these cardinalities satisfy the first three characterizations above but not the fourth characterization. Because 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 <math>\kappa\!</math> are equivalent:
| |
| *<math>\kappa \nleq \aleph_0;</math>
| |
| *<math>\kappa > \aleph_0;</math> and
| |
| *<math>\kappa \geq \aleph_1</math>, where <math>\aleph_1 = |\omega_1 |</math> and <math>\omega_1\,</math> is least [[initial ordinal]] greater than <math>\omega.\!</math>
| |
| | |
| 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]]
| |
| *[[Injective function]]
| |
| *[[Natural number]]
| |
| | |
| == References ==
| |
| *[[Paul Halmos|Halmos, Paul]], ''[[Naive Set Theory (book)|Naive Set Theory]]''. Princeton, NJ: D. Van Nostrand Company, 1960. Reprinted by Springer-Verlag, New York, 1974. ISBN 0-387-90092-6 (Springer-Verlag edition). Reprinted by Martino Fine Books, 2011. ISBN 978-1-61427-131-4 (Paperback edition).
| |
| *{{Citation|last=Jech|first=Thomas|authorlink=Thomas Jech|year=2002|title=Set Theory|edition=3rd millennium|series=Springer Monographs in Mathematics|publisher=Springer|isbn=3-540-44085-2}}
| |
| | |
| ==External links==
| |
| *[http://www.apronus.com/math/uncountable.htm Proof that '''R''' is uncountable]
| |
| | |
| {{logic}}
| |
| {{Set theory}}
| |
| | |
| [[Category:Basic concepts in infinite set theory]]
| |
| [[Category:Infinity]]
| |
| [[Category:Cardinal numbers]]
| |
| | |
| [[ru:Счётное множество#Связанные понятия]]
| |
The title of the author is Luther. Some time in the past he selected to reside in Idaho. What he truly enjoys performing is to play handball but he is having difficulties to find time for it. Bookkeeping has been his day job for a while.
Here is my webpage :: extended car warranty