Cantor's diagonal argument
Sign in to saveproof technique in set theory
Wikidata facts
- Instance of
- theorem
- Subclass of
- mathematical proof
- Named after
- Georg Cantor
- Has use
- Entscheidungsproblem
Show 1 more fact
- maintained by WikiProject
- WikiProject Mathematics
via Wikidata · CC0
~16 min read
Encyclopedic overview
An illustration of Cantor's diagonal argument (in base 2) for the existence of uncountable sets. The sequence at the bottom cannot occur anywhere in the enumeration of sequences above. An infinite set may have the same cardinality as a proper subset of itself, as the depicted bijection f(x)=2x from the natural to the even numbers demonstrates. Nevertheless, infinite sets of different cardinalities exist, as Cantor's diagonal argument shows.
Cantor's diagonal argument (among various similar names) is a mathematical proof that there are infinite sets which cannot be put into one-to-one correspondence with the infinite set of natural numbers – informally, that there are sets which in some sense contain more elements than there are positive integers. Such sets are now called uncountable sets, and the size of infinite sets is treated by the theory of cardinal numbers, which Cantor began.
Excerpted from Wikipedia’s “Cantor's diagonal argument” article, available under the CC BY-SA 4.0 licence.