Cantor's theorem

Cantor's theorem
In mathematical set theory, Cantor's theorem is a fundamental result which states that, for any set , the set of all subsets of the power set of has a strictly greater cardinality than itself.
For finite sets, Cantor's theorem can be seen to be true by simple enumeration of the number of subsets. Counting the empty set as a subset, a set with elements has a total of subsets, and the theorem holds because for all non-negative integers.
Much more significant is Cantor's discovery of an argument that is applicable to any set, and shows that the theorem holds for infinite sets also. As a consequence, the cardinality of the real numbers, which is the same as that of the power set of the integers, is strictly larger than the cardinality of the integers; see Cardinality of the continuum for details.
The theorem is named for German mathematician Georg Cantor, who first stated and proved it at the end of the 19th century. Cantor's theorem had immediate and important consequences for the philosophy of mathematics. For instance, by iteratively taking the power set of an infinite set and applying Cantor's theorem, we obtain an endless hierarchy of infinite cardinals, each strictly larger than the one before it. Consequently, the theorem implies that there is no largest cardinal number (colloquially, "there's no largest infinity").
Proof
Cantor's argument is elegant and remarkably simple. The complete proof is presented below, with detailed explanations to follow.
By definition of cardinality, we have for any two sets and if and only if there is an injective function but no bijective function from to It suffices to show that there is no surjection from to . This is the heart of Cantor's theorem: there is no surjective function from any set to its power set. To establish this, it is enough to show that no function that maps elements in to subsets of can reach every possible subset, i.e., we just need to demonstrate the existence of a subset of that is not equal to for any ∈ . (Recall that each is a subset of .) Such a subset is given by the following construction, sometimes called the Cantor diagonal set of :
This means, by definition, that for all x ∈ A, x ∈ B if and only if x ∉ f(x). For all x the sets B and f(x) cannot be the same because B was constructed from elements of A whose images (under f) did not include themselves. More specifically, consider any x ∈ A, then either x ∈ f(x) or x ∉ f(x). In the former case, f(x) cannot equal B because x ∈ f(x) by assumption and x ∉ B by the construction of B. In the latter case, f(x) cannot equal B because x ∉ f(x) by assumption and x ∈ B by the construction of B.
Equivalently, and slightly more formally, we just proved that the existence of ξ ∈ A such that f(ξ) = B implies the following contradiction:
Therefore, by reductio ad absurdum, the assumption must be false. Thus there is no ξ ∈ A such that f(ξ) = B; in other words, B is not in the image of f and f does not map to every element of the power set of A, i.e., f is not surjective.
Finally, to complete the proof, we need to exhibit an injective function from A to its power set. Finding such a function is trivial: just map x to the singleton set {x}. The argument is now complete, and we have established the strict inequality for any set A that card(A) < card(𝒫(A)).
Another way to think of the proof is that B, empty or non-empty, is always in the power set of A. For f to be onto, some element of A must map to B. But that leads to a contradiction: no element of B can map to B because that would contradict the criterion of membership in B, thus the element mapping to B must not be an element of B meaning that it satisfies the criterion for membership in B, another contradiction. So the assumption that an element of A maps to B must be false; and f cannot be onto.
Because of the double occurrence of x in the expression "x ∉ f(x)", this is a diagonal argument. For a countable (or finite) set, the argument of the proof given above can be illustrated by constructing a table in which each row is labelled by a unique x from A = {x1, x2, ...}, in this order. A is assumed to admit a linear order so that such table can be constructed. Each column of the table is labelled by a unique y from the power set of A; the columns are ordered by the argument to f, i.e. the column labels are f(x1), f(x2), ..., in this order. The intersection of each row x and column y records a true/false bit whether x ∈ y. Given the order chosen for the row and column labels, the main diagonal D of this table thus records whether x ∈ f(x) for each x ∈ A. The set B constructed in the previous paragraphs coincides with the row labels for the subset of entries on this main diagonal D where the table records that x ∈ f(x) is false. Each column records the values of the indicator function of the set corresponding to the column. The indicator function of B coincides with the logically negated (swap "true" and "false") entries of the main diagonal. Thus the indicator function of B does not agree with any column in at least one entry. Consequently, no column represents B.
Despite the simplicity of the above proof, it is rather difficult for an automated theorem prover to produce it. The main difficulty lies in an automated discovery of the Cantor diagonal set. Lawrence Paulson noted in 1992 that Otter could not do it, whereas Isabelle could, albeit with a certain amount of direction in terms of tactics that might perhaps be considered cheating.
When A is countably infinite
Let us examine the proof for the specific case when is countably infinite. Without loss of generality, we may take , the set of natural numbers.
Suppose that N is equinumerous with its power set 𝒫(N). Let us see a sample of what 𝒫(N) looks like:
𝒫(N) contains infinite subsets of N, e.g. the set of all even numbers {2, 4, 6,...}, as well as the empty set.
Now that we have an idea of what the elements of 𝒫(N) look like, let us attempt to pair off each element of N with each element of 𝒫(N) to show that these infinite sets are equinumerous. In other words, we will attempt to pair off each element of N with an element from the infinite set 𝒫(N), so that no element from either infinite set remains unpaired. Such an attempt to pair elements would look like this:
Given such a pairing, some natural numbers are paired with subsets that contain the very same number. For instance, in our example the number 2 is paired with the subset {1, 2, 3}, which contains 2 as a member. Let us call such numbers selfish. Other natural numbers are paired with subsets that do not contain them. For instance, in our example the number 1 is paired with the subset {4, 5}, which does not contain the number 1. Call these numbers non-selfish. Likewise, 3 and 4 are non-selfish.
Using this idea, let us build a special set of natural numbers. This set will provide the contradiction we seek. Let B be the set of all non-selfish natural numbers. By definition, the power set 𝒫(N) contains all sets of natural numbers, and so it contains this set B as an element. If the mapping is bijective, B must be paired off with some natural number, say b. However, this causes a problem. If b is in B, then b is selfish because it is in the corresponding set, which contradicts the definition of B. If b is not in B, then it is non-selfish and it should instead be a member of B. Therefore, no such element b which maps to B can exist.
Since there is no natural number which can be paired with B, we have contradicted our original supposition, that there is a bijection between N and 𝒫(N).
Note that the set B may be empty. This would mean that every natural number x maps to a subset of natural numbers that contains x. Then, every number maps to a nonempty set and no number maps to the empty set. But the empty set is a member of 𝒫(N), so the mapping still does not cover 𝒫(N).
Through this proof by contradiction we have proven that the cardinality of N and 𝒫(N) cannot be equal. We also know that the cardinality of 𝒫(N) cannot be less than the cardinality of N because 𝒫(N) contains all singletons, by definition, and these singletons form a "copy" of N inside of 𝒫(N). Therefore, only one possibility remains, and that is that the cardinality of 𝒫(N) is strictly greater than the cardinality of N, proving Cantor's theorem.
Related paradoxes
Cantor's theorem and its proof are closely related to two paradoxes of set theory.
Cantor's paradox is the name given to a contradiction following from Cantor's theorem together with the assumption that there is a set containing all sets, the universal set . In order to distinguish this paradox from the next one discussed below, it is important to note what this contradiction is. By Cantor's theorem for any set . On the other hand, all elements of are sets, and thus contained in , therefore .
Another paradox can be derived from the proof of Cantor's theorem by instantiating the function f with the identity function; this turns Cantor's diagonal set into what is sometimes called the Russell set of a given set A:
The proof of Cantor's theorem is straightforwardly adapted to show that assuming a set of all sets U exists, then considering its Russell set RU leads to the contradiction:
This argument is known as Russell's paradox. As a point of subtlety, the version of Russell's paradox we have presented here is actually a theorem of Zermelo; we can conclude from the contradiction obtained that we must reject the hypothesis that RU∈U, thus disproving the existence of a set containing all sets. This was possible because we have used restricted comprehension (as featured in ZFC) in the definition of RA above, which in turn entailed that
Had we used unrestricted comprehension (as in Frege's system for instance) by defining the Russell set simply as , then the axiom system itself would have entailed the contradiction, with no further hypotheses needed.
Despite the syntactical similarities between the Russell set (in either variant) and the Cantor diagonal set, Alonzo Church emphasized that Russell's paradox is independent of considerations of cardinality and its underlying notions like one-to-one correspondence.
History
Cantor gave essentially this proof in a paper published in 1891 "Über eine elementare Frage der Mannigfaltigkeitslehre", where the diagonal argument for the uncountability of the reals also first appears (he had earlier proved the uncountability of the reals by other methods). The version of this argument he gave in that paper was phrased in terms of indicator functions on a set rather than subsets of a set. He showed that if f is a function defined on X whose values are 2-valued functions on X, then the 2-valued function G(x) = 1 − f(x)(x) is not in the range of f.
Bertrand Russell has a very similar proof in Principles of Mathematics (1903, section 348), where he shows that there are more propositional functions than objects. "For suppose a correlation of all objects and some propositional functions to have been affected, and let phi-x be the correlate of x. Then "not-phi-x(x)," i.e. "phi-x does not hold of x" is a propositional function not contained in this correlation; for it is true or false of x according as phi-x is false or true of x, and therefore it differs from phi-x for every value of x." He attributes the idea behind the proof to Cantor.
Ernst Zermelo has a theorem (which he calls "Cantor's Theorem") that is identical to the form above in the paper that became the foundation of modern set theory ("Untersuchungen über die Grundlagen der Mengenlehre I"), published in 1908. See Zermelo set theory.
Generalizations
Cantor's theorem has been generalized to any category with products.
See also
Schröder–Bernstein theorem
Cantor's first uncountability proof
Controversy over Cantor's theory
References
Halmos, Paul, Naive Set Theory. Princeton, NJ: D. Van Nostrand Company, 1960. Reprinted by Springer-Verlag, New York, 1974. (Springer-Verlag edition). Reprinted by Martino Fine Books, 2011. (Paperback edition).
External links
1891 introductions
1891 in science
Set theory
Theorems in the foundations of mathematics
Cardinal numbers
Georg Cantor