Ma · Mathematics

Can We Prove the Irrationals Are Uncountable Without Cantor’s Diagonal Argument?

Published By the 9to5Science editorial team

At a glance

  1. 1. Assume countability

    Suppose the irrational numbers can be listed, and combine that list with the rational numbers.

  2. 2. List all reals

    Because the rationals are countable, this would produce a list of every real number.

  3. 3. Build nested intervals

    Construct successively smaller closed intervals, each avoiding the next real number in the list.

  4. 4. Use completeness

    The nested intervals contain a real number missing from the alleged list, giving a contradiction.

The irrational numbers are uncountable, and you can prove this without using Cantor’s familiar decimal diagonal argument. The cleanest route is to use the nested-interval property of the real numbers.

The proof has two parts. First, show that if the irrationals were countable, then all real numbers would be countable. Second, prove directly that the real numbers cannot be listed by constructing a real number that is missing from any proposed list.

Countable sets involved

The rational numbers Q\mathbb{Q} are countable. One way to see this is to write each rational number as p/qp/q, where p∈Zp\in\mathbb{Z} and q∈Nq\in\mathbb{N}, and arrange the pairs (p,q)(p,q) in a grid. Reading the grid by diagonals gives a list, with repetitions removed.

Suppose, for contradiction, that the irrational numbers were also countable. Then there would be lists

Q={q1,q2,q3,…}\mathbb{Q}=\{q_1,q_2,q_3,\ldots\}

and

R∖Q={i1,i2,i3,…}.\mathbb{R}\setminus\mathbb{Q}=\{i_1,i_2,i_3,\ldots\}.

Every real number is either rational or irrational. Interleaving these two lists would therefore produce a list of all real numbers:

q1,i1,q2,i2,q3,i3,…q_1,i_1,q_2,i_2,q_3,i_3,\ldots

Thus, the assumption that the irrationals are countable would imply that R\mathbb{R} is countable.

It remains to show that R\mathbb{R} cannot be listed.

A nested-interval proof that the reals are uncountable

Assume that all real numbers have been listed:

R={x1,x2,x3,…}.\mathbb{R}=\{x_1,x_2,x_3,\ldots\}.

We will construct a real number that is different from every xnx_n.

Start with the closed interval

J0=[0,1].J_0=[0,1].

Now divide J0J_0 into three closed subintervals of equal length. At least one of those subintervals does not contain x1x_1. Choose such a subinterval and call it J1J_1.

Next, divide J1J_1 into three equal closed subintervals. At least one does not contain x2x_2. Choose one and call it J2J_2.

Continue this process. At stage nn, divide Jn−1J_{n-1} into three equal closed subintervals and choose one that does not contain xnx_n. The intervals satisfy

J0⊇J1⊇J2⊇⋯J_0\supseteq J_1\supseteq J_2\supseteq\cdots

and their lengths satisfy

length⁡(Jn)=13n.\operatorname{length}(J_n)=\frac{1}{3^n}.

For example, the first few choices might look schematically like this:

J0=[0,1],J1⊆J0,J2⊆J1,J3⊆J2.J_0=[0,1],\qquad J_1\subseteq J_0,\qquad J_2\subseteq J_1,\qquad J_3\subseteq J_2.

The exact intervals depend on the proposed list, but every choice is possible because one point cannot belong to all three separated thirds.

Why the intervals have a common point

The nested-interval property of the real numbers says that a nested sequence of nonempty closed intervals whose lengths approach zero has exactly one common point. Therefore, there is a real number xx such that

x∈Jnfor every n. x\in J_n\quad\text{for every }n.

But JnJ_n was chosen not to contain xnx_n. Since xx belongs to JnJ_n, it follows that

x≠xnfor every n. x\neq x_n\quad\text{for every }n.

So xx is a real number that does not occur anywhere in the alleged list

x1,x2,x3,…. x_1,x_2,x_3,\ldots.

This contradicts the claim that the list contains every real number. Hence R\mathbb{R} is uncountable.

Finish the argument for the irrationals

If the irrational numbers were countable, then the rationals and irrationals together would make R\mathbb{R} countable. But the nested-interval argument proves that R\mathbb{R} is uncountable. Therefore, the irrational numbers must be uncountable.

Symbolically, if I=R∖QI=\mathbb{R}\setminus\mathbb{Q} were countable, then

R=Q∪I\mathbb{R}=\mathbb{Q}\cup I

would be a union of two countable sets and hence countable. This is impossible, so II is uncountable.

What “without Cantor” means here

This proof does not use Cantor’s decimal diagonal construction. It does, however, use a theorem about the real numbers that is closely related in spirit: the nested-interval property, which depends on the completeness of R\mathbb{R}.

If “without Cantor” means avoiding every theorem associated with Cantor, then the request needs clarification. Standard proofs of the uncountability of the reals rely on some equivalent foundational fact, such as the nested-interval theorem, the least-upper-bound property, or the Baire category theorem. What can be avoided is the particular diagonalization with decimal expansions.

Common mistakes

Showing only that the rationals are countable

The fact that Q\mathbb{Q} is countable does not by itself prove that the irrationals are uncountable. You also need an argument showing that R\mathbb{R} is uncountable.

Assuming the complement of a countable set is automatically uncountable

That statement is true when the ambient set is known to be uncountable. The fact that R\mathbb{R} is uncountable must therefore be established first.

Constructing a number outside only the irrational list

If you directly avoid each listed irrational, the resulting number might be rational. The safer argument combines the rational and irrational lists into a list of all real numbers, then constructs a real number outside that complete list.

Forgetting completeness

The claim that the nested closed intervals share a point is not true in every ordered number system. It relies on the completeness of the real numbers; for example, analogous intervals can have no common rational point when considered inside Q\mathbb{Q}.

References

  1. Walter Rudin, Principles of Mathematical Analysis
  2. Stephen Abbott, Understanding Analysis

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.