Uncountability of (0,1): Cantor’s Diagonal Argument
The Reals in
Are Not Countably Infinite
See also – Cardinality of the Rationals – Positive and Negative included
Claim
The interval
is uncountable. Equivalently, there is no bijection
.
Proof (Cantor’s Diagonal Argument)
Suppose for contradiction that
is countable. Then its elements can be listed as a sequence:
![]()
Write each
in (a chosen) decimal expansion:
![]()
Convention: If a real admits two decimal expansions (e.g.,
), choose the one
not ending with an infinite tail of 9s. This removes ambiguity.
not ending with an infinite tail of 9s. This removes ambiguity.
Construct a new number
by defining its digits
along the diagonal:
![Rendered by QuickLaTeX.com \[ c_n \;=\; \begin{cases} 1, & \text{if } d_{nn}\neq 1,\\ 2, & \text{if } d_{nn}=1, \end{cases} \qquad\text{and}\qquad y \;=\; 0.c_1c_2c_3\ldots \]](https://stationarystates.com/wp-content/ql-cache/quicklatex.com-9a046fbfa9974efb423187e4457aa006_l3.png)
By construction,
differs from
in the
-th digit, so
for all
. This contradicts the assumption that
lists all elements of
.
Therefore,
is uncountable. ![]()
Consequences
has the same cardinality as
(the continuum):
![]()
- The natural numbers are strictly “smaller” in cardinality:
![]()