Definition
Let be a set, there does not exist a bijective function between and .
This implies that no set is equipotent to its power set. But not only that. To learn more, the Wikipedia page on Cantor’s theorem is very comprehensive (section: “Consequences of the theorem”).
Proof
To demonstrate this theorem, let’s reason by contradiction:
Let be a bijective function.
Set .
is a subset of (= element of ) defined as the set of elements of that do not belong to their image by .
To understand why we take this , let’s take an example: For , and and , , is indeed a subset of , yet it has no antecedent by . See Cantor’s diagonal argument
such that .
A function from to is said to be surjective if for every element of , there is at least one element of such that . Formally, we have: . As an element of , must admit an antecedent by because is surjective.
We have 2 cases:
- If , then, by definition of , . Thus , which is contradictory.
- If , then by definition of , . Therefore , so , which is again contradictory.
, although an element of does not have an antecedent by . Therefore, is neither surjective nor bijective. Hence Cantor’s theorem.
Complement
Cantor’s theorem can also be formulated as follows: For any set , . This is naturally demonstrated by the non-existence of surjectivity (demonstrated above) and the existence of the injective function .
For example, for , , is associated with and with .