Cardinality of the continuum
Encyclopedia : C : CA : CAR : Cardinality of the continuum
In mathematics, the cardinality of the continuum is the cardinal number of the set of real numbers R (sometimes called the continuum). This cardinal number is often denoted by c,
- [\mathfrak c = |\mathbb R|]
Properties
Georg Cantor introduced the concept of cardinality to compare the sizes of infinite sets. He famously showed that the set of real numbers is uncountably infinite; i.e. c is strictly greater than the cardinality of the natural numbers, [\aleph_0] (aleph-null):- [\aleph_0 < \mathfrak c]
A variation on Cantor's diagonal argument can be used to prove Cantor's theorem which states that the cardinality of any set is strictly less than that of its power set, i.e. |A| < 2|A|. One concludes that the power set P(N) of the natural numbers N is uncountable. It is then natural to ask whether the cardinality of P(N) is equal to c. It turns out that the answer is yes. One can prove this in two steps:
- Define a map f : R → P(Q) from the reals to the power set of the rationals by sending each real number x to the set [\ | q \le x\}] of all rationals less than or equal to x (with the reals viewed as Dedekind cuts, this is nothing other than the inclusion map in the set of sets of rationals). This map is injective since the rationals are dense in R. Since the rationals are countable we have that [\mathfrak c \le 2^].
- Let N be the set of infinite sequences with values in set . This set clearly has cardinality [2^] (the natural bijection between the set of binary sequences and P(N) is given by the indicator function). Now associate to each such sequence (ai) the unique real number in the interval [0,1] with the ternary-expansion given by the digits (ai), i.e. the i-th digit after the decimal point is ai. The image of this map is called the Cantor set. It is not hard to see that this map is injective, for by avoiding points with the digit 1 in their ternary expansion we avoid conflicts created by the fact that the ternary-expansion of a real number is not unique. We then have that [2^ \le \mathfrak c].
- [\mathfrak c = |\mathcal(\mathbb)| = 2^.]
- [\mathfrak c = \beth_1]
By using the rules of cardinal arithmetic one can show that
- [\mathfrak c = n \mathfrak c = \aleph_0 \mathfrak c = \mathfrak c^n = n^ = ^ = \mathfrak c^]
The continuum hypothesis
The famous continuum hypothesis asserts that c is also the first aleph number [\aleph_1]. In other words, the continuum hypothesis states that there is no set A whose cardinality lies strictly between [\aleph_0] and c
- [\not\exists A : \aleph_0 < |A| < \mathfrak c]
Sets with cardinality c
A great many sets studied in mathematics have cardinality equal to c. Some common examples are the following:
- the real numbers R
- any (nondegenerate) closed or open interval in R (such as the unit interval [0,1])
- the irrational numbers
- the transcendental numbers
- Euclidean space Rn
- the complex numbers C
- the power set of the natural numbers (the set of all subsets of the natural numbers)
- the set of sequences of integers (i.e. all functions N → Z, often denoted ZN)
- the set of sequences of real numbers, RN
- the set of all continuous functions from R to R (the set of all functions RR has cardinality 2c)
- the Cantor set
- the Euclidean topology on Rn (i.e. the set of all open sets in Rn)
This article incorporates material from on PlanetMath, which is licensed under the [Text of the GNU Free Documentation LicenseGFDL].
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.
