# A Proof that the power set of the natural numbers is bigger than the natural numbers themselves

## Objective

To show that some infinities are larger than others!

## Method

We use a technique sometimes called "diagonalization", and the notion of a one-to-one correspondence.

### Equally Big Infinite Sets

Because we cannot "count" two infinite sets to see which is bigger, we need another method. The method we use it so show that two sets are the same size is to find a bijection (one-to-one and onto) mapping between the two sets (which sets up unique partners, essentially).

For simplicity, we'll focus on the natural number ${\displaystyle \mathbb {N} =\{1,2,3,4,\ldots \}}$. For example, to show that the even natural numbers are equally numerous as the natural numbers themselves, we can set up the one-to-one correspondence given by

 Natural Numbers (${\displaystyle \mathbb {N} }$) Evens 1 2 2 4 3 6 4 8 5 10 ${\displaystyle \vdots }$ ${\displaystyle \vdots }$ n 2n ${\displaystyle \vdots }$ ${\displaystyle \vdots }$

Our conclusion: the even naturals are as numerous as the naturals themselves. Certainly this counts as a non-intuitive idea, because we're used to proper subsets being smaller than the sets from which they derive.

### Bigger Infinite Sets

So, in order to show that there is a bigger infinite set, we need to show that there is no one-to-one mapping from one set to the other. In particular, we're going to show that the power set of the naturals, denoted ${\displaystyle P(\mathbb {N} )}$, is larger than the naturals themselves.

The proof is by contradiction: suppose that there exists a one-to-one correspondence between the two sets. It might begin like this:

To show that the even natural numbers are equally numerous as the natural numbers themselves, we can set up the one-to-one correspondence given (for example) by the following:

 ${\displaystyle \mathbb {N} }$ ${\displaystyle P(\mathbb {N} )}$ 1 ${\displaystyle \emptyset }$ 2 ${\displaystyle \mathbb {N} }$ 3 {1,2,6} 4 Evens 5 Primes ${\displaystyle \vdots }$ ${\displaystyle \vdots }$ ${\displaystyle \left.n\right.}$ ${\displaystyle \left.S(n)\right.}$ ${\displaystyle \vdots }$ ${\displaystyle \vdots }$

That is, for each natural number on the left there corresponds a unique partner subset of the natural numbers. Clearly there are infinitely many subsets, because, for example ${\displaystyle (\forall i\in \mathbb {N} )(\{i\}\in P(\mathbb {N} ))}$. ${\displaystyle \emptyset }$ is the empty set, which is a subset of every set.

We will now demonstrate that there is a subset ${\displaystyle M\in P(\mathbb {N} )}$ which is not found on the right hand side, contradicting the claim that the mapping is one-to-one.

We do it by construction, through a process called diagonalization: we are going to go down the (infinite) list, and decide whether each natural number ${\displaystyle \left.n\right.}$ on the left is in ${\displaystyle \left.M\right.}$ based on the set it's partnered with, ${\displaystyle \left.S(n)\right.}$.

Here's the rule:

1. Consider the ${\displaystyle \left.n^{th}\right.}$ row.
2. If ${\displaystyle \left.n\right.}$ is in the partner set ${\displaystyle \left.S(n)\right.}$, then ${\displaystyle \left.n\right.}$ is not in ${\displaystyle \left.M\right.}$.
3. If ${\displaystyle \left.n\right.}$ is not in the partner set ${\displaystyle \left.S(n)\right.}$, then ${\displaystyle \left.n\right.}$ is in ${\displaystyle \left.M\right.}$.

Then we know that ${\displaystyle \left.S(n)\right.}$ and ${\displaystyle \left.M\right.}$ differ in at least one element (one and only one of the two sets has ${\displaystyle \left.n\right.}$ as a member), for every ${\displaystyle \left.n\right.}$. Therefore, ${\displaystyle \left.M\right.}$ is not found on the right hand side, and the mapping was not a one-to-one correspondence.

This is a contradiction, and we conclude that there is no one-to-one correspondence between the two sets. Hence one is larger than the other (and the larger set is the power set).

## Conclusion

So, some infinite sets are larger than others. How many sizes of infinite sets are there?

Turns out that there is an infinite chain of infinitely larger sets. The proof can be extended to show that the power set of S is always larger than the set S itself (whether S is finite or infinite); hence, if we start with an infinite set S, the chain

${\displaystyle \left.S,P(S),P(P(S)),P(P(P(S))),\ldots \right.}$

is an infinite string of infinitely larger infinities! Curiouser and curiouser....