Cantor’s Theorem
Statement
Theorem (Cantor, 1891): For any set A, there is no surjection A↠P(A).
Corollary
∣P(A)∣>∣A∣ for every set A.
In particular, there are different sizes of infinity.
Examinable Proof (Diagonalisation)
Setup
Suppose e:A↠P(A) is surjective.
The Diagonal Set
Define U⊆A by:
U={x∈A:x∈/e(x)}
This is the set of all elements that are not members of the set they’re mapped to.
Contradiction
Since e is surjective, there exists a∈A with e(a)=U.
Question: Is a∈U?
- If a∈U: Then a∈/e(a)=U. Contradiction.
- If a∈/U: Then a∈e(a)=U (by definition of U). Contradiction.
Either way, contradiction. Therefore no such surjection exists.
Visualisation
Consider A=N. If e:N→P(N) enumerated all subsets:
| n | e(n)⊆N | n∈e(n)? |
|---|
| 0 | {1,2,3,…} | No |
| 1 | {0,2,4,…} | No |
| 2 | {0,1,3,…} | Yes |
| 3 | {3} | Yes |
| ⋮ | ⋮ | ⋮ |
The diagonal U “flips” the membership on the diagonal. U differs from every row, so cannot appear.

Uncountability of R
R≅P(N) via binary expansions.
Since P(N) is uncountable, R is uncountable.
No Largest Cardinality
Given any set A, the set P(A) is strictly larger.
Iterating: ∣A∣<∣P(A)∣<∣P(P(A))∣<…
N⊊R
N is countable, R is not.
Lawvere’s Fixed Point Theorem
Statement
If there exists a surjection e:A↠(A→X), then every function f:X→X has a fixed point.
Proof
Define φ:A→X by φ(a)=f(e(a)(a)).
Since e is surjective, there exists a0 with e(a0)=φ.
Then: e(a0)(a0)=φ(a0)=f(e(a0)(a0)).
So e(a0)(a0) is a fixed point of f.
Deriving Cantor’s Theorem
Take X={0,1}.
A surjection A↠(A→{0,1}) would imply every f:{0,1}→{0,1} has a fixed point.
But the swap map f(0)=1, f(1)=0 has no fixed point. Contradiction.
Therefore (A→{0,1})≅P(A) has no surjection from A.
Summary
- Cantor’s Theorem: No surjection A↠P(A)
- Proof uses diagonal argument: construct U={x:x∈/e(x)}
- R is uncountable; there is no largest set
- Lawvere’s theorem generalises Cantor: surjections to function spaces force fixed points