Can We Prove the Irrationals Are Uncountable Without Cantor’s Diagonal Argument?
At a glance
- 1. Assume countability
Suppose the irrational numbers can be listed, and combine that list with the rational numbers.
- 2. List all reals
Because the rationals are countable, this would produce a list of every real number.
- 3. Build nested intervals
Construct successively smaller closed intervals, each avoiding the next real number in the list.
- 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 are countable. One way to see this is to write each rational number as , where and , and arrange the pairs 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
and
Every real number is either rational or irrational. Interleaving these two lists would therefore produce a list of all real numbers:
Thus, the assumption that the irrationals are countable would imply that is countable.
It remains to show that cannot be listed.
A nested-interval proof that the reals are uncountable
Assume that all real numbers have been listed:
We will construct a real number that is different from every .
Start with the closed interval
Now divide into three closed subintervals of equal length. At least one of those subintervals does not contain . Choose such a subinterval and call it .
Next, divide into three equal closed subintervals. At least one does not contain . Choose one and call it .
Continue this process. At stage , divide into three equal closed subintervals and choose one that does not contain . The intervals satisfy
and their lengths satisfy
For example, the first few choices might look schematically like this:
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 such that
But was chosen not to contain . Since belongs to , it follows that
So is a real number that does not occur anywhere in the alleged list
This contradicts the claim that the list contains every real number. Hence is uncountable.
Finish the argument for the irrationals
If the irrational numbers were countable, then the rationals and irrationals together would make countable. But the nested-interval argument proves that is uncountable. Therefore, the irrational numbers must be uncountable.
Symbolically, if were countable, then
would be a union of two countable sets and hence countable. This is impossible, so 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 .
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 is countable does not by itself prove that the irrationals are uncountable. You also need an argument showing that 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 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 .
References
- Walter Rudin, Principles of Mathematical Analysis
- Stephen Abbott, Understanding Analysis
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.