User:Tnttodda/sandbox

From Wikipedia, the free encyclopedia
This page is about a concept in set and number theory. It is not to be confused with matrix diagonalization. See diagonalization (disambiguation) for several other uses of the term in mathematics.

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.

In set theory, Cantor's diagonal argument, also called the diagonalisation argument, the diagonal slash argument, the anti-diagonal argument, the diagonal method, and Cantor's diagonalization proof, was published in 1891 by Georg Cantor as a mathematical proof that there are infinite sets which cannot be put into one-to-one correspondence with the infinite set of natural numbers.[1][2]: 20– [3] Such sets are now known as uncountable sets, and the size of infinite sets is now treated by the theory of cardinal numbers which Cantor began.

The diagonal argument was not Cantor's first proof of the uncountability of the real numbers, which appeared in 1874.[4][5] However, it demonstrates a general technique that has since been used in a wide range of proofs,[6] including the first of Gödel's incompleteness theorems[2] and Turing's answer to the Entscheidungsproblem. Diagonalization arguments are often also the source of contradictions like Russell's paradox[7][8] and Richard's paradox.[2]: 27 

Uncountable set[edit]

Cantor considered the set T of all infinite sequences of binary digits (i.e. each digit is zero or one).[note 1] He begins with a constructive proof of the following lemma:

If s1, s2, ... , sn, ... is any enumeration of elements from T,[note 2] then an element s of T can be constructed that doesn't correspond to any sn in the enumeration.

The proof starts with an enumeration of elements from T, for example

s1 = (0, 0, 0, 0, 0, 0, 0, ...)
s2 = (1, 1, 1, 1, 1, 1, 1, ...)
s3 = (0, 1, 0, 1, 0, 1, 0, ...)
s4 = (1, 0, 1, 0, 1, 0, 1, ...)
s5 = (1, 1, 0, 1, 0, 1, 1, ...)
s6 = (0, 0, 1, 1, 0, 1, 1, ...)
s7 = (1, 0, 0, 0, 1, 0, 0, ...)
...

Next, a sequence s is constructed by choosing the 1st digit as complementary to the 1st digit of s1 (swapping 0s for 1s and vice versa), the 2nd digit as complementary to the 2nd digit of s2, the 3rd digit as complementary to the 3rd digit of s3, and generally for every n, the nth digit as complementary to the nth digit of sn. For the example above, this yields

s1 = (0, 0, 0, 0, 0, 0, 0, ...)
s2 = (1, 1, 1, 1, 1, 1, 1, ...)
s3 = (0, 1, 0, 1, 0, 1, 0, ...)
s4 = (1, 0, 1, 0, 1, 0, 1, ...)
s5 = (1, 1, 0, 1, 0, 1, 1, ...)
s6 = (0, 0, 1, 1, 0, 1, 1, ...)
s7 = (1, 0, 0, 0, 1, 0, 0, ...)
...
s = (1, 0, 1, 1, 1, 0, 1, ...)

By construction, s is a member of T that differs from each sn, since their nth digits differ (highlighted in the example). Hence, s cannot occur in the enumeration.

Based on this lemma, Cantor then uses a proof by contradiction to show that:

The set T is uncountable.

The proof starts by assuming that T is countable. Then all its elements can be written in an enumeration s1, s2, ... , sn, ... . Applying the previous lemma to this enumeration produces a sequence s that is a member of T, but is not in the enumeration. However, if T is enumerated, then every member of T, including this s, is in the enumeration. This contradiction implies that the original assumption is false. Therefore, T is uncountable.[1]

Notes[edit]

  1. ^ Cantor used "m and "w" instead of "0" and "1", "M" instead of "T", and "Ei" instead of "si".
  2. ^ Cantor does not assume that every element of T is in this enumeration.

References[edit]

  1. ^ a b Georg Cantor (1891). "Ueber eine elementare Frage der Mannigfaltigkeitslehre". Jahresbericht der Deutschen Mathematiker-Vereinigung. 1: 75–78. English translation: Ewald, William B., ed. (1996). From Immanuel Kant to David Hilbert: A Source Book in the Foundations of Mathematics, Volume 2. Oxford University Press. pp. 920–922. ISBN 0-19-850536-1.
  2. ^ a b c Keith Simmons (30 July 1993). Universality and the Liar: An Essay on Truth and the Diagonal Argument. Cambridge University Press. ISBN 978-0-521-43069-2.
  3. ^ Rudin, Walter (1976). Principles of Mathematical Analysis (3rd ed.). New York: McGraw-Hill. p. 30. ISBN 0070856133.
  4. ^ Gray, Robert (1994), "Georg Cantor and Transcendental Numbers" (PDF), American Mathematical Monthly, 101 (9): 819–832, doi:10.2307/2975129, JSTOR 2975129
  5. ^ Bloch, Ethan D. (2011). The Real Numbers and Real Analysis. New York: Springer. p. 429. ISBN 978-0-387-72176-7.
  6. ^ Sheppard, Barnaby (2014). The Logic of Infinity (illustrated ed.). Cambridge University Press. p. 73. ISBN 978-1-107-05831-6. Extract of page 73
  7. ^ "Russell's paradox". Stanford encyclopedia of philosophy.
  8. ^ Bertrand Russell (1931). Principles of mathematics. Norton. pp. 363–366.

External links[edit]


Retrieved from "https://en.wikipedia.org/w/index.php?title=User:Tnttodda/sandbox&oldid=1086503936"