Cantor’s Diagonal Argument. Recall that • A set S is finite iff there is a bijection between S and {1, 2,,n} for some positive integer n, and infinite otherwise. Not too long ago, while surfing the TV channels, you could lean back, press the remote, and suddenly you found a show about Georg Cantor (pronounced. The Cantor diagonal method, also called the Cantor diagonal argument or Cantor’s diagonal slash, is a clever technique used by Georg Cantor to show that the.

Author: Shakalrajas Yozshudal
Country: Djibouti
Language: English (Spanish)
Genre: Sex
Published (Last): 23 December 2005
Pages: 304
PDF File Size: 16.10 Mb
ePub File Size: 8.45 Mb
ISBN: 691-1-99964-403-9
Downloads: 70101
Price: Free* [*Free Regsitration Required]
Uploader: Sajora

For the example above, this yields:. Hints help you try the next step on your own. To constructiviststhe argument shows no more than that there is no bijection between the natural numbers and T. Cantor’s point is that dizgonalization real numbers cannot be so listed.

Cantor Diagonalization

The diagonal argument shows that the set of real numbers is “bigger” than the set of natural numbers and therefore, the integers and rationals as well.

In the end, whether you accept diagonalization or not is up to you. Assume that the set is countable. It does not rule out the possibility that the latter are subcountable.

Mon Dec 31 Diagonalization is so common there are special terms for it. Set of real numbers is uncountable.


Cantor’s Diagonal Argument – A Most Merry and Illustrated Example

Next, a sequence s is constructed by choosing the 1st digit as complementary to the 1st digit of s 1 swapping 0 s for 1 s and vice versathe 2nd digit as complementary to the 2nd digit of s 2the 3rd digit as complementary to the 3rd digit of s 3cabtor generally for every nthe n th digit as complementary to the n th digit of s n. Math is hard and requires maturity.

Well, [1, 2, 3] is not the same size as [x, y]: This leads to the family of functions: Contact the MathWorld Team. Since T is uncountable, the image of this function, which is a subset of Ris uncountable. It suffices to prove f diagohalization be surjective. What is a countable diiagonalization Cantor’s diagonal method applies to any setfinite or infinite. At first blush the list of integers appears to be larger than the list of positive integers since I can pair all the positives diagojalization leave all the negatives unpaired.

The positive integers and the negative integers are the same size because I can pair them up x— x for any x. What book are your reading?

Cantor’s diagonal argument

Quine ‘s ” New Foundations ” set theory NF. Suppose that we are going to consider only numbers between 0 and 1.

More simply, there are more problems than there are solutions. This is what my book says:. I don’t understand any of the process behind it and I don’t understand how it all leads to the conclusion that the real numbers are uncountable.


Also, diagonalization was originally used to ccantor the existence of arbitrarily hard complexity classes and played a key role in early attempts to prove P does not equal NP. That means that some member T of P Si. In set theoryCantor’s diagonal argumentalso called the diagonalisation argumentdiaglnalization diagonal slash argument or the diagonal methodwas published in 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.

What is the point?

Cantor diagonal argument construct such a real number which diagonalizarion not counted. The majority of theoreticians in the world seem to accept it; indeed, not accepting it can earn a bit of ridicule. As a candidate consider the set:. An Elementary Approach to Ideas and Methods, 2nd ed. In particular, the cardinality of the real numberswhich can be shown to be isomorphic towhere is the set of natural numbers, is larger than the cardinality of.

Let me try to outline some of the ways it could be a trick. FrostyStraw 4 8