# Cantor's theorem

﻿
Cantor's theorem

:"Note: in order to fully understand this article you may want to refer to the set theory portion of the table of mathematical symbols."

In elementary set theory, Cantor's theorem states that, for any set "A", the set of all subsets of "A" (the power set of "A") has a strictly greater cardinality than "A" itself. Cantor's theorem is obvious for finite sets, but holds true for infinite sets as well. In particular, the power set of a countably infinite set is uncountably infinite. The theorem is named for German mathematician Georg Cantor, who first stated and proved it.

Proof

Two sets are equinumerous (have the same cardinality) if and only if there is a one-to-one correspondence between them. To establish Cantor's theorem it must be shown that given any set "A" no function "f" from "A" into the power set of "A" can be surjective. To do that, it is enough to show the existence of at least one subset of "A" that is not an element of the image of "A" under "f". Such a subset, "B", is given by the following construction:

:$B=left\left\{,xin A : x otin f\left(x\right), ight\right\}.$

This means, by definition, that for all "x" in "A", "x" ∈ "B" if and only if "x" ∉ "f"("x"), so for all "x" the sets "B" and "f"("x") are different. There is no "x" such that "f"("x") = "B"; in other words, "B" is not in the image of "f". Therefore the power set of "A" has a greater cardinality than "A" itself.

Because of the double occurrence of "x" in the expression "x" ∉ "f"("x")", this is a diagonal argument.

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 then some element of "A" must map to it. 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 into "B" causing another contradiction. Thus nothing maps to "B" and "f" can never be onto.

A detailed explanation of the proof when "X" is countably infinite

To get a handle on the proof, let's examine it for the specific case when "X" is countably infinite. Without loss of generality, we may take "X" = N = {1, 2, 3,...}, the set of natural numbers.

Suppose that N is bijective with its power set P(N). Let us see a sample of what P("N") looks like:

:$P\left(mathbb\left\{N\right\}\right)=\left\{varnothing,\left\{1, 2\right\}, \left\{1, 2, 3\right\}, \left\{4\right\}, \left\{1, 5\right\}, \left\{3, 4, 6\right\}, \left\{2, 4, 6,dots\right\},dots\right\}.$

P(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 a handle on what the elements of P(N) look like, let us attempt to pair off each element of N with each element of P(N) to show that these infinite sets are bijective. In other words, we will attempt to pair off each element of N with an element from the infinite set P(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 "D" be the set of "all" non-selfish natural numbers. By definition, the power set P(N) contains all sets of natural numbers, and so it contains this set "D" as an element. Therefore, "D" must be paired off with some natural number, say "d". However, this causes a problem. If "d" is selfish, then number "d" cannot be a member of "D", since "D" was defined to contain only non-selfish numbers. But then "d" is non-selfish, because it is not a member of "D". On the other hand, if "d" is non-selfish, then . . . well, then it must be contained in "D", again by the definition of "D"!

This is a contradiction because the natural number cannot be both inside and outside of "D" at the same time. Therefore, there is no natural number which can be paired with "D", and we have contradicted our original supposition, that there is a bijection between N and P(N).

Through this proof by contradiction we have proven that the cardinality of N and P(N) cannot be equal. We also know that the cardinality of P(N) cannot be less than the cardinality of N because P(N) contains all singletons, by definition, and these singletons form a "copy" of N inside of P(N). Therefore, only one possibility remains, and that is the cardinality of P(N) is strictly greater than the cardinality of N, and this proves Cantor's theorem.

Note that the set "D" may be empty. This would mean that every natural number x maps to a set 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 P(N), so the mapping still does not cover P(N).

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".

Russell has a very similar proof in "Principles of Mathematics" (1903, section 348), where he shows that 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.

For one consequence of Cantor's theorem, see beth numbers.

ee also

*Controversy over Cantor's theory
*Cantor-Bernstein-Schroeder theorem

References

*Paul Halmos, "Naive set theory". Princeton, NJ: D. Van Nostrand Company, 1960. Reprinted by Springer-Verlag, New York, 1974. ISBN 0-387-90092-6 (Springer-Verlag edition).
*Jech, Thomas, 2003. "Set Theory: The Third Millennium Edition, Revised and Expanded". Springer. ISBN 3-540-44085-2.

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Cantor's theorem — Fundamental theorem of set theory, proved by Cantor in 1891. It is usually split into two parts. Cantor s theorem says that the set of real numbers is non denumerable. Cantor s power set theorem shows that the power set of any set is always… …   Philosophy dictionary

• Cantor-Bendixson theorem — noun A theorem which states that a closed set in a Polish space is the disjoint union of a countable set and a perfect set. From the Cantor Bendixson theorem it can be deduced that an uncountable set in must have an uncountable number of limit… …   Wiktionary

• Cantor–Bernstein–Schroeder theorem — In set theory, the Cantor–Bernstein–Schroeder theorem, named after Georg Cantor, Felix Bernstein, and Ernst Schröder, states that, if there exist injective functions f : A → B and g : B → A between the sets A and B , then there exists a bijective …   Wikipedia

• Cantor's paradox — In set theory, Cantor s paradox is the theorem that there is no greatest cardinal number, so that the collection of infinite sizes is itself infinite. Furthermore, it follows from this fact that this collection is not a set but a proper class; in …   Wikipedia

• Theorem — The Pythagorean theorem has at least 370 known proofs[1] In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and previously accepted statements …   Wikipedia

• Cantor , Georg Ferdinand Ludwig Philipp — (1845–1918) German mathematician The son of a prosperous merchant of St. Petersburg, at that time the capital of Russia, Cantor was educated at the University of Berlin where he completed his PhD in 1868. In 1870 he joined the faculty of the… …   Scientists

• Cantor's diagonal argument — An illustration of Cantor s diagonal argument for the existence of uncountable sets. The sequence at the bottom cannot occur anywhere in the list of sequences above. Cantor s diagonal argument, also called the diagonalisation argument, the… …   Wikipedia

• Cantor's paradox — The contradiction arising if we compare for size the set of all sets, and its own power set . By Cantor s theorem the power set must be bigger (contain more members). But it is itself a subset of the set of all sets, and so cannot be bigger. The… …   Philosophy dictionary

• Cantor — ist der Name von Bernard Gerald Cantor (1916–1996), US amerikanischer Unternehmer und Kunstmäzen, Firmengründer der Cantor Fitzgerald Eddie Cantor (1892–1964), US amerikanischer Entertainer Eric Cantor (* 1963), US amerikanischer Politiker Georg… …   Deutsch Wikipedia

• Cantor space — In mathematics, the term Cantor space is sometimes used to denotethe topological abstraction of the classical Cantor set:A topological space is aCantor space if it is homeomorphic to the Cantor set.The Cantor set itself is of course a Cantor… …   Wikipedia