Uncountable Sets

Learn about uncountable sets and Cantor’s diagonalization method.

What is an uncountable set?

A set that is not countable is called an uncountable set. To establish that a set AA is uncountable, we must show that a bijection between the set of positive integers Z+\mathbb{Z}^+ and the set AA does not exist. However, it is not obvious to prove that a bijection between two sets does not exist.

As our first example, we will show that a set of real numbers is uncountable. For that, Cantor’s diagonalization method is a powerful argument—developed by Georg Cantor—to show the nonexistence of a bijection between a set of positive integers and a set of real numbers. This technique has applications in many areas of science and philosophy.

A set of real numbers

In this section, we will prove that a set of real numbers R\mathbb{R} is uncountable by showing that no bijection exists between a set of positive integers and the set of real numbers using the technique of proof by contradiction. A real number rnr_n—in its general form with the position of a decimal point after the digit dnpd_n^p—can be viewed as follows:

Get hands-on with 1200+ tech skills courses.