Skip to content

Cantor's Theorem

Theorem

Cantor's theorem states that for every set AA,

card⁡(A)<card⁡(2A),\operatorname{card}(A)<\operatorname{card}(2^A),

where 2A2^A is the power set of AA.


Interpretation

Cantor's theorem says that a set always has more subsets than elements: no function from AA to its power set 2A2^A, also written P(A)\mathcal{P}(A), can reach every subset. This holds for infinite sets too.

A set A = {a, b} mapped into its power set, which has four elements; the empty set and {a, b} are never hit by the map that sends x to {x}.

For A={a,b}A=\{a,b\} the power set has 22=42^2=4 elements. The map x↦{x}x\mapsto\{x\} is injective, which shows card⁡(A)≤card⁡(2A)\operatorname{card}(A)\le\operatorname{card}(2^A), but it hits only {a}\{a\} and {b}\{b\}, never ∅\varnothing or {a,b}\{a,b\}. For a finite set with nn elements the theorem is just n<2nn<2^n; its content is that no other map does better, even for infinite sets.

The reason is a diagonal construction. Given any f ⁣:A→2Af\colon A\to2^A, form D={x∈A ⁣:x∉f(x)}D=\{x\in A\colon x\notin f(x)\}. If D=f(d)D=f(d) for some d∈Ad\in A, then d∈Dd\in D exactly when d∉f(d)=Dd\notin f(d)=D, which is impossible. So DD is missed and no ff is surjective, in particular no ff is a bijection. In the figure every xx lies in {x}\{x\}, so D=∅D=\varnothing, one of the two missed subsets.

Applied to N\mathbb{N}, the theorem gives the uncountable set 2N2^{\mathbb{N}}, whose cardinality is the cardinality of the continuum. Applied again and again it gives ℵ0<2ℵ0<22ℵ0<⋯\aleph_0<2^{\aleph_0}<2^{2^{\aleph_0}}<\cdots, so there is no largest infinite size. The argument has the same shape as Cantor's diagonal argument for the real numbers.


Key Results

  • For every infinite set AA, the sets A,2A,22A,…A,2^A,2^{2^A},\ldots represent an infinite staircase of larger and larger infinite cardinalities.
  • A bijection is the main tool for proving that two sets have the same cardinality.

Examples

  • For A=NA=\mathbb{N}, the power set 2N2^{\mathbb{N}} has larger cardinality than N\mathbb{N}.

Prerequisites

Sources

Aliases: Cantor theorem, Cantor's power set theorem Symbols: element of, natural numbers

Last updated: 27 October 2026 11:52