# Cantor’s Theorem

Cantor’s theorem is one of the few major results in set theory. It states that, for any set $$A,$$ the power set of $$A$$ has a strictly greater cardinality than $$A$$ itself:

$\left| {\mathcal{P}\left( A \right)} \right| \gt \left| A \right|.$

This statement is obvious for finite subsets because

${\left| A \right| = n,\;\;\left| {\mathcal{P}\left( A \right)} \right| = {2^n},\;\;}\kern0pt{\text{and }{2^n} \gt n\; \forall n \ge 0.}$

For example, the cardinality of the set $$\left\{ {1,2,3,4} \right\}$$ is $$4,$$ while the cardinality of its power set is

$\left| {\mathcal{P}\left( {\left\{ {1,2,3,4} \right\}} \right)} \right| = {2^4} = 16.$

But the theorem applies to both finite and infinite sets, so to prove $$\left| {\mathcal{P}\left( A \right)} \right| \gt \left| A \right|$$ we must use functional relations between the sets.

### Proof

We need to show that there is an injection $$f:A \to \mathcal{P}\left( A \right)$$ but no surjection $$f:A \to \mathcal{P}\left( A \right).$$

To define an injection from $$A$$ to $$\mathcal{P}\left( A \right),$$ we just map $$x \in A$$ to the singleton set $$\left\{ x \right\} \in \mathcal{P}\left( A \right):$$

$f\left( x \right) = \left\{ x \right\}.$

Clearly, this mapping is one-to-one. Hence, $$\left| A \right| \le \left| {\mathcal{P}\left( A \right)} \right|.$$

Suppose by contradiction that $$f$$ is surjective. Consider the set

$B = \left\{ {x \in A \mid x \not\in f\left( x \right)} \right\}.$

In words, the set $$B$$ contains all those elements $$x \in A$$ whose image under the function $$f$$ does not include $$x$$ itself. For example, if $$A = \left\{ {1,2,3} \right\},$$ we could map

$\require{AMSsymbols}{1 \to \varnothing,\;\;}\kern0pt{2 \to \left\{ {1,3} \right\},\;\;}\kern0pt{3 \to \left\{ 2 \right\}.}$

The set $$B$$ is a subset of $$A,$$ so $$B \in \mathcal{P}\left( A \right).$$ Since $$f$$ is assumed to be surjective, there is an element $$a \in A$$ such that $$f\left( a \right) = B.$$ There are two possibilities: either $$a \in B$$ or $$a \not\in B.$$ We consider these two cases separately.

1. If $$a \in B,$$ then $$a \in f\left( a \right).$$ By the definition of $$B,$$ this means that $$a \not\in B,$$ which is a contradiction.
2. If $$a \not\in B,$$ then $$a \not\in f\left( a \right),$$ and hence, $$a \in B,$$ which is again a contradiction.

Therefore, the initial assumption is false and $$\left| A \right| \ne \left| {\mathcal{P}\left( A \right)} \right|.$$ Thus, we have proved the strict inequality

$\left| A \right| \lt \left| {\mathcal{P}\left( A \right)} \right|.$

We see that taking the power set of a set creates a set of larger cardinality. Starting with $${\aleph_0} = \left| \mathbb{N} \right|$$ and applying this operation successively, we get an infinite sequence of sets with increasing cardinality:

${{\aleph_0} = \left| \mathbb{N} \right| \lt \left| {\mathcal{P}\left( \mathbb{N} \right)} \right| }\lt{ \left| {\mathcal{P}\left( {\mathcal{P}\left( \mathbb{N} \right)} \right)} \right| }\lt{ \left| {\mathcal{P}\left( {\mathcal{P}\left( {\mathcal{P}\left( \mathbb{N} \right)} \right)} \right)} \right| \lt \cdots }$

### Continuum Hypothesis

According to Cantor’s theorem, $$\left| {\mathcal{P}\left( \mathbb{N} \right)} \right|$$ is strictly greater than $$\left| \mathbb{N} \right|.$$ From the other side, it is known that the set of real numbers $$\left| \mathbb{R} \right|$$ has the same cardinality as $$\left| {\mathcal{P}\left( \mathbb{N} \right)} \right|,$$ so we have

${\aleph_0} = \left| \mathbb{N} \right| \lt \left| \mathbb{R} \right|.$

The question is, does there exist a set $$A$$ whose cardinality is strictly between that of the integers and the real numbers?

$\left| \mathbb{N} \right| \lt \left| A \right| \lt \left| \mathbb{R} \right|?$

The continuum hypothesis states that there is no set $$A$$ whose cardinality lies between $$\left| \mathbb{N} \right|$$ and $$\left| \mathbb{R} \right|.$$

Cantor and other mathematicians tried for decades to prove or disprove the continuum hypothesis without any success. The problem was considered so important that Hilbert put it at the top of his famous list of open problems published in $$1900.$$ Ultimately, Gödel and Cohen showed that the continuum hypothesis is independent of axiomatic set theory. We can either accept it as true or accept it as false. Any of these choices leads to a consistent (but different) version of set theory.

## Solved Problems

Click or tap a problem to see the solution.

### Example 1

Let $$A = \left\{ {a,b,c,d,e} \right\}.$$ The mapping $$f:A \to \mathcal{P}\left( A \right)$$ is defined by ${f\left( a \right) = \left\{ {a,d,e} \right\},\;}\kern0pt{f\left( b \right) = \left\{ {a,c} \right\},\;}\kern0pt{f\left( c \right) = \left\{ {a,b,d,e} \right\},\;}\kern0pt{f\left( d \right) = \varnothing,\;}\kern0pt{f\left( e \right) = \left\{ {b,c,e} \right\}.}$ Determine the set $B = \left\{ {x \in A \mid x \not\in f\left( x \right)} \right\}.$

### Example 2

The mapping function $$f:\mathbb{N} \to \mathcal{P}\left( \mathbb{N} \right)$$ is defined by $f\left( n \right) = \mathbb{N}\backslash \left\{ {{n^2} – \left( {2m – 1} \right)n} \right\},$ where $$n,m \in \mathbb{N}.$$ Determine the set $B = \left\{ {n \in \mathbb{N} \mid n \not\in f\left( n \right)} \right\}.$

### Example 3

Prove that the set of all sets does not exist.

### Example 1.

Let $$A = \left\{ {a,b,c,d,e} \right\}.$$ The mapping $$f:A \to \mathcal{P}\left( A \right)$$ is defined by ${f\left( a \right) = \left\{ {a,d,e} \right\},\;}\kern0pt{f\left( b \right) = \left\{ {a,c} \right\},\;}\kern0pt{f\left( c \right) = \left\{ {a,b,d,e} \right\},\;}\kern0pt{f\left( d \right) = \varnothing,\;}\kern0pt{f\left( e \right) = \left\{ {b,c,e} \right\}.}$ Determine the set $B = \left\{ {x \in A \mid x \not\in f\left( x \right)} \right\}.$

Solution.

This set is used in the proof of Cantor’s theorem. We see that

${a \in f\left( a \right),\;}\kern0pt{b \notin f\left( b \right),\;}\kern0pt{c \notin f\left( c \right),\;}\kern0pt{d \notin f\left( d \right),\;}\kern0pt{e \in f\left( e \right).}$

Hence,

${B = \left\{ {x \in A \mid x \notin f\left( x \right)} \right\} }={ \left\{ {b,c,d} \right\}.}$

### Example 2.

The mapping function $$f:\mathbb{N} \to \mathcal{P}\left( \mathbb{N} \right)$$ is defined by $f\left( n \right) = \mathbb{N}\backslash \left\{ {{n^2} – \left( {2m – 1} \right)n} \right\},$ where $$n,m \in \mathbb{N}.$$ Determine the set $B = \left\{ {n \in \mathbb{N} \mid n \not\in f\left( n \right)} \right\}.$

Solution.

The condition $$n \not\in f\left( n \right)$$ is met if $$n$$ satisfies the equation

$n = {n^2} – \left( {2m – 1} \right)n.$

Solving it, we obtain:

${n = {n^2} – \left( {2m – 1} \right)n,}\;\; \Rightarrow {n = {n^2} – 2mn + n,}\;\; \Rightarrow {{n^2} – 2mn = 0,}\;\; \Rightarrow {n\left( {n – 2m} \right) = 0.}$

Since $$n \gt 0,$$ the solution is given by

$n = 2m,\;\text{where}\;m \in \mathbb{N}.$

Thus, the set $$B$$ contains all even natural numbers:

${B = \left\{ {n \in \mathbb{N} \mid n \notin f\left( n \right)} \right\} }={ \mathbb{E} }={ \left\{ {m \in \mathbb{N} \mid 2m} \right\}.}$

### Example 3.

Prove that the set of all sets does not exist.

Solution.

Assume, by contradiction, that the set of all sets exists and denote it by $$S.$$ Then its power set $$\mathcal{P}\left( S \right)$$ exists as well.

Every element of $$\mathcal{P}\left( S \right)$$ is a set. Therefore $$\mathcal{P}\left( S \right)$$ is contained in $$S,$$ and we get $$\left| \mathcal{P}\left( S \right)\right| \le \left|S\right|.$$

From the other side, according to Cantor’s theorem, we know that $$\left|S\right| \lt \left|\mathcal{P}\left( S \right)\right|.$$

We have a contradiction. This means that the set of all sets does not exist.