Procedure

Increasing Cardinality Of A Finite Set

Let be a finite set of numbers, which is initially thought to have cardinality/size . This means there exists a bijection from the elements of the set to the natural numbers. More informally, we can count the elements of , and represent them as . This usually involves applying a total ordering on the set.

Let . (We already know there are 999 such numbers). However, let’s assume for now that there are only 3 such numbers, . If we were to order them in ascending order, we get . Now, divide each number into a set of their constituting digits, like so: . Representing it as a matrix, we have:

Then, we can construct a new number (that belongs in ), by constructing where . More intuitively, we essentially look at the diagonal of this matrix, which is , and make a new number such that the first digit is not 1, the second digit is not 5 and the 3rd digit is not 0. For example, is a new number that belongs in , which means has at least cardinality of 4 (and we can keep increasing this by finding new ’s).

|500 %%🖋 Edit in Excalidraw, and the dark exported image%%

Visual aid, not the 'proper' way of doing it.

The proper diagonal argument does not relate to matrices, nor lists, but to sequences. The matrix-like approach shown above is only a visual aid because (as you’ll see below), it starts to break down when we talk about numbers represented as infinite sequences.

Proving Uncountability Of An Infinite Set

Now that we’ve done it for finite sets, we can apply this same procedure to infinite sets, to increase their cardinality from the natural numbers (being countable) to the real numbers (being uncountable).

Real numbers are uncountable