Talk:Cantor's diagonal argument/Arguments

This page is for arguments over the validity of Cantor's diagonal argument. This is not an archive; you may feel free to edit this page. Please use this page for comments not directly relevant to improving the article Cantor's diagonal argument.

Argument not work

Trovatore deleted the following 1 minute after post:

The argument, as presented, (for reals, sets of bits, or sets of naturals) cannot work even if its conclusion is true because

For proof A to prove B to be FALSE it must allow B room to be true.

Consider someone asking you to count all 1000 three digit numbers, on 3 lines so only 3 numbers fit! Or they ask you to count all 1 digit numbers and after you count 1 number they say count all 2 digit numbers and after you count a second number they say count all 3 digit numbers …!

The height of the list HAS TO BE the exponential of the width to make room for all the sets to be counted per the statement of the proof 'count all the...' for it to be a PROOF. Saying that doesn't count with ∞ because with ∞ one can do magic has to be PROVEN for the rest to be a proof! Example of proper counting: In set theory Aleph infinity is infinite increase without end. Set the rate of increase of the height of the sets, the real numbers, to normal, have the digits of each real number produced by separate algorithms for each line, small to large algorithms, they can produce true random bits. Force the first digits to be a count sequence so each line is different. Set rate of increase of number of digets of nonrandom reals to normal, random reals to the (same base) logarithm of normal, this will force the diagonal to the same rate. The sort is by algorithm, like a program but programing language very complex so will always produce infinite list of digits, and in reasonable time as function of the number of digits yet produced by the algorithm. The width of the random numbers relative to the number of numbers counted is the same as natural numbers. The height keeps pace with the increase of possible numbers per the size of the algorithms and number of bits of randomness used to make any random real. Thus π is not ∞ly far thru the list. The height counts as Aleph0 not Aleph1 per analogy to the height : width relation of the set of natural numbers. π , for example, would be as precise in digits as the number of reals counted. Victor Kosko (talk) 00:28, 24 April 2017 (UTC)

Simple counterexample

"In his 1891 article, Cantor considered the set T of all infinite sequences of binary digits (i.e. each digit is zero or one). He begins with a constructive proof of the following theorem:

If s1, s2, … , sn, … is any enumeration of elements from T, then there is always an element s of T which corresponds to no sn in the enumeration. The proof starts with an enumeration of elements from T, for example:"

Any enumeration, you say?

Let's fully specify the enumeration, as follows: the first digit of a sequence in the enumeration is given by the repeating pattern "10101010...", the second digit is given by pattern "110011001100...", the third digit by "1111000011110000...", the fourth by "1111111100000000..." and so on, or in other words the nth digit is "1" in the first 2^(n-1) sequences of the enumeration, "0" in the next 2^(n-1) sequences, and so on:

s1	=	(1,	1,	1,	1,	1,	...)
s2	=	(0,	1,	1,	1,	1,	...)
s3	=	(1,	0,	1,	1,	1,	...)
s4	=	(0,	0,	1,	1,	1,	...)
s5	=	(1,	1,	0,	1,	1,	...)
s6	=	(0,	1,	0,	1,	1,	...)
s7	=	(1,	0,	0,	1,	1,	...)
s8	=	(0,	0,	0,	1,	1,	...)
s9	=	(1,	1,	1,	0,	1,	...)
s10	=	(0,	1,	1,	0,	1,	...)
s11	=	(1,	0,	1,	0,	1,	...)
s12	=	(0,	0,	1,	0,	1,	...)
s13	=	(1,	1,	0,	0,	1,	...)
s14	=	(0,	1,	0,	0,	1,	...)
s15	=	(1,	0,	0,	0,	1,	...)
s16	=	(0,	0,	0,	0,	1,	...)
s17	=	(1,	1,	1,	1,	0,	...)
s18	=	(0,	1,	1,	1,	0,	...)
s19	=	(1,	0,	1,	1,	0,	...)
s20	=	(0,	0,	1,	1,	0,	...)
s21	=	(1,	1,	0,	1,	0,	...)
s22	=	(0,	1,	0,	1,	0,	...)
s23	=	(1,	0,	0,	1,	0,	...)
s24	=	(0,	0,	0,	1,	0,	...)
s25	=	(1,	1,	1,	0,	0,	...)
s26	=	(0,	1,	1,	0,	0,	...)
s27	=	(1,	0,	1,	0,	0,	...)
s28	=	(0,	0,	1,	0,	0,	...)
s29	=	(1,	1,	0,	0,	0,	...)
s30	=	(0,	1,	0,	0,	0,	...)
s31	=	(1,	0,	0,	0,	0,	...)
s32	=	(0,	0,	0,	0,	0,	...)
...
s	=	(0,	0,	0,	0,	0,	...)

So the complements of the first 5 digits are 0,0,0,0,0.

For the nth sequence, n>5, the digit is 1 if n <= 2^(n-1). When n=6: 6 <= 2^5 so the digit is 1. Since the series 6,7,8,... grows slower than the series 64,128,256,... n <= 2^(n-1) is true for all n>5 and as such the complements of the digits for all n>5 are 0.

This means that the sequence s is just all zeroes, which is in the set T and in the enumeration. But according to Cantor's diagonal argument s is not in the set T, which is a contradiction. Therefore set T cannot exist. Or does it just mean Cantor's diagonal argument is bullshit? 37.223.145.160 (talk) 17:06, 27 April 2020 (UTC)

You do not say where 0,0,… is in your enumeration. To them the construction, that is an algorithm producing all 0s, would need to be in T, and your enumeration. Victor Kosko (talk) 13:25, 28 April 2020 (UTC)

The sequence 0,0,0,0,0,... is the last sequence in the enumeration, just like sequence 1,1,1,1,1,... is the first sequence in the enumeration. If you prefer 0,0,0,0,0,.... would be somewhere else, you can just apply a bijection f(x) from natural numbers to natural numbers to shuffle or reverse the order of the enumeration afterwards. 37.223.145.160 (talk) 11:35, 30 April 2020 (UTC)

The enumeration is a sequence - it assigns items of T to natural numbers. But there is no last natural number. If the element (0,0,0,...) of T belongs to the enumeration, it must be at some specific position. But by the definition you gave, at every possible position n there is a sequence whose n-th digit is 1. Hence (0,0,0,...) is at no position in the enumeration. --CiaPan (talk) 15:45, 30 April 2020 (UTC)

By construction, for every sequence in the enumeration with a '1'-digit, there is another sequence in the enumeration where that '1'-digit is a '0'-digit and all other digits in the sequences are the same. So, for the 1,1,1,1,1,... sequence there is also the 0,1,1,1,1,... sequence, and for that 0,1,1,1,1,... sequence there is also the 0,0,1,1,1,... sequence, and for that 0,0,1,1,1,... sequence, there is also the 0,0,0,1,1,... sequence, and so on and so forth until the 0,0,0,0,0,... sequence which has the fewest of '1'-digits, that is, none. Therefore, the 0,0,0,0,0,... sequence is in the enumeration. We can call the position of that 0,0,0,0,0,.... sequence whatever we like. 37.223.145.160 (talk) 16:37, 7 May 2020 (UTC)

But perhaps you are still not in agreement that the way I specify the enumeration includes all the sequences terminating with infinitely repeating 1's as well as those terminating with 0's, especially the 0,0,0,0,0,... sequence. If that's the case, then construct a second enumeration with only the 0,0,0,0,0,... sequence included and then, one by one, like you were doing Cantor's diagonal argument, add every sequence in turn from the first enumeration in-front of the 0,0,0,0,0,... sequence in the new enumeration. Now you have an enumeration which by definition includes the 0,0,0,0,0,... sequence in the last position and the rest proceeds as usual. 37.223.145.160 (talk) 20:23, 7 May 2020 (UTC)

You made two mistakes. Mistake no. 1: there is no last position in any infinite sequence, speciffically there's no last position in your enumeration (a sequence of numeric sequences), because the last position would be a position numbered with the greatest natural number. And we know there is no greatest natural number.

Mistake no.2: after inserting the zeros-only sequence in front of your enumeration, the list begins with:

0 0 0 0 0...

1 1 1 1 1...

0 1 1 1 1...

0 0 1 1 1...

0 0 0 1 1...

so its diagonal is 0 1 1 1 1... and the resulting sequence is 1 0 0 0 0.... Which again is absent in your (new) enumeration. --CiaPan (talk) 21:15, 7 May 2020 (UTC)

How is it a proof of any kind?

So, I enumerate

S_0 = 0 0 1...
S_1 = 1 0 1...
S_2 = 1 1 1...

Then,

S_n = 1 1 0...

And so, how does that prove anything at all? It's pretty obvious S_n will not be in my enumeration because I have not enumerated all the elements from the binary tree. Am I missing something? :-) 197.79.24.8 (talk) 09:09, 20 February 2014 (UTC)

Well, that is kind of the point. You start off assuming that you can list all real numbers (in this case between 0 and 1) and then come up with a number that isn't on the list. That is a contradiction, so the assumption that you can list the real numbers must be wrong.155.95.80.243 (talk) 21:20, 21 February 2014 (UTC)

Simple disproof

Unfortunately Cantor only succeeds in proving that the list is infinite. Given that for any set of binary digits, 2^N integers can be defined, in order to define an infinite number of integers you must of course have an infinite number of digits, since 2^N only approaches infinity as N approaches infinity. Thus the set of integers with a finite number of digits is a finite set.

By ordering the integer representation of the reals from 0-1 as follows

...0000 - 0.0000...
...0001 - 0.1000...
...0010 - 0.0100...
...0010 - 0.0100...
...0011 - 0.1100...
...0100 - 0.0010...
...0101 - 0.1010...

it is readily apparent that any 0-1 real can have its corresponding integer form computed bijectively. The counted reals with a finite number of integer digits are of course sparse in relation to the counted reals with an integer representation with an infinite number of digits. But this should not be surprising, since there are only a finite number of integers with a finite number of digits.

Cantor's s0 argument is therefore reduced to being a disproof by contradiction as to the infinite nature of the list. Once the list is infinite, up to sn, for n at infinity, you can never add another real for s0, because as Cantor shows, that would cause a contradiction. Therefore the list already contains all integer elements in a one to one correspondence with 0-1 reals. --Frederick Bryan 01:13, 3 October 2007 (UTC)

• Every single element in your list contains an infinite amount of trailing zeroes at the end. Surely that doesn't correspond well with all possible sequences of infinite length.69.114.83.91 (talk) 05:49, 11 March 2008 (UTC)
  • The above list of the 0-1 reals in binary format does not only contain elements for infinite trailing zeroes. For instance the element: ...1111 - 0.1111... contains all 1s. Note that the list contains 0-1, exclusive, ie .1111... is the highest represented value. This is of no concern to its validity as a disproof, however, since a disproof over an range is sufficient. --Frederick Bryan (talk) 00:04, 25 August 2008 (UTC)

• Which integer does 0.01010101010101... correspond to? Your chart would say ...1010101010101 but this is not an integer! --Paul Laroque (talk) 20:37, 13 April 2009 (UTC)
  • It would correspond to ...10101010101010. You simply flip the digits over. It's unclear why you would say it's not an integer. Granted, it is a large integer with an infinite number of base-2-representation digits. Frederick Bryan (talk) 17:48, 24 September 2013 (UTC)

• From the common sense, it doesn't seem to be true that in order to define an infinite number of integers one must have an infinite number of digits. 'Infinite' means 'endless': there's no end to enumeration. But every other (enumerated) number does have a finite number of digits just like its predecessor: from time to time, the number of digits n increases by one, but it still has a successor n+1 and is a valid number; the digits can be all enumerated, and the end to enumeration comes when n digits have been enumerated. So, no enumaration of natural numbers, no matter how long, would dig out a number that has infinitely many digits. In fact, such a natural number would be an absurd: called a number, but doesn't have a value. Besides, you couldn't do anything to such a 'number', because you'd have no tools (definition, addition, subtraction, …). The number of the natural numbers is infinite, but the numbers themselves are not (and the lengths of their digit strings are not either). ;) — 178.71.141.48 (talk) 00:00, 20 January 2013 (UTC)
  • That's absurd. The largest integer you've counted to is also the number of integers you've counted. If the number of integers is infinite, then the number you've counted to, to get an infinite number of integers, is also infinite. Most integers therefore have an infinite number of digits. --Frederick Bryan (talk) 17:57, 24 September 2013 (UTC)
    • That doesn't follow. Every integer has a finite number of digits. Sure, you can find an integer with an arbitrarily high number of digits, but no integer has an infinite number of digits. In addition, you don't count to "somewhere" to get an infinite number of integers. There's no point on the number line where it switches from finite to infinite. — Preceding unsigned comment added by 73.189.35.161 (talk) 02:32, 16 July 2014 (UTC)

Other, "Rational" Cantor diagonalizations

Since the title of this article is about Cantor diagonilization, there are other such diagonalization proofs, e.g. to prove that the rationals are countable. Could we include this, please?

Are you sure it was Cantor that came up with that one? -Dan 04:25, 19 December 2005 (UTC)

It isn't a diagonalization proof in the same sense (though a common diagram for it uses diagonals); it doesn't belong here. There are other diagonalization proofs which share essential properties with the Cantor diagonal proof: they include the halting problem argument, standard proofs for Godel's incompleteness theorem and Tarski's theorem on the undefinability of truth, Curry's paradox (and Russell's paradox for that matter). Randall Holmes 21:17, 19 December 2005 (UTC)

Would be Amusing

There is more controversy and personal accusation here on a mathematics page than on some political pages! This all would be amusing if it were not so absurd. We have taught students who could not even imagine the concept of an infinite set, of a limit, or even how to count, nor understand the difference between 2.5 and .25 in decimal arithmetic, no matter who tried to enlighten them. Let alone try to understand successors or mathematical induction. This "discussion" reminds me of those experiences, only the students were polite.

MathStatWoman 18:41, 16 December 2005 (UTC)

Please don't use very long preformatted strings, they force user to scroll horizontally, that's not nice.

A SUGGESTION AND COMMENTS

1. If you have original research to present, please don't present it here. This is wikipedia policy. Wikipedia is not a place for presenting original research. That is what professional journals and publishers are for.

2. If you have mathematical or philosophical objections to Cantorian set theory, please address these in a brief descriptive section of the article itself. However, please do not turn this talk page into a debate hall. It is not our purpose here to endlessly argue over whether Cantorian set theory is "right" at all.

3. If you want to write an article on a more detailed critique, or presentation of previous critiques, or Cantorian set theory, then please create a new article for this purpose. Regardless of the bickering in here, it is an emperical fact that something on the order of 90% or so of working mathematicians accept Cantorian set theory both in theory and in practice, to some extent. (Source: The Mathematical Experience, Davis/Hersh) Thus, this should article should focus on the conventional viewpoint and mention contrary views, but a thorough hashing of intuitionism or constructivism on this topic requires a separate article.

Only 90% of working mathemeticians accept Cantorian set theory? That is not very encouraging! What if the Pythagorean theorem had this same level of support!! —Preceding unsigned comment added by 66.67.96.142 (talk) 18:34, 25 May 2008 (UTC)

Yeah this just keeps going.

Sorry for being anonymous, just don't know how to get a user name here.

Nobody could argue with the proof itself.. it's just what it means.

I have two problems with the results cantor got.. one naive and one not so el.

1: as many times as you like means just that,yeah it's clear that in mathematics cantor's proofs are solid as a rock.. but still... you wonder if maths is proving a result like this then is it completely right?

2: a more technical point.. i've looked at a few of his original proofs and at some stage they all involve a function with an infinite amount of arguments, either directly or in reasoning. I'm not saying it's a wrong thing to do... not an expert, but i just don't see how the result of such a function can be claimed to be well defined. In the proofing steps the results of these functions are '1' or true.

Anyway that's it.. and if that's what maths says re cantor is correct that's what it says.

I just know it's wrong, if maths can make infinity prove the things it does.. then it isn't using infinity.

J.

Apoorv1's arguments

The following shows the vulnerability of cantor,s proof.

We consider a list of decimals L*={a1,a2,a3. . aw}, where aw is the limit of the seq. a1,a2,a3. . ,all ai's assumed to be different. The partial diagonals are D1,D2,D3,...and correspond to a1, a2,a3 and so on. The diagonal D* itself corresponds to aw. Thus, the existence of D* is based on the inclusion of aw in the list L*. It is also clear that D* is not equal to any of the ai (i in N). However, D* necessarily differs from aw only in the w-th place and hence may be equal to it.

Now, if the list L* is defined, then so is the list L=L*-{aw}. Corresponding to this list is a diagonal D. (This is the usual list and the usual diagonal). Now, D cannot correspond to any of the ai's(i is in N).Then, by the uniqueness of limit of the seq. D1,D2,D3. . ,D must be equal to D*. But this means that aw is in the list L.

Hence, neither the list L nor the list L* are well defined. That also means that the diagonal D or D* are also not well defined.

[apoorv1]

I don't understand why people insist on writing stuff like the above. First it says aw is the limit, but there's no reason given to think there is any limit: most sequences do not converge to any limit. Then it refers to the wth position. What position is that? Every position in the list occurs after only a finite number of steps, and others come after it. Which of those finite positions is this one? And why in the world should the limit correspond in any way to anything involving the diagonal? No explanation is given. Would the author of the above please try honesty for a change? If you have questions about mathematics, ask someone who knows. Michael Hardy 21:25, 26 August 2005 (UTC)

Mike, you would agree that Cantor’s argument is applicable to any list of reals. We can select a list, which does converge to a limit. For example, the list L* could be,

a1=0.01101010. . ., a2=0.11101010. . ., a3=0.10001010. . ., a4=0.101110101. . ., . . . aw=0.10101010.. . . (read w as omega). Each of the ai’s differs from 0.101010. . .,only in the i th place. Then, this sequence would converge to aw=0.101010. . . Further, each finite partial list can result in only a finite partial diagonal. The completed infinite diagonal can result only if the limit aw is included in the list. As is clear, this diagonal is equal to aw. Now, if the list L* exists, then so does L=L*-{aw}.If so, it would be the immediate predecessor of the list L*, and allow us to define the immediate predecessor of the limit ordinal w ! It is this (not well defined)list L and the corresponding diagonal that form the basis of the diagonal proof. I also believed in Cantor’s theory for thirty years. Now, I have doubts. [Apoorv1].

Your argument is full of mistakes. You say we can select a list that does converge. So what? The point is to show that ALL lists, not just the ones that converge, fail to enumerate all reals. And it's trivial to show that a convergent sequence of reals cannot enumerate all reals, without any sort of diagonal argument. You propose to delete "aw" from your list. But "aw" is never in any finite position in your list in the first place; you've just appended it at the end. The argument is supposed to be about lists in which each entry is in some finite position. Moreover, a "list" containing one entry in each finite position and then an ω^th entry would correspond to the ordinal ω + 1, not to ω. Michael Hardy 22:55, 28 August 2005 (UTC)

Mike,you have made three observations.I deal with the second and third observations first. Let’s look at this table

ordinal------1---------2---------3--------. . .(w-1)?------------w

mem. list----a1--------a2--------a3------. . .???-----------aw

partlist-----a1-------a1a2-----a1a2a3--. . .a1a2a3.??---a1a2a3. . aw

diagonal------d1-------d2-------d3-------. ..D???-----------D*

(pardon the poor formatting).

It is clear that aw does not correspond to any finite ordinal. Moreover, it is the first member of the list that does not so correspond to a finite ordinal. Since w is the first infinite ordinal, aw corresponds to w. We also have the correspondence between the members aj in row 2 and the partial lists a1a2. . aj (comprising of that member and all members preceding it) as shown in row 3. It is clear then that the diagonal D* and the diagonal D are both equal (being in the w and (w-1)th position in the seq. of partial diagonals), although they correspond to the two (supposedly)distinct lists L* and L.

Re. Your first observation, the idea is to show that the diagonal method does not necessarily lead to a member not in the list. The convergence of the seq ai, is not essential to the demonstration; the essential point is that the lists a1,a2,a3. . . and a1,a2,a3. . aw (aw being any number) can be shown to correspond to ordinals (w-1) and w.

[Apoorv1]

I guess this is your major error:

"The completed infinite diagonal can result only if the limit aw is included in the list."

In an infinite sequence there is no last element, so you can not talk about removing the last one from L* and calling L a predecessor in the sense of finite partial lists - note that neither L nor L* are finite. I hope I got you right - could you please explain the term completed infinity? Misza13 18:39:42, 2005-08-27 (UTC)

Oh, and by the way - what's a list? I've heard of sets and sequences, but lists? Could you define it, please? 'Cause I'm afraid you consider it as something in between these two and thus not properly defined. Misza13 12:47:50, 2005-08-28 (UTC)

Misza,my comments above refer. [Apoorv1]

All right, let's say I can live through your "lists" (still not formally defined?) up to the point where you construct diagonals out of "partlists". BUT! Now comes the big one - D*. Being a diagonal it is supposed to be a real number. But in your "proof" it seems to be an infinite sequence of digits followed by a single digit. Hey, this is not a real number at all. But even then, which digit would that be (the last one)? If you say the $\infty$-th (infinieth? ;-) digit of $a_{\omega }$ then you're in trouble, 'cause $a_{\omega }$ doesn't have such. So what is D* then? Misza13 11:41:48, 2005-08-30 (UTC)

Misza,the interpretation of D* is a subsidiary issue;the essential point is that the partial lists (or the corresponding diagonals) can be interpreted as a representation of the ordinals, and this representation allows an immediate predecessor of the limit ordinal w to be defined. [Apoorv1]

I think I know where's your error. I asked you to define those "lists" and "partlists" for a reason. Without proper mathematical definitions you can prove anything. Try defining a list properly and then rewrite the table above - I'm especially interested in the "partlist" row. I don't know what are the last two elements in it are they finite? What do those .'s and ?'s mean there. Please be pedantic in mathematics - it's much harder to make errors then. From what I see right now is that $L=(a_{1},a_{2},a_{3},...)$ corresponds to $\omega$ and $L*=(a_{1},a_{2},a_{3},...,a_{\omega })$ corresponds to $\omega +1$ and thus has a predecessor - and everything's fine. Misza13 17:42:11, 2005-09-01 (UTC)

Misza, As to the interpretation of the partlists, you can take them to be sets. The correspondence given in the table is clear:1--a1--{a1},2--a2--{a1,a2},and so on till,w--aw--{a1,a2...aw}.For every ordinal counted, you push the corresponding a into the list/set.As you count w ,you push aw into the list/set.So why do you say that L corresponds to w and L* corresponds to (w+1)? [Apoorv1]

The problem is in the words "and so on till". Let's say your algorithm begins with an empty set and the starts adding $a_{1},a_{2},a_{3}$ and so on to it. But it will never cease doing so and thus will never arrive at the step "push $a_{\omega }$ to the set". You used the words "As you count $\omega$..." but here's the catch - the ordinal numbers are uncountable! Every finite ordinal will be counted, but $\omega$ will not. A side note: the set $L^{*}=\bigcup _{i=1}^{\infty }\{a_{i}\}\cup \{a_{\omega }\}$ with the order $a_{i}<a_{j}\iff i<j$ where i,j are ordinals corresponds to the ordinal $\omega +1$. Misza13 10:40:41, 2005-09-03 (UTC)

Misza, you say that I will never be able to push aw into the list.At the same time you define L to be the infinite union a1Ua2Ua3...Is this union also equal to ... [[[{a1}U{a2}]U{a3}]U{a4}]...?That is,is the infinite union the same as what is obtained by successive pairwise unions? [Apoorv]

The infinite union (like any union) is the set of all elements of the unioned sets: $L=\bigcup _{i=1}^{\infty }\{a_{i}\}:=\{x:\exists _{i}x=a_{i}\}$.

The expression $(((a_{1}\cup a_{2})\cup a_{3})\cup a_{4})\ldots$ is a bit informal to me (but that's just me). Nevertheless, yes it's the same thing because every element of L will be added (soooner or later but will be). However, if you say that after all of them you want add one more element then you're wrong - you'll never get to $a_{\omega }$ because all the previous ones will take you literally eternity to add. Misza13 10:27, 13 September 2005 (UTC)

Misza,Are we saying that the set ...((((a1Ua2)Ua3)Ua3)Ua4)...does not exist but the indexed union U{ai:i€N} exists?We could express L in this form because we used N as the index set. What about N itself? N is the smallest inductive set closed under the successor operation.So, N is {1}U{2}U{3}. . .We cannot write N as U{i:i€N} as it would be an obviously circular definition.If N ={1}U{2}U{3}... does not take an eternity to add, then why should L=a1Ua2Ua3...? [Apoorv1]

We are not saying. You are. I only said that writing unions this way is a bit informal to me. Similarly, I prefer writing series as one expression under a big sigma (where every element of the series is given explicitly) instead of guessing what do those 3 suspension dots mean - guess the next symbol is more appropriate in an IQ test. ;-)

I.e. I prefer the left side of this, although I don't say that the right one is wrong (because it is right ;-p ): $\sum _{i=1}^{\infty }{\frac {1}{2^{n}}}=1={\frac {1}{2}}+{\frac {1}{4}}+{\frac {1}{8}}+\ldots$

But that's a side note that doesn't have anything to do with eternity. Again, I didn't say that N={1}U{2}U{3}U... doesn't take eternity to add. Please stop putting words in my mouth... erm... under my pen... under my fingers... whatever - just don't. And reconsider this:

Plan for today:

1. Count all natural numbers.

2. Do something else.

And tell me, how on earth do you think you will ever arrive at point 2? Misza13 09:40, 14 September 2005 (UTC)

BC's stuff

[I moved BC's stuff to its own section, it didnt seem to be part of the flow - William M. Connolley 08:55:06, 2005-09-07 (UTC)]

With the domain of r changed to the closed unit interval [0,1] <instead of the open unit interval (0,1)>, the Cantor's diagonal argument presented is fatally flawed ab initio because the two endpoints 0 (0.000...) and 1 (0.111... in binary system) are anti-diagonal numbers of each other --- that is, their presence refute Cantor's diagonal argument from the beginning. If you claim that both all 0's and all 1's as diagonal terms is not possible for row-listing all the real numbwrs, then you have already excluded two real numbers 0 and 1 from your domain without even applying Cantor's diagonal argument. Thus, Cantor's diagonal proof is typically presented with (0,1) as the domain of r.

Dunno really what you're saying here. Why is 0.0000... so different from 0.1000... or 0.010000...? William M. Connolley 08:55:06, 2005-09-07 (UTC).

In the row-listing of real numbers, the diagonal digits form an _inherent list inclusion and imposition of order_ condition on the row-listed numbers [once you understand this, you will comprehend the intrinsic self-contradiction in Cantor's diagonal argument -- that is, the anti-diagonal number is _indubitably excluded_ by the very nature of the row-listing -- in plain words, however one specifies the list inclusion and imposition of order on the real numbers to be row-listed, it redounds to the condition that for every row-listed number, its column-digit at the row-number position (that is, diagonal digit) is _that digit_ so the anti-diagonal number is evidently excluded being different digit-for-digit diagonally from the row-listed numbers -- that is, it does not satisfy the row-listing specification so it cannot be included in the row-list in the first place] -- thus, the row-listing condition of all 0s intrinsically excludes the number with all 1s for its digits (and vice versa). This is a fact that refutes Cantor's diagonal argument ab initio -- taking it as a counter-example -- so, the common domain for Cantor's diagonal argument is (0,1). In plain words, a list inclusion and imposition of order condition for row-listing real numbers that redounds to having 0s in all the diagonal position excludes 1 (0.111...) [and vice versa] even without applying Cantor's diagonal argument. It must also be emphasized that Cantor's diagonal argument presupposes that row-listing of all the fractional numbers in the enumeration form r1, r2,r3,... is possible (so one can deny it in the reductio ad absurdum argument) -- so this entails a list inclusion and imposition of order for uniquely row-listing the fractional real numbers. It is the very fact that whatever list inclusion and imposition of order for the row-listing you specify initially, it is tantamount to specifying that the diagonal digits are as they are so the anti-diagonal number is excluded ab initio without the need for Cantor's diagonal argument. This discussion would now lead to the antinomies of vacuous truth, material implication, and Frege's logic. Briefly, my position on this issue is that modern mathematics is suffering from a _foundational crisis_ because of the imprudent relegation of Aristotle's three "laws of thought" (principles of identity, non-contradiction, and excluded middle) as mere theorem's in Frege's to Russell's to Hilbert's to Godel's systems (that is, the former first principles are derivable from "more primitive" axioms by the latter's systems) as well as the fashionable supplanting of Aristotle's "potential infinity" by Cantor's "actual infinity". I summarize all of these in one word -- antinomy or self-contradiction. "Modern" mathematics supports "vacuous truths" (for examples: with truth-functional material implication, both ~P -> Q as well as ~P -> ~Q are true; with set theory, the empty set is an element of the power set of any given set as well as the power set of the given set's complement set -- these make logic and set theory inherently inconsistent) and also "unrealizable falsities" (for example: 100 meter dash in 1 second, completed infinite set, etc.). Aristotle's first principle of non-contradiction bars self-contradiction ab initio -- that is, as long as you don't apply, say ~P -> Q and ~P -> ~Q, AT THE SAME TIME IN THE SAME RESPECT (which is tantamount to ~P <-> P by contraposition (by Karl Popper, contraposition is also a first principle since it checks infinite regression of reasoning) of the second, a self-contradiction), then everything is fine in "modern" mathematics. I have documented that most of the crisis in modern mathematics is brought on by a self-contradiction (Note: Cantor's diagonal argument is a self-contradiction!). Godel's incompleteness theorems which uses self-contradictory proposition ("This statment cannot be proved" --- yet Godel went ahead and "proved" that "it cannot be proved") are untenable ab initio (one cannot use reductio ad absurdum argument to prove or disprove a self-contradictory proposition) but even in theoretical computer science and artificial intelligence -- with the P vs NP problem which involve the self-contradiction in "polynomial" and "exponential" "computational complexity" considering that, by the binomial theorem, 2**n is equal to 1 + n + n(n-1)/2 + . . . + n(n-1)/2 + n + 1 ... (([BenCawaling@Yahoo.com (13 Sep 2005)]

Cantor's diagonal argument does not also work for fractional rational numbers because the "anti-diagonal real number" is indeed a fractional irrational number --- hence, the presence of the prefix fractional expansion point is not a consequence nor a valid justification for the argument that Cantor's diagonal argument does not work on integers.

In Cantor's diagonal argument, the Cantorians make a humungous deal of the sole "excluded real number" limit point (with their insistence on the standard enumeration form r1, r2, r3, ...) of a countably infinite sequence of _rational_ numbers. However, with their insistence on the open interval (0,1) [0 < r < 1] as their domain of argument (I have already noted earlier my objection to this article's use of the closed unit interval as domain), they do not seem able to appreciate that they are already excluding the 2 endpoints (0 = 0.000...) and (1 = 0.111... in binary system) of an interval (is there really an interval with no endpoints?). Anyway, the prefix fractional expansion point is a consequence of the open unit interval (0,1) and it is untenably used as a justification for Cantor's diagonal argument that already excludes the endpoints 0 and 1 --- which are known ab initio to be anti-diagonal real numbers of each other.

The open unit interval is often defended by invoking their essence as a _set_ [the closed unit interval set less 2 elements]. No logical contradiction arises from this "definition". However, what is being assailed in Cantor's diagonal argument is its claim of "uncountability" of the open unit interval whose "anti-diagonal real number" is untenably justified merely by the prefix fractional expansion point --- in other words, the same Cantor's diagonal argument does not apply to the closed unit interval with its known anti-diagonal endpoints.

The contextual diference issue of 0.r1r2r3.... as a _variable_ or an _arbitrary constant_ (that is, the r's as just place-value holders ("the form") for the fractional expansion digits ("the substance") of a _real_ number) --- one that only _possibly_ _represents_ a real number but may _actually_ _not_ be a true fractional real number such as square root of 2, or pi, or e --- is another concern that is relevant here. In plain words, it is not correct to take a representation such as 0.r1r2r3... as a _real_ number just because of its prefixed fractional expansion point. [BenCawaling@Yahoo.com (6 SEP 2005)]

I don't understand your objection to 0.r1r2r3r4r5... being a real number. 0.r1, 0.r1r2, 0.r1r2r3, 0.r1r2r3r4, ..., provably converges to a real number. What is your problem with that? William M. Connolley 08:55:06, 2005-09-07 (UTC).

First, is it a real number point or an _interval_? If you claim it to be the former, you _must_ also accept its having a digit at the omegath position ...

Second, the supposed enumeration r1,r2,r3,... must row-list the fractional real numbers _uniquely_ and _exhaustively_ --- any list inclusion and imposition of order on the row-listing redounds to the specification that the nth digit of the nth row-listed number must be rnn (that is, the diagonal digits) so the anti-diagonal is indubitably not included in the row-listed "real numbers" (or intervals?) . . .

Cantor's anti-diagonal number, Borel's number, Chaitin's number, etc. are _not_ real numbers -- just as 0.r1r2r3... is not a real number -- on the other hand, 5, 1.25, square root of 2, pi, e, are real numbers -- they have well-defned expansion digits ... every mathematical object (as any other object) has both _substance_ and _form_ ... in plain words, everyone in the mathematical world agree that, say, the 5th decimal digit of pi-3 is 9 --- on the other hand, what is the 5th decimal digit of Cantor's anti-diagonal number (or Borel's number, or Chaitin's number)? --- well, it _varies_ from individual to tindividual so it is a variable, or at best, an arbitrary constant, whose claim for being a "real number" merely emanates from the prefixed decimal expansion point.

[BenCawaling@Yahoo.com (13 Sep 2005)]

Yet another rant

All the nonsense of Cantors Diagonal Method derives from his contradictory claim to be able to conceive of the INFINITE list of all infinite decimal sequences as of a COMPLETE LIST! Haven’t we learned that ‘omega+1 = omega’! He was tremendously overestimating his own mental capacities (his first step in direction of the asylum!). Cantors brain was just as finite as are ours today with no space for infinite lists. To demonstrate his diagonal argument on a small finite list of finite sequences is just a lousy trick to cheat the uncritical reader into accepting ‘Cantors Paradise of higher Infinities’ (Hilbert) as a new field of mathematics. Nobody is capable of ‘giving’ any real number in the form of an infinite decimal sequence instead of by presenting an algorithm that allows to determine as many of its decimals as any one desires. But these algorithms may lexicographically be ordered, so they are countable!

Thaks so much to you (I guess it is Mr William M CONNOLLY !? [Its Dr to you; and try to learn how to spell - William M. Connolley 15:50, 10 October 2005 (UTC)])for calling this a RANT! So I add the following proof:

For all thouse who still won’t believe it: every mathematician should be familiar with the definition of real numbers as ‘Dedekind cuts’. On page 22 of ‘Das Kontinuum’ by Hermann Weyl (1918) we read: ‘under a real number @ (read : alpha) we understand the set of all rational numbers which are smaller than @’ ! This definition (apart from it’s nonsensical selfreference!) implies that the smallest possible difference between two real numbers @’ and @" is the one rational number that belongs to @" but not to @’. So there can impossibly exist more different real numbers than there are rational ones! And certainly no @ can be ‘given’ unless by an algorithm out of the above mentioned lexicographically ordered list. Dr.Eginhart Biedermann 28.9.2005 --195.23.195.43 09:56, 28 September 2005 (UTC)

If you're going to write stuff like a lousy trick to cheat the uncritical reader then get used to accusations of ranting. The reals can be defined as dedekind cuts, but they can also be defined in other ways. Sequences, which are roughly decimal expansions, is another valid way. I don't understand why you consider the defn of cuts about as selfreferential. I also don't understand why you think the above is a proof: by your understanding of cuts, every real is also a rational; clearly this is false. William M. Connolley 15:17, 28 September 2005 (UTC).Sorry Sir, I could’nt know about your Dr.- title. [Indeed not. And had you not "Mr"'d me unnecessarily, you wouldn't have been corrected. WMC is fine William M. Connolley 19:07, 13 October 2005 (UTC)]

As to your remarks:

• From my ‘RANT’ you may easily derive that I am well familiar with the definition of real numbers as ‘sequencies’ as ‘decimal expansions’, more precisely, I insist, as never ending sequencies, as decimal expansions that cannot be defined other than by algorithms that allow the determination of as many decimals as any one desires, yet never coming to an end. You need not waste your time on telling me that.
• The definition of a real number as a Dedekind-cut is selfreferent since it defines (tries to define !) @ by @ ! And it is nonsensical, selfcontradictory since it defines @ not to be @ itself but the set of all rationals smaller than @ , with the effect that, @ being by chance a rational number, it is claimed not to be this rational number but the set of all smaller ones !
  • If you think this, you are firmly on "original research" grounds. You cannot edit wikipedia on this basis. William M. Connolley 19:07, 13 October 2005 (UTC).
• You claim that by MY understanding of cuts every real would be a rational. Sorry, I stick to the Dedekind-Weyl wording that every real is the set of all the (infinitely many!) rationals smaller than that real. What makes you come to your contrary claim?
  • Your So there can impossibly exist more different real numbers than there are rational ones
• On the basis of what consideration do you question my argument that the definition of the reals on the basis of the rationals, with the smallest possible difference between two reals being one single rational, prooves that there cannot be more reals than rationals ?

Biedermann 12:04, 13 October 2005 (UTC)

This is basically a waste of time. You need a good basic book, and a tutor. Or perhaps you could read the wiki dedekind cut page. William M. Connolley 19:07, 13 October 2005 (UTC).

21.10.2005 Biedermann 11:31, 21 October 2005 (UTC)

• Well then, just for the fun of it, I will ‘waste’ some more minutes on this subject.
• First of all: thanks a lot, W.M.C., for your kind textbook advice. Yet that leaves me with the question: which tutors and textbooks were it that may have taught you a lot of ‘shape of the earth thinking’, but apparently failed to teach you to SEE what is right before your eyes: else you would not have had to ask me for an explanation of the selfreference in a definition of the kind a = a  ! For anything so near at sight the ‘flat-earth’ concept is perfectly adequate! And what on earth could be more flat-earthly than the Wiki-exposition of the Diagonal Argument?
• Certainly, your Dedekind-cut definition of the square root of 2 looks much nicer than the Weyl-wording to which I took reference. Yet it can serve as example only for those coutably many reals that are defined by some algorithm!
• If you question what seems to me to be selfevident, i.e. defining the reals on the basis of the countably many rationals can impossibly yield uncountably many more reals, I would like to see a convincing proof for this claim.
• Finally, Im am glad to realize that calling my RANT a RANT did not disprove any of my arguments.
  • In any case, I wish you and all the Cantor fans much fun in your paradise of ever higher infinities, where Cantor even believed to find a proof for the existence of GOD, before entering the asylum.

Biedermann 11:31, 21 October 2005 (UTC)

... or consider the number of generators (re infinite sets)

Possibly here: "constructible" is equivalent to "countable";-)

Cantor's uncountable reals R on [0,1) are an abstract concept, shown to not be (Peano-) 'countable', via his diagonal argument.

They are hardly 'numbers' in the realistic/computable sense, but abstract entities satisfying certain arithmetic-like syntax rules. So they rather belong to the broad category of 'languages & data structures'. AFAIK considering them as 'elements', or 'real numbers', on a linear number-line breeds at lot of confusion.

Not so much their cardinality ('amount' of reals;-) but their generation in a closed system R(+,*) with arithmetic & sequencing properties distinquishes them from Peano's naturals N(+) with one generator: 1 under (+), eqv. to iterating the 'successor FUNCTION'...

This is not true for the reals R on [0,1) -- which map into Z! , the 2-generator group of all permutations of the integers Z.

These again map into the 3-generator semigroup Z^Z of all transformations of Z = all FUNCTIONS: Z --> Z (closing the Peano circle;-)

- NB - http://home.iae.nl/users/benschop/cantor.htm

http://home.iae.nl/users/benschop/ism.htm

http://home.iae.nl/users/benschop/func.htm

Nico Benschop 13-dec-2005

Self-contradiction in “proof by contradiction”

One of the “absorption laws” of propositional logic or statement calculus is: (P --> (Q AND R)) <--> ((P --> Q) AND (P --> R)). Thus, (P --> (Q AND ~Q)) <--> ((P --> Q) AND (P --> ~Q)).

The formal argument in the “proof” of general Cantor’s theorem can be summarized as follows ---

If there is a 1:1 correspondence between S and P(S), then the generator of T is in T. [1]

If there is a 1:1 correspondence between S and P(S), then the generator of T is not in T. [2]

Therefore, there is no 1:1 correspondence between S and P(S).

The conclusion follows from the “belief” that propositions [1] and [2] are contradictory. It might be argued that the conclusion follows from the contradiction “the generator of T is in T” AND “the generator of T is not in T”. However, the “absorption law” equivalence could not be discounted — that is, the latter contradiction claim also asserts the former “contradiction” claim. Moreover, it is the claims P --> Q and P --> ~Q that are separately demonstrated in this type of “proof by contradiction” and not the claim P --> (Q AND ~Q).

The following discussion by Alice Ambrose and Morris Lazerowitz in their book entitled “Fundamentals of Symbolic Logic” (New York: Holt, Rinehart and Winston; 1962) is enlightening in pointing out the logical defect in the preceding Cantor’s reasoning ---

Any two propositions of ordinary discourse are related in one of the seven ways described (pages 85 – 92) [equivalence, superimplication, subalteration, subcontrariety, contrariety, contradiction, and logical independence]. Failure to understand their relationships is responsible for many of the fallacies in reasoning. For example, contradictories and contraries, contraries and subcontraries, are frequently confused, and propositions are sometimes supposed to be equivalent when they are not.

As an illustration of a further logical relation commonly confused, take the two propositions ---

If it rains, the crops will be good. [1]

If it rains, the crops will not be good. [2]

It might be supposed that these two propositions could not both be true, and that, hence, a person who made both these statements would be uttering an inconsistency. One needs merely to note that both propositions are true under the condition that it does not rain, to see that they are consistent with each other, and that therefore the supposition of their inconsistency is a mistake. These propositions are subcontraries.

In symbolic logic, both Georg Cantor’s argument as well as Alice Ambrose and Morris Lazerowitz’s example are of the form: P --> Q and P --> ~Q. Moreover, ((P --> Q) AND (P --> ~Q)) --> ~P is a tautology --- it is a flawed (particularly when there is no relevant relation between P and Q) variant of “proof by contradiction”.

By the very definition of material implication, both P --> Q and P --> ~Q are true at the same time when P is false (regardless of the presence or absence of material relevance of the antecedent P to the consequent Q or ~Q) — so, invoking that these 2 propositional forms are inconsistent with each other is indeed preposterous. It might be argued (in fact, as guaranteed by the tautology scheme cited above) that the simultaneous truth of these two propositions _implies_ the falsity of the antecedent P. What I am counter-arguing is that they are _defined_ to be so — that is, it is a gross self-contradiction to call upon a definition to rationalize an argument. However, I reiterate that, as presented, the flaw in Cantor’s argument is in the false belief that [1] and [2] are contradictories (that is, when 2 propositions cannot both be true or both be false at the same time or that their conjunction is always false for all truth-value assignments to their atomic formulas or prime constituents).

Georg Cantor inferred his conclusion without regard for the material or factual truth of his two implication premises. In the simpler-to-analyze example by Ambrose and Lazerowitz on the “rain” and “good crops” relation, we can easily see that both the given implication-premises lack material truth:

There are countless of actual true-to-life circumstances whereby either “the crops will be good” or “the crops will not be good” is true without their truth being a direct consequence of the truth or falsity of “it rains”.

On the other hand, if “it rains” adequately only then “the crops will be good” is true while if “it rains” exceedingly hard so that flooding occurs then “the crops will not be good” is also true.

Ambrose and Lazerowitz expounded on the issue of escaping commitment to the conclusion of an inference which is also particularly relevant in pointing out the flaw in Cantor’s line of reasoning ---

It is to be noted that whenever an inference is made, not only is an implication asserted to hold between premises and conclusion, but both premises and the conclusion are asserted to be true [it is emphasized that modus ponens ((P --> Q) AND P) --> Q is a tautology]. Both these facts are relevant to a consideration of the means of escaping commitment to the truth of an inferred conclusion. There are, in general, two ways of doing this. One way is to deny that the implication holds. This amounts to pointing out that the argument is formally invalid. The second way is to take exception to the material truth of the asserted premises; that is, either to refuse to agree to the initial assumptions or to point out their actual falsity. The relevance of denying the truth of the premises depends upon a logical fact about the relation between the antecedent and consequent of any implication when the antecedent is false.

Consider the argument ---

If it rains, it pours.

It is raining.

Therefore, it is pouring.

This asserts, in part, that if the first two propositions are true then “It is pouring” must be true. Suppose now that either the implicative proposition “If it rains, it pours” is false or that “It is raining” is false. The conjunction of the two is in either case false. . . . the falsity of the antecedent (P --> Q) AND P is consistent with the falsity of Q as well as with its truth; hence, the truth of Q does not follow from the falsity of (P --> Q) AND P.

The function ~((P --> Q) AND P) --> Q is not tautologous --- the truth-value of Q is not uniquely determined by ~((P --> Q) AND P). In general, if one denies the material truth of the premises or refuses to assent to it, there is no logical necessity of assenting to the truth of the conclusion.

Applying Ambrose and Lazerowitz’s well-informed logical declarations to Georg Cantor’s alleged ”proof” of his hierarchy-of-infinite-power-sets theorem, it is easily seen that Georg Cantor’s argument is not a valid application of “proof by contradiction” deduction — we firmly deny the material truth of its implication premises or we refuse to assent to them on the ground that T [the set of all the elements of the infinite set S which are not contained in their respective images for the presumed one-to-one correspondence between S and its power set P(S)] is not really a completely constructible set (as defined, T is an indeterminate infinite set) or the contradiction with regard to the generator of T occurs only if we look at T as a completed totality of an infinite set.

The simultaneous truth of P --> Q and P --> ~Q when P is false are embodied in the definition of modern Fregean logic’s material implication (regardless of the presence or absence of material relevance of the antecedent P to the consequent Q or ~Q) --- so, it is a gross self-contradiction to call upon some definition (which cannot be contradicted) to rationalize a faulty alleged “proof by contradiction” argument. Furthermore, because both P --> Q and P --> ~Q are defined true when P is false, then they do not form a contradiction. The self-contradiction is in invoking that they form a contradiction in spite of the concerted efforts by present-day logicians justifying the modern meaning of material implication that they do not.

It might be argued that the defect is merely in the nomenclature “proof by contradiction” which could be immediately remedied by just dropping the “contradiction” reference to the argumentation. However, it is stressed that this is not simply the case --- rather, it is the abandonment by modern Fregean logic of the existential import of the universal quantifier that jettisoned such relations as subcontraries and left only contradiction relations in the traditional so-called Aristotle’s “square of opposition” (relating “All S is P”, “No S is P”, “Some S is P”, “Some S is not P”) --- the sides (contrariety, subcontrariety, superimplication, and subalternation) are discarded while the diagonal (contradiction) is retained.

In other words, in the classical Aristotlean logic, “All S is P” (also expressible as “No S is non-P”) and “No S is P” (also expressible as “All S is non-P”) implies the existence of S. With the Fregean logic interpretation dropping the existential import of a universal quantifier (cajoled by the seeming simplification offered by adhering to a Boolean algebra implementation), comes the definition of material implication with P --> Q and P --> ~Q being both true when P is false without any regard for any factual relevance relating the antecedent P and the consequent Q or ~Q. As a consequence, in modern Fregean logic, “it will be necessary to accept what at first sight is paradoxical” --- for example, “both ‘All leprechauns are bearded’ [which can also be stated as “No leprechauns are not bearded”] and ‘No leprechauns are bearded’ [which can also be expressed as “All leprechauns are not bearded”] will be counted true, given the circumstance that there are no leprechauns” [Ambrose and Lazerowitz].

Scientific theories rigorously observe the Aristotlean logic’s implied existential import of the universal quantifier so they are successfully applied in practice. In Fregean predicate logic, the formula (For all)vP --> (There exist)vP is a generally accepted theorem which makes explicit what was implicit in Aristotlean logic. However, the rationalization for defining material implication to be true whenever the antecedent is false had already been forgotten --- hence, the hidden self-contradiction (in the example cited about leprechauns, the apparent contradiction is easily seen when the statements with the same quantifier are compared).

It is noted that every model for a first-order theory is prescribed to have a non-empty domain. It is also stressed that any specification of a self-contradiction serves to define an empty set.

Related as “vacuous truths” to logic’s material implication “paradox” is the inherent “paradox” in set theory --- if the empty set is an element of any set’s power set (or a subset of any set), then the empty set is also an element of the power set of the given set’s complement set (or a subset of the given set’s complement set) --- thus, the set of all subsets of a given set and the set of all subsets of its complement set are not mutually exclusive despite the fact that their intersection set contains the empty set (this means a hierarchical level of interpretation for the supposedly unique empty set). In the present case, the self-contradiction is in discarding the existential import of the universal quantifier while giving existential attribute to the empty set — that is, the empty set has cardinal number 0 while the set that contains the empty set has cardinal number 1.

This engenders positive motivation for formulating some set theory based on the primitive concepts “set” and “subset” by considering power sets or sets of subsets instead of sets of individual elements (that is, {a} instead of just a) — the isomorphism with the incompletable set of all natural numbers whose every element has a successor is evident from the fact that every subset implies a superset. Thus, paradoxes involving the comparison of the sizes of two distinct sets with respect to “one being a subset of the other” and “one-to-one correspondence of their respective individual elements” would be mooted ab initio — that is, there will be no “uncountable set” unless the latter signifies “every subset (or, element) always has a superset (or, successor element)” or “not a completeable set”.

Every semantic paradox has its analog in set theory, and every set theory paradox has its semantic analog --- that is, every truth-value statement can be rephrased as a statement about sets, and vice versa. The liar-paradox assertion --- “This statement is false” --- can be translated into --- “This statement is a member of the set of all false statements”. The correlation with the completed infinite set self-contradiction is evident — that is, the countably infinite set of all false statements cannot be truly completed. Also, the more basic association with the general inexpressibility of the negation of a countably infinite whole (that is, “the set of all false statements” as the negative of “the set of all true statements”) in terms of its elements and their negatives (that is, the truth or falsity of every statement) is equally manifest. It is further stressed that the assertion “This statement is an element of the set of all true statements” is not a self-contradiction.

The preceding discussion is simply stated in symbolic logic. The truth of a countably infinite disjunction P1 OR P2 OR P3 OR … could be simply established by the truth of just one of its variables even though the latter are countably infinite; however, the truth of a negated countably infinite disjunction ~( P1 OR P2  OR P3 …) = ~P1 AND ~P2 AND ~P3 … could only be ascertained from the truth of all of its negated variables which might be impossible to establish for a domain with countably infinite number of elements.

This provides a very simple proof for Godel’s incompleteness theorem (the relevance of the encompassed natural number system is clear). Please read my discussion text in the Wikipedia article “Godel’s Incompleteness Theorems”. [BenCawaling@Yahoo.com --- 10 February 2006]

A layperson's objection to Cantor's proof

I have a question and possible objection to Cantor's diagonal proof. I am not a mathematician, so please don't jump on me if there are technical errors in how I express this.

To the best of my understanding, the basic idea of the diagonal proof is this. Make a list that you imagine to contain all the real numbers between 0 and 1. Then it is always possible to construct a number not on that list by defining the constructed number to differ from the first number in the frst decimal place, from the second number in the second decimal place, and so on. It may simplify thinking about the argument to specify that all the numbers are expressed in binary. That will insure that for any given list, one and only one number can be constructed using Cantor's method.

Now let's make our list and construct our "Cantor number".

Now here's the slick trick. Create a second auxilary list, call it "Extras" (or whatever). Place the newly constructed number on that list. Now if we combine the original list with the "extra" list, we have a list that contains precisely the number that was suposedly "not on the (original) list".

But there's an obvious objection. We now have a new list that is subject anew to the diagonalization process. We can still create a number not on the new list.

No problem. Just put that number as the second entry in the "extra" list, recombine the extra and original lists, and you have a new list. Sure you can now construct another number not on the list. And I can put it on the list. For as long as you can construct numbers not on the newest list, I can put those numbers on a newer list.

Maybe I missed something obvious, but this process looks a lot like enumeration to me. I would suggest that far from proving that the reals cannot be enumerated, Cantor in fact provided precisely the method for enumerating them.

I'm sure that the overwhelming majority of mathematicians here who accept Cantor's proof will see flaws in this argument, but I would be very interested to know what they might be. I have thought about it a lot, and I can't see any obvious objection.

Although, there is one possible question that occurs to me, but I don't know enough to answer it. It can be objected that we are not actually enumerating "all" the reals in the specified interval, because even if we construct diagonal numbers and amend our list "forever", there would be reals that would never show up on the list. If so, this would disprove my argument. But is it so?

Comments invited -Steve

69.209.148.136 01:10, 24 May 2006 (UTC)

So this is an objection that occurs to lots of people from time to time. Many of them come to the conclusion that they've discovered a simple error that more than a century of mathematicians have somehow missed; I have to say it's refreshing to see your quite different attitude.

The thing to keep in mind is that the argument applies to every enumeration. Yes, if you start with an incomplete enumeration, the argument will find some you forgot to include. But, if a complete one exists, then why start with an incomplete one? Just throw the complete one in from the start.

But of course if you did, then the argument would give you a contradiction. So you can't. But if it existed, you could. So it doesn't exist. --Trovatore 03:48, 24 May 2006 (UTC)

Suppose that you were correct. By the same reasoning, let L be a finite list of integers. There is an integer not on the list, so add it. Continue this process, generating new lists. The problem is that after doing this infinitely many times, the list is no longer finite. In your case above, if you could some how carry out the process; it still does not mean that the list will remain countable. On an aside, the Baire Category Theorem can be used to show that the reals are not equipotent the integers, hence, even if Cantor did make an error; the reals are still nondenumerable.Phoenix1177 (talk) 05:03, 2 January 2008 (UTC)

MY 2 cents

The argument can be reduced to two statements. Statement 1: set A contains all real numbers in the interval [0,1]. Statement 2: a real number x in the interval, can be formed that is not in set A. The two statements are obviously inconsistent or contradictory. If one is true then the other is not, i.e. there are TWO choices. If statement 1 is true then the set A contains x, and is complete. If statement 2 is true then the set A is incomplete, and forming x is resuming the construction process.The second statement is inconsistent within the system because using the same set of axioms,it states that the element x can be formed outside the set but cannot be formed within the set, even though the same class of elements are already in the set. Cantor's error is to ignore the second statement as false. What process formed the numbers in the set, and why can't it form x? If his process forms x, why can't it form all elements? He also lived before the work of Goedel.-phyti 060526

Your comments give me a better understanding of the question. This is probably more desirable than coming up with the "right answer" in any case. Thanks guys. -Steve 69.209.148.136 00:34, 25 May 2006 (UTC)

You might want to read my (professional mathematician's) counterarguments to Cantor's diagonal argument -- then you decide. See for example: Archive of old discussion: May 2002 — May 2004 and BC's stuff above or Wikipedia discussion pages on Cantor's theorem article. If you send me an eMail stating your interest to read my technical papers (they are understandable by even high school math students), then I could send you copies in PDF form. I'm still working on their translations to HTML format for Internet publication.[User:BenCawaling@Yahoo.com|BenCawaling]] 03:23, 25 May 2006 (UTC)

Further Musings of a Layperson on Cantor's Proof

Well, I've been thinking more about the question and would like to share my thoughts. Again, I will use non-technical "common sense" language, and I may state things at length which are obvious. I find this helps keep my thinking clear.

First, lets take a look at the list that we would like to assume contains all the reals in the interval of interest. What can we say about this list? What do we mean if we claim to have produced one?

What we do not mean is that we have written out or printed out such a list on an infinite stack of paper which we can then have delivered via an infinite set of trucks to the infinite loading dock at our favorite Math professor's office building. For one thing, there's not that much paper available. Other more serious objections also apply. Producing an acual list would require an infinite amount of time. There is no point in future historical time when we can stop and say "Voila, the list is done".

So what we actually mean when we say we can make a list is that we can conceive, and describe in some finite statement, the (infinite) method by which such a list could be produced. For the positive integers, this is trivial "start at one and continue to add one".

So we imagine that for the list of reals we have what I would call an "ordering principle". There may be tecnincal objections to what I am going to say next, but from a common sense viewpoint (drawn from the example of the positive integers) it seems that such an ordering principle should meet several conditions.

(1) It should specify a starting point. (2) It should show you how to get from any number to the next number (3) For any specified number contained in the list it should tell you how to reach that number from the beginning.

Now I think I have come to accept Cantor's argument as proof that no single ordering principle can be stated which will include all the real numbers. I think he has shown that.

Where I now think that the question becomes interesting (in the sense of giving rise to further questions) is when we consider the question of devising further ordering principles.

For example, I could say, I will start out with a statement of how to list the rational numbers. This clearly falls short of including all the reals, but since I have accepted Cantor's diagonal argumnent, at least in a limited sense, that doesn't bother me. The list of rationals is merely a starting point.

Now, not surprisingly, I can use the diagonal argument to construct a number not on the list. Of course, I'm speaking loosely. I can't actually construct the number in finite time, but I can give a finite statement, employing the diagonal argument, of how the number is to be constructed. That statement will uniquely specify the number.

Now I will think very hard about this number. Perhaps I will describe it on the Internet to try to get the collaboration of other thinkers. My question will be "Is there an ordering principle which would have allowed me to specify a list containing my newly discovered number? "

Now, as a side comment, it's worth mentioning that we can "look at the back of the book" and discover other ordering principles already known or easily derivable in mathematics that will order other subsets of the reals. I suspect that there is a way of ordering real roots of polynomials, as well as the kinds of infinite series expansions familiar from the cases of e and pi. And almost certainly other classes of more exotic numbers.

But we can suppose we've accounted for all of these. We've found a number not on any of these lists. We want an ordering principle which would generate it.

Now the first question I find interesting is whether we believe that such an ordering principle is always there to be found. If not, we will someday come to the end of all the reals that can ever be ordered and find the first one of which it can be said "this number is from somewhere else. It has popped up from out of nowhere and we will never be able to track it to its lair." The first known unorderable real number!

The above question obviously rests in part on whether the diagonalization process itself can be used as the basis for an ordering principle. If so, you could obviously keep going forever just by doing repeated diagonalizations as I originally proposed.

I think is probably does not, based on the conditions I said such a principle should meet, because it cannot show you how to reach any specified number on its generated list, nor does it allow one to easily grasp how to construct the "next" number. Merely how to construct "another" number. (Is this new number the "next" one - why or why not - how would we know?)

So, what of other ways of coming up with ordering principles. This actually touches on the Artificial Intelligence question. Is there an algorithm which could produce new ordering principles? Could an algorithm be constructed that in infinite time would produce "all" ordering principles? If the answer to this last is yes, then I think the reals are countable after all, since the set of all possible ordering principles would "eventually" order all the reals (unless, as I wondered above, there are some number of reals which in principle have the characteristic that they can never appear on any list constructed acording to an ordering principle.)

Suppose we believe that an algorithm to find "all" ordering principles is impossible. Do we then accept that human intellect can find more ordering principles that any particular algorithm could not? If we say yes to this question, what are the further implications? Do we believe that the human intellect can "eventually" find "all" ordering principles? If we set up a foundation to employ mathematicians into perpetuity to devote themselves to discovering ever more obscure ordering principles for the ordering of ever odder subsets of the reals, does this mean that in infinite time we can order them "all"? And would that mean that they are actually countable - albeit by this rather unusual method?

Well, I don't claim to have any answers for these questions. But I think questions are more fun than answers anyway. Hopefully others agree. I have tried to be like the proverbial "fool" who can ask more questions in 20 minutes than a wise man could answer in 20 years. Hopefully the "wise men" here will not be offended by my effrontery. I just thought these musings might spark some enjoyable thoughts from this community.

Have fun, and thanks for listening.

-Steve 69.209.131.123 23:36, 25 May 2006 (UTC)

I like your approach.

Yes, there are ways to order roots of polynomials, and many other numbers. And applying the diagonal argument to them will give you a new number not on the list.

Can the diagonal argument be used to produce a new ordering principle? One answer: YES. New ordering principle, type A: Take an existing ordering principle. Apply diagonal argument. (1) starting number is the new number just produced. (2) Next number is the starting number of the old principle, and numbers after that take the same succession as in the old principle. (3) For any given number, either it is the number we just produced, or it isn't. If it is, it is at the start. If it isn't, we ask the old ordering principle where it is, and shift down one place to find it in the new list.

If we can use the diagonal argument as the basis for a new ordering principle, then you say we can go on forever doing diagonalizations as you say, and hope to get all real numbers. One answer: NOT SO. New ordering principle, type B: take existing ordering principle. (1) and (2): for even numbered positions 2n, fill with numbers from old ordering principle at position n. For odd numbered positions 2n-1, fill with numbers produced by diagonalizations as per new ordering principle type A, repeated n times. (3): for any given number, either it was produced by applying diagonalizations as per A for a certain number times -- let us call this number n -- or else it wasn't. If it was, it is at position 2n-1 in the list. If not, ask old ordering principle, and double the answer to get its position in the new list.

But, apply diagonal argument to this principle B to get yet another number ... so obviously we didn't get all numbers by doing this.

OBJECTION to those answers: you say, you don't actually print out the numbers on infinite amounts paper. How silly would that be! You have a process. So for new ordering principle type A, requirement (3), how do you determine whether a given number is actually the same as the new number just produced? For new ordering principle type B, requirement (3), the situation is even worse. You have to search an infinite list. Hah! Count to infinity, then do something else... silliness!

REPLY: Hey, why do we need (3) anyway? Do you not accept Cantor's argument as proof that no (1) and (2) can be stated which will include all the real numbers? I.e. even if you don't have a way to go in the other direction, we can guarantee the new number produced WILL NOT be on the list.

-Dan 03:00, 26 May 2006 (UTC)

Here's why I'm a little nervous about using diagonalization as an ordering principle. Perhaps this is less of a logical objection than an emotional one. I'm not sure. In the case of the ordering principle of the positive integers, the principle is related to the mathematical character of the numbers involved in a straightforward way. Knowing where a number is on the list tells us something about the number. This is also true, though less directly, of the method usually presented for ordering the rationals in a diagonal grid. But it seems to me that diagonalization is less of a mathematical operation that a mechanical one. We know that each successive diagonalization produces "another" number, and we can call it the "next" number, but does the sequence thus produced have any underlying theme other than accidental juxtaposition? Or does this even matter?

Let me state it another way. The ordering principles we are commonly familiar with are all intuitively graspable. At a certain point we go "aha - I see the pattern here". Now what we have with successive diagonalizations is a method of producing a sequence of numbers that may or may not have any underlying pattern. If we compare the easily graspable ordering principles with driving down a road where we can see ahead, then successive diagonalizations is like driving at night with no headlights. We never know where we're going until we get there.

I'm not sure whether this is an actual problem or not. But it bothers me.

-Steve 69.209.131.123 07:23, 26 May 2006 (UTC)

It might matter, but not in this case. Applying any mechanical operation to any pattern results in some sort of pattern. Maybe not a pattern which is easy on the intuition, but it's there; you can't suddenly get a "lawless" sequence. For that matter, I'm not sure how easily graspable your ordering principles really were to begin with. Remember, you were happy to order the real algebraic number field extended with some transcendentals like e and pi. I'd say this is more complicated than the mechanical operation we're contemplating. -Dan 14:53, 26 May 2006 (UTC)

Look, it's great that you're thinking about these things, but it's not really what talk pages are for. They're meant for discussing improvements to the article, not helping editors work through the issues raised by the article. Sometimes an "arguments" subpage is created for this sort of thing (see e.g. Talk:Gödel's incompleteness theorems/Arguments, and this talk page should probably be refactored along those lines (maybe I'll get to it), but a better idea might be to take the discussion to a Usenet newsgroup such as sci.math. --Trovatore 15:21, 26 May 2006 (UTC)

(Oh, BTW, "you" means "Steve" more than "Dan", but Dan does seem to be enabling here....) --Trovatore 15:27, 26 May 2006 (UTC)

Sorry... my bad. I could have tried to move it elsewhere. As for the article, I am inclined at this point to separate |N| =/= |R| (translation: "there is no enumeration of all the real numbers") into |N| =/= |2^N| ("there is no enumeration of all the infinite sequences of bits") and |2^N|=|R| ("there is a way to match every infinite sequence of bits with one, and only one, real number"). |N| =/= |2^N| is:

• what Cantor actually did, at least in translation linked;
• more transparent than our attempt to directly do |N| =/= |[0,1]| = |R| ("there is no enumeration of all real numbers between zero and one inclusive, and there is a way to match every real number in the same range with one, and only one, real number") -- aside from the discussions immediately above, and previously, about rationals, transcendantals, decimal expansions, and other issues, consider that we feel it necessary to have a whole page devoted to a proof that 0.999... equals 1;
• is really the essence of a diagonal argument, and should not be obscured by other issues.

Now it would be dishonest of me to pretend my opinion was not also formed by the fact that |2^N|=|10^N|=|R| is also, in the end, non-constructive. I actually think one or two of the questions raised are therefore not totally off-base. I plead guilty. So, what do you all think? Shall I (or someone else) go ahead? -Dan 20:53, 26 May 2006 (UTC)

Having been prompted to read for the first time the linked translation of Cantor's proof, I see that Dan has correctly pointed out a problem with the article as now written, namely that the proof given here does not seem to be the Cantor's original one, as the article implies. Paul August ☎ 22:32, 26 May 2006 (UTC)

---

Done. ||N|| =/= ||2^N|| is emphasized, and ||2^N|| = ||R|| is de-emphasized. I think cardinality of the continuum had a more sound explanation of the latter to begin with. -Dan 02:11, 30 May 2006 (UTC) (Now, who wants to reorganize Gödel's incompleteness theorems ...)

I like this version better, and it has the advantage of being the proof that Cantor actually gave. Paul August ☎ 02:48, 30 May 2006 (UTC)

not a convincing argument

If the decimal expansion of a real number in the interval [0,1] is constructed as a sequence of integers, then each position has 10 possible elements: .n, 10 combinations, .nn, 100, etc. The list grows exponentially for each position added. If we use each element at each position, we have all possible combinations and no sequence would be missing.

If one infinite sequence is included then all must be included. Any diagonal sequence would have to be in the list.

1.If he could construct one such sequence, he could construct all of then. 2.Conversly if he can't constuct one, he can't constuct any.

The missing diagonal number is not true because Cantor shows an incomplete list and asks you to take his word. He cannot select the numbers he wants to prove his point. Statement 2 is the reason for no list.64.24.146.156 02:21, 18 April 2007 (UTC)phyti

This way you will construct an array of digits, which:

1. represents only real numbers with finite decimal expansions, ie. containing only finite number of non-zero digits, and
2. has all digits on its diagonal (and above it) equal zero.

So the diagonal sequence is 000... (consists of zeros only) and the final sequence in the proof, made by modifying digits found on diagonal, contains no zero at all. As a result you get an infinite sequence of digits without zeros, which obviously does not appear in any row of your array (because the array contains only finite sequences with infinite zeros-only tails). And the whole proof still holds — you eventually get a real number which misses in the original sequence of real numbers, which means the original sequence did not contain all real numbers between 0 and 1. --CiaPan (talk) 09:21, 17 December 2009 (UTC)

can't accept this one

"Therefore it may be seen that this new sequence s0 is distinct from all the sequences in the list." The sequence s0 is distinct from all sequences in the partial list used to construct it. This does not prove it is distinct from other portions of the list, which haven't been compared. This to me, is an unqualified extrapolation from a sample to the entire population, and is more a conjecture. Another portion will show that same partial sequence.Phyti (talk) 01:09, 29 January 2008 (UTC)

No, it shows that it's distinct from all the sequences. Otherwise it would be the same as one of the sequences, but as has been shown, it can't be. That's really all there is to say about it -- it's ironclad and there is no subtletly remaining. --Trovatore (talk) 02:28, 29 January 2008 (UTC)

Looks like the list S already contains all the sequences S(i), because every index i corresponds to a position inside the sequences, and no new positions can be added because we have agreed that the sequences are already presented in full (although it is impossible to imagine them being presented so). Still, this all is counter-intuitive (intuition tells we cannot do anything to infinite lists and sequences because infinite lists and sequences do not exist in the real world where it's possible to act).

Probably, the article could better go into some detail on why and for what the diagonal argument being applied to natural and real numbers is important in mathematics as well as in the "real world", so that a lay reader like me could really understand there is no life without this argument in this or that important field of human activity or imagination. A layman's view is that generic real numbers correspond to nothing in the world we see and experince, and in this sense do not exist, that they are only idealizations of our real and always finite knowledge, and that infinite lists of numbers (be they real or natural) do not exist in the same way, so any layman and not only me is naturally interested why mathematicians study different kinds of non-existence. 91.122.7.114 (talk) 00:51, 19 January 2013 (UTC)

Forget all that philosophy, what bothers me for real is this: how can one say he has picked all the natural numbers? One gave me a bucket of numbers and said: "That's all, there are no more natural numbers". I determined what number is the maximal one in the bucket (if that guy was able to pick them all, then I can inspect them all; and if the guy is not able to pick them all, then no infinite list can be built anyway) and then named a number that is greater by one, so that to add it into the bucket. Then I said, "Now all the natural numbers are in the bucket", and gave the bucket back to my friend, but he disagreed, on the same grounds. Something here must be wrong, but what exactly? - 91.122.7.114 (talk) 05:27, 19 January 2013 (UTC)

Well, seems like the beaut is that the work is never done but the features of its state are the same at whatever point. I can imagine Cantor's devil as a machine that, first, declares it's going to do something abominable (names what and why), reserves B-1 infinite-length registers (B being the base of the numeral system to use), initializes the registers with empty sequences, and then proceeds: at each step, it picks a natural number, generates an (infinite: ???) sequence of digits, seeks a digit on the position that corresponds to the number just picked, makes a set of the other digits, and for each of them, adds a digit to the sequence in a reserved register. Of course, it never finishes its work, but whatever the finish can be, we'll see that when it has come, there are only so much natural numbers, but the sequences of digits outnumber the numbers anyway (whatever nonsense those sequences are).

The problem (my problem and all the readers') is that the finish can't be (from the habitual point of view), and thinking of it is meaningless, unless there is such and such reason to accept this way of thinking in this exactly situation. The rest is to understand what are the reasons to accept these or such things, and I think this is what the article fails to demonstrate, and that's why so many questions from us all. I guess it might be improved in this direction: i.e., show context. -- (the same user) 178.71.141.48 (talk) 18:59, 19 January 2013 (UTC)

Cantor's Nonsense: Pseudo-mathematics at its best.

This so-called diagonal argument is an example of pseudo-mathematics at its best. To see why it is a false argument, simply switch the position of the two sets in the argument. That is, assume that the reals are "countable". Now "list them all" in the table on the left-hand side in any order. (This, of course, is impossible, but for Cantor and God, anything is possible.) We now have a "completed, countably infinite set" which we can use to compare with, say, the natural numbers.

Done? OK, we will now number each entry on the left using the natural numbers starting with "1" on the right-hand side. Don't forget to draw your 'diagonal" through each one. But wait! No matter how far down we go, there will always be a natural number on the right-hand side we haven't used! We now arrive at the inevitable conclusion (a la Cantor) that sets like the integers are NOT countably infinite. The set of natural numbers must, therefore, be larger than the set of irrationals. Frederick Bryan, you are right on the mark. Cantor may have been a madman, but his followers have no excuse. —Preceding unsigned comment added by 66.67.96.142 (talk) 19:01, 23 May 2008 (UTC)

Don't understand you. The present proof begins by assuming the reals are countable. switch the position of the two sets in the argument. That is, assume that the reals are "countable" makes no sense William M. Connolley (talk) 16:06, 25 May 2008 (UTC)

The present "proof" begins by asserting that some sets (viz. the natural numbers) are both countable and infinite. This is not an "assumption" which is to be proved or disproved by the argument. The "assertion set" is on the left and the "assumption set" is on the right. The two sets are then compared. —Preceding unsigned comment added by 66.67.96.142 (talk) 18:24, 25 May 2008 (UTC)

The proof does *not* assert that the natural numbers are countable. As it says a proof that there are infinite sets which cannot be put into one-to-one correspondence with the infinite set of natural numbers. I'm assuming that you don't dispute that the natural numbers are infinite, so I'm not sure what you're complaining about William M. Connolley (talk) 19:42, 25 May 2008 (UTC)

Quite right. I don't dispute that the natural numbers are infinite. I dispute that they are "countable" or "countably infinite" in any meaningful way. Cantor asserts that they are but makes no attempt to prove his assertion within the diagonal argument. His "proof" concerns the "assumption set". Switching the position of the two sets immediately exposes the fallacy of the diagonal argument. —Preceding unsigned comment added by 66.67.96.142 (talk) 23:02, 25 May 2008 (UTC)

You don't seem to be listening, so I'm not sure what point there is in talking. To repeat: a proof that there are infinite sets which cannot be put into one-to-one correspondence with the infinite set of natural numbers. It *doesn't* assume the integers countably infinite (although given that the defn of countably infinite is can-be-put-in-1-1-corresp-with-integers, its not much of a step) William M. Connolley (talk) 22:16, 27 May 2008 (UTC)

If you don't understand what is meant by "switching the position of the two sets" I'm not sure how to help you. The argument consists in comparing two sets (these may be called Set A and Set B) about which certain assumptions and assertions are made. Apply the assumptions and assertions made about Set A to Set B, and vice versa. Now notice that the constructed number again does not appear on the list, but his time the constructed number must be a member of Set A, not Set B. This "proves" that Set A contains elements that can not be paired with elements from Set B- the opposite of what Cantor claims. Even when the two sets are identical, the diagonal argument allows for the construction of a number not in Set A. —Preceding unsigned comment added by 66.67.96.142 (talk) 13:59, 28 May 2008 (UTC)

Maybe a more appropriate article to discuss these objections could be Controversy over Cantor's theory.--Pokipsy76 (talk) 07:22, 28 May 2008 (UTC)

Cantor's Diagonal Argument as Applied to the Natural Numbers

The following excerpt is taken from Ardeshir Mehta's excellent discusion of the logical fallacies inherent in the diagonal argument.

"It is to be noted that if we adapt Cantor's proof to natural numbers, we can "prove" that natural numbers themselves cannot all be put in one-to-one correspondence with (other) natural numbers! Talk about a reductio ad absurdum.

Note that if we put all the natural numbers in the left column of a table, and then put other natural numbers in the right column, we would get the following table

Natural Numbers	Other Natural Numbers
1	D1 = 0.d11 d12 d13 d14 ... d1k ...
2	D2 = 0.d21 d22 d23 d24 ... d2k ...
3	D3 = 0.d31 d32 d33 d34 ... d3k ...
4	D4 = 0.d41 d42 d43 d44 ... d4k ...
...	...
n	Dn = 0.dn1 dn2 dn3 dn4 ... dnk ...
(etc.)

In this table, D represents any natural number, d represents any digit between 0 and 9 inclusive, the first subscript of any particular d is the natural number to which that particular d corresponds, and the second subscript of that same d is the number of places that particular d lies to the right of the starting digit of the particular D to which that particular d belongs. (When we say "starting digit" we mean the first digit one normally writes down when one begins writing the natural number in question.)

Now each row of the table represents, of course, a natural number put in one-to-one correspondence with another natural number.

Now consider the natural number X = x1 x2 x3 x4 x5 ... xk ... , where x1 is any digit other than d11; x2 is different from d22; x3 is not equal to d33; x4 is not d44; and so on. Now, X is a natural number, so it should be in our list. But where is it?

The natural number X can't be the first in the list, since the first digit of X differs from the first digit of D1. Similarly, X can't be second in the list, because X and D2 have different second-place digits; and X can't be third in the list, because X and D3 have different third-place digits. In general, X can't be the nth in the list -- i.e., it cannot be equal to Dn -- since their nth digits are not the same.

The natural number X is nowhere to be found in the list, no matter how large n gets. In other words, we have exhibited a natural number that ought to be present in a huge, humongous, giganto list -- but it isn't. No matter how we try to list the natural numbers, and how long the list gets, at least one natural number will be left out.

Therefore, using Cantor's own argument, we have "proved" that putting the natural numbers in one-to-one correspondence with the natural numbers themselves is impossible!

But this is utterly absurd, and therefore something must be terribly wrong with Cantor's so-called "proof".

(Actually, what's really absurd is the way people keep on repeating Cantor's argument, and affirming it to be a solid cast-iron proof, virtually ad nauseam, in all the high school, college and university mathematics textbooks -- and even in prestigious volumes such as those of the major Encyclopaedias. One wonders where their authors' and editors' heads are at!) --Ardeshir Mehta

Comment: Somewhere below we find the assertion that nearly 9 in 10 "working mathemeticians accept Cantorian set theory. That is not very encouraging! What if the Pythagorean theorem had this same level of support!!" Good point!! --66.67.96.142 (talk) 18:07, 27 May 2008 (UTC)

If you're referring to what I think you're referring to, then skepticism or rejection of "Cantorian set theory" isn't because the diagonal argument is taken to be wrong, at least, not in the sense you are making it out to be. It is actually already discussed in the article ("The intepretation of Cantor's result..."), although only very briefly I'm afraid. I am as it happens sympathetic to that position, but I am not at all impressed with this particular counterargument: the constructed sequence, called X here, is not in fact a natural number, as it would consistent of an infinite number of non-zero digits, whereas natural numbers are finite (and I assume their expansion is to be padded with 0's to the right). In the original argument, the set in question is the set of infinite sequences of 0's and 1's. The constructed infinite sequence of 0's and 1's called s_0 clearly is an infinite sequence of 0's and 1's. --Unzerlegbarkeit (talk) 02:35, 28 May 2008 (UTC)

I said it at the article on the Controversy on Cantor's Theory talk and I'll repeat it here. The Ardeshir Mehta "reference" is without merit. It's not affiliated with any university, academic organisation, or noted mathematician. The single community college link it offers is broken. Oh, and it makes a number of first year mistakes, such as:

• Claiming that the diagonally constructed decimal appears on the list after the n'th decimal. Where then, on the list? The k'th number on the list, for k even bigger? Wouldn't the k'th decimal places of these numbers differ?
• Claiming that a single point has positive non-zero probability within the interval [0,1]. Singletons sets have zero measure. Also, there's no such thing as an ifintesimally small probibility, only zero probability.
• Claiming that natural numbers are expressible as infinitely long strings of digits. They're arbitrarily long but *finite*; the string 222..... doesn't represent any natural number. This is the issue mentioned by Unzerlegbarkeit.

The one working link the "reference" contains goes to some other irrelevant unaffiliated personal home page, which carries its own glaring mistakes:

• Claiming that a list contains all infinite binary strings when it's quite clearly missing 01010101.... (yet admitting that non-repeating infinite decimals are necessary).
• Assuming that 11111111... appears somewhere on the list, when by construction the k'th number only zeros after the log_2(k)'th digit.

Gauss' incorectness can be forgiven since he died in 1855, some 20 years before Cantor published his results. Today, the reference has no value. Endomorphic (talk) 17:59, 21 August 2008 (UTC)

The Missing Link

Connolley: I wasn't aware of the convention you refer to. Sorry about that. But the question remains. Why is their no link in this article to the Controversy over Cantor's theory? —Preceding unsigned comment added by 66.67.96.142 (talk) 22:22, 29 May 2008 (UTC)

Possibly just because no-one has inserted one. Maybe people didn't know about it - I didn't. Or maybe because there is a vast conspiracy to deny its existence :-)? Maybe because the article isn't very good - most of it just summarises the theory itself; the objections appear, to me, to be badly stated and near incoherent. If you need to call in Wittgenstein as a witness to maths, you're in poor shape ("your" here means the page, not you) William M. Connolley (talk) 22:27, 29 May 2008 (UTC)

OK. I'll insert a link. —Preceding unsigned comment added by 66.67.96.142 (talk) 22:50, 29 May 2008 (UTC)

It's a seriously substandard article, particularly the lede. It was conceived as a piece of original research by a contributor well known to those who frequent Usenet newsgroups such as sci.math and sci.logic; it couldn't possibly stay in that form, and others have made a valiant effort to turn it into a real WP article, but no one in my opinion has really justified its existence as a separate article at all.

The problem is that there's a certain current of interested amateurs that are conflating two things. Yes, there are serious mathematicians with objections to the assumptions used in the proof, or to the usual interpretation of the result, or even to the acceptance of certain rules of logic employed by the proof; these objections do need to be represented somehow. But there are no serious mathematicians whatsoever that have the same objections typically presented by these interested amateurs (such as the claim that the same proof shows that the natural numbers are uncountable, or the claim that you can get around the result by adding the "diagonal real" back to the list). Those objections simply represent basic misunderstandings and flat logical errors. --Trovatore (talk) 22:52, 29 May 2008 (UTC)

I think you misunderstood the 'proof' (showing that the naturals numbers are uncountable). I don't think the author intended it to be taken seriously. Evidently, the author believes that the diagonal argument is incapable of demonstrating anything at all because it employs the concept of 'completed infinite sets'. The 'proof' is used to expose this implicit but unstated assumption in the argument. As you may know, this same objection was raised by Cantor's contemporary and critic, Karl Freidrich Gauss (a very serious mathematician), and by many others. "Poincaré (hardly an amateur) referred to Cantor's ideas as a grave disease" infecting the discipline of mathematics". And by the way, adding the "diagonal real" back to the list makes perfect sense if you reject the notion of 'completed infinite sets'. —Preceding unsigned comment added by 66.67.96.142 (talk) 04:11, 30 May 2008 (UTC)

No, I'm sorry, I think you're wrong -- the author of that proof just flat didn't get it, and I don't think you do, either. Rejecting completed infinite sets is a respectable position (though a severely limiting one), but if you do that you just can't get started on Cantor's proof; there's nothing left to analyze. So therefore, you're wrong in your last sentence as well. --Trovatore (talk) 07:04, 30 May 2008 (UTC)

Oh, and as for Gauss, he doesn't count for chronological reasons--he died before Cantor ever published any work on set theory. It's like saying Newton rejected quantum mechanics. --Trovatore (talk) 07:07, 30 May 2008 (UTC)

Cantor was not the first to try to extend set theory to infinite sets, nor was he the first to use the notion of "completed infinites". Both ideas lead to contradictions and mathematical difficulties. Gauss's objection "I protest against the use of infinite magnitude as something completed, which is never permissible in mathematics" still stands, and I give you credit for recognizing the legitimacy of this position. If you look closely, you'll see that most of the complaints about the diagonal argument in these pages (by both amateurs and serious mathematicians) center on this issue, though not always explicitly. It is true that Cantor was the first to use the notion of "completed infinities" to prove the existence of nondenumerable sets. In may be comforting to enter "Cantor's Paradise" but I'm still an atheist.

On re-reading the excerpt from Mehta's 'natural number' proof, I think my take on it is correct. He even puts the word "prove" in quotations to emphasize the point. Seeing the excerpt in the context of the whole article makes this very plain. I believe a pritable version is available on the web. —Preceding unsigned comment added by 66.67.96.142 (talk) 17:55, 30 May 2008 (UTC)

So: in one small thing you're right; Cantor was not the first person to consider infinite sets. He was just the first person to show that something of value came out of considering them (e.g. the existence of transcendental numbers). Gauss died too soon to see the fruits of Cantor's work (for that matter, so did Cantor -- the most important applications didn't really get moving until the early 20th century). Whether Gauss would have continued to reject the completed infinite, in the face of all the great mathematics that came out of it, is speculation. Certainly there are many important workers who continued to reject it; perhaps he would have been one.

But that has nothing whatsoever to do with these arguments about the same proof showing there are uncountably many naturals, or with the thing about adding the diagonal real back to the list. Those are just flat misunderstandings -- in the first case, misunderstanding of what a natural number is (can't have infinitely many nonzero digits), and in the second case, of the nature of a proof by contradiction. You will find good mathematicians that reject the completed infinite; you will not find any at all that think those two arguments are valid reasons to reject it. --Trovatore (talk) 04:44, 1 June 2008 (UTC)

Could you please give a brief overview of these applications? Why are they important? Thank you. - 91.122.7.245 (talk) 13:28, 27 April 2016 (UTC)

For a minute there, I thought you understood the significance of the "completed infinite" (CI) as applied to this argument. Apparently you don't. Those who reject CI can always counter Cantor's constructed real by simply adding a new natural number to correspond with it. It's really that simple. If you don't understand that, you don't understand the issue at all. And in this context, the diagonal argument yields no contradiction (and therefore no proof) because all infinite sets have the same cardinality. These are really very elementary notions that you should understand if you are going to defend Cantor. —Preceding unsigned comment added by 66.67.96.142 (talk) 22:16, 1 June 2008 (UTC)

No, you're the one who doesn't understand. Cantor's argument says "assume a completed list exists", and then derives a contradiction. If there were such a completed list, the contradiction would follow; therefore there is none. That finishes it, period. If you don't understand this then you are the one who is missing the very elementary notions.

By the way, if you believe that there are no completed infinities, then you actually agree with the conclusion of the theorem, which says that there is no such completed list. --Trovatore (talk) 22:22, 1 June 2008 (UTC)

You almost have it. Cantor says (implicitly) "assume a completed infinite list exists". Here he is talking about 'denumerable sets' like the natural numbers, NOT the real numbers! Those who reject CI stop right there, and will go no further. For them, this assumption is unwarranted, unjustified, and meaningless.

Next, (and only for those who will go farther) Cantor says (explicitly) "assume that the reals" are also denumberable. Next he says, "but if both are denumerable, why is this newly constructed real not on the list? Conclusion: one infinte set must be larger than the other infinite set.

Now the conclusion of the theorem most definitely does NOT say there are no completed infinities. Quite the opposite! It relies on their existence from the outset. But only the explicit assumption is discarded by Cantor. —Preceding unsigned comment added by 66.67.96.142 (talk) 05:30, 2 June 2008 (UTC)

No, you are wrong. You will not find a single professional mathematician to agree with you on this. You will find ones who deny completed infinities, but that has nothing to do with it; your arguments are simple logical errors, plain and simple, and you cannot hijack the respectability of those mathematicians who deny the completed infinite to support these claims that have zero respectability. This is not the forum for discussing this and I should not have indulged you this long. When I get a chance I will move these non-editorial discussions to an "arguments" subpage. --Trovatore (talk) 07:30, 2 June 2008 (UTC)

It's clear from what you say that you have no idea what is meant by a 'completed infinite set'. Acceptance of CI is absolutely essential for Cantor's argument to work for the reasons stated above. You will find no respectable mathematician who accepts Cantor who does not also accept CI. Your last statement only exposes your shallow understanding of the subject. It's too bad, because if you knew what you were talking about, this article could be of value to readers. —Preceding unsigned comment added by 66.67.96.142 (talk) 13:51, 2 June 2008 (UTC)

Trovatore seems to be saying that the set of all infinite sequences of 0's and 1's is not a so-called "completed infinity". I'm not sure he really meant that. But I agree that some good mathematicians reject Cantorian Heaven with its well-ordered continuum, and that none will think the arguments given against it in this section are valid. If I were a good mathematician, I would be one of these people myself.

Even if the list is not a so-called "completed infinity" you still cannot simply "add a new natural number to correspond to" the extra sequence s_0. To see this, recall that in that case, the individual entries in the list are presumably not "completed infinities" either, and presumably neither is s_0 "completed". Thus, when you extend the list, you also extend s_0, and s_0 still isn't on the list. The reason this doesn't work for natural numbers is that these really are finite. When you "extend" a natural number, it's no longer the same number. Nothing prevents a number constructed earlier from appearing later on the list. s_0, on the other hand, is "one single" sequence throughout, and can never appear on the list at any time.

You may very well wonder what it means for an indefinitely proceeding sequence like s_0 to be "one single" sequence throughout. This is fair. I think it does not matter: in whatever sense the list is "one single" list, s_0 will be "one single" sequence in the same sense. And at a minimum, you must admit such a list can be given by a some sort of fixed rule, and then s_0 will be also given by the same sort of fixed rule, and it will never appear in the list, no matter how far it is extended. So at a minimum we conclude that no sort of fixed rule of lists all, and only, the sequences of 0's and 1's given by that same sort of fixed rule. While it may not cause you to enter Cantorian Heaven, this aspect of the argument is in fact quite correct. --Unzerlegbarkeit (talk) 00:21, 2 June 2008 (UTC)

Where did I say that "the set of all infinite sequences of 0's and 1's is not a so-called 'completed infinity'"? --Trovatore (talk) 03:41, 2 June 2008 (UTC)

The article 66.67 seems to be drawing from can be found here: [1] (pulled from Talk:Controversy_over_Cantor's_theory). It's a nasty peice of work, I'm not recommending anyone try to read it (it's really that nasty), I'm just including it for completeness, since wikipedia is about references.

I'm not sure you'll be able to find any mathematician who denies that "completed infinities exist", nor that Cantor's work is valid. Want to be able to take limits? That needs infinity. Set theory? topology? measure theory? functional analysis? even basic calcules? Lots of "completed infinities" all over the place. You know what: a single decimal expansion *itself* needs "completed infinity", since it's

\lim_{n \rightarow \infty} \left( \{sum}_{i=1}^{\n} \frac{a_i}{10^i} \right)

where 'a_i' is an infinite sequence within N \cap [0,9]. Endomorphic (talk) 18:40, 21 August 2008 (UTC)

Cantor Anti-Diagonal Argument — Clarifying Determinateness and Consistency in Knowledgeful Mathematical Discourse

Perhaps my unfinished manuscript "Cantor Anti-Diagonal Argument -- Clarifying Determinateness and Consistency in Knowledgeful Mathematical Discourse" would be useful now to those interested in understanding Cantor anti-diagonal argument. I was hoping to submit it to the Bulletin of Symbolic Logic this year. Unfortunately, since 1 January 2008, I have been suffering from recurring extremely blurred vision due to frequent “exploding optical nerves” brought on by my diabetes (I can’t afford laser eye surgery) and I had only about 20 productive days in the last 8 months. At this rate, it would take me a long while to finish my paper or may not be able to complete it if I go permanently blind soon. I just hope my endeavors to clarify mathematical infinity and modern logic would reach the next (if not the present) generations of mathematicians, philosophers, and logicians. [BenCawaling@Yahoo.com] BenCawaling (talk) 07:55, 4 September 2008 (UTC)

Enlarging the table

And what if we now consider infinitely many rows both upwards and downwards, using only 0 and 1 and arraying them like a truth table :

........................................

1_____1_____1_____1.....

0_____0_____0_____0.....

1_____0_____0_____0.....

0_____1_____0_____0.....

1_____1_____0_____0.....

0_____0_____1_____0.....

1_____0_____1_____0.....

0_____1_____1_____0.....

1_____1_____1_____0.....

0_____0_____0_____1.....

1_____0_____0_____1.....

........................................

Wouldn't all diagonals be included as rows ? --Michel42 (talk) 16:25, 18 October 2008 (UTC)

Cantor's diagonal argument is false

• The number of rows is infinite.
• No matter how many diagonal elements you collect to construct your new row, the number of elements you have collected is finite.
• Which means there are still an infinite number of rows in the table to go.
• Any one of which could be identical with the elements you have collected from the diagonal so far.
• Since you can never get to the end of the table, you can never construct a row that isn't already in it.

--Vibritannia (talk) 14:42, 9 May 2009 (UTC)

I have the exact same objection to Cantor's diagonal argument. I don't disagree with its result, that integers and reals can't be mapped to each other, but I don't see the fallacy in Vibratannia's point either.Mister Mormon (talk) 00:23, 11 September 2010 (UTC)

The visualization of a list screws up a lot of peoples intuition apparently. So I rewrote the proof any a more algebraic and precise way. I use function argument instead of subscript and g will denote the s_0 in the article:

Let X be set of sequences of ones and zeros, that is X={f: N->{0,1}}, where N is the set of naturals. In that article s is an arbitrary map from the naturals into X, that is

s: N->X.

Cantor asserts that s is not surjective, which means there is a sequence g in X such that for any natural n we have

s(n)!=g.

To see this define g as

g(n)=1-s(n)(n).

Now if g was in the range of s, then there would be a natural m such that

s(m)=g.

But consider the mth term of both sequences. By definition

g(m)=1-s(m)(m),

on he other side

s(m)(m).

Their equality would imply s(m)(m)=0.5, which is impossible. So g and s(m) differ at the mth term. Therefore g!=s(m) for any m, thus s is not surjective. QED Scineram (talk) 09:57, 30 October 2009 (UTC)

proof or illusion?

A statement from 'Cantor's diagonal argument:

1. "Therefore this new sequence s' is distinct from all the sequences in the list".

It should say "is distinct from all the sequences in the sample list". There is no logical reasoning from 'some' to 'all'. You can't reach a conclusion for all, based on a comparison of some. For example, a doctor can't state with certainty that 100 people don't have disease A, based on examination of 10 from that group. Since the truth of statement 1 depends on the comparison of all sequences, it is based on information not available, i.e. speculation. The problem with isolated experiments is the denial of information that would assist in making an accurate conclusion. If the list L is ordered, and divided into two subsets, L0, all sequences beginning with '0', and L1, all sequences beginning with '1', the first comparison and symbol swap would exclude the subset L0, and it is only necessary to compare s' to a member of the subsets L10 and L11 for the next position. The process becomes more efficient by eliminating redundant comparisons. A simple pattern emerges with the choice for each position always the same, '0' or '1'. If s' is compared to a member of one subset, its symbol swap will place it in the complementary subset. Continuing with any arbitrary 7-symbol sequence, the next comparison would be with one of the following subsets, each containing an unlimited number of sequences not compared, that match s' to the current position.

L10111010={10111010...} (all sequences beginning with s' and appended with 0)

L10111011={10111011...} (all sequences beginning with s' and appended with 1)

conclusion: It's obvious that no matter which choice, there is an existing sequence matching s'. The refined process is equivalent to forming any sequence. The original process is not forming a 'new' sequence, it's just copying an existing one. Assuming a complete list, 10111... and 11111... differ in one position and 010101... and 101010... differ in all positions. If each sequence is unique, then each must differ from all others in at least one position. The fact of being different does not imply exclusion. Assuming in principle, if one complete sequence can be formed, then all possible sequences can be formed and presented as a complete ordered list L, otherwise there is no list. In either case the diagonal proof fails. The diagonal and partial list are instances of misdirection. Phyti (talk) 18:59, 21 March 2013 (UTC)

The sequence s' isn't being compared to 'some' of the sequences in the list, it's being compared to ALL of the sequences in the list. Your 'refined process' merely divides your list into several sub-lists. s' is not in any of these sub-lists because s' isn't in their union (the original list). Gazzawhite (talk) 02:20, 13 November 2013 (UTC)

You missed the part where the ordering of subsets eliminates redundant comparisons, and accounts for all possible combinations of 0 and 1. We could also just admit that even one infinite sequence cannot be constructed, and therefore no list. On a more fundamental level, no human can conceptualize infinity, since there is no related experience. To model it using finite entities doesn't work. Even if humans became immortal, they still have a beginning. Phyti (talk) 20:26, 14 February 2014 (UTC)

The ordering of the subsets (to "eliminate redundant comparisons", whatever that means) is irrelevant. If s' isn't in L, then it can't be in the subsets. Your change of format from a list to a collection of subsets does not prove that s' is in L any more so than our original assumption that L contains all binary sequences (and thus contains s'). Thus the contradiction is still there. Gazzawhite (talk) 04:52, 1 July 2014 (UTC)

Moved from talk:continuum hypothesis

Heading was "Proposed things to add"

Note: A one-to-one correlation between the set of all natural numbers and all real numbers between zero and one, exclusive, can be conceived of. Each integer would pair with the real number obtained by flipping all of its digits across the decimal point. For example, 5.0 would coincide with 0.5, 27.000 would coincide with 000.72, and 271828182845904.00000000 would coincide with 00000000.409548281828172. Two arguments against this are that the correlation is not consistent between bases. While that is correct, and while 0.125 coincides with 521 in base ten, 0.125 in base twelve would coincide with 73 in base twelve, the existence of a correlation between the two sets is constant throughout all bases. The other argument against it is that recurring and irrational decimals (like 1/3 and e-2) would coincide with integers with infinitely many digits. However, a number can be infinitely large and still be an integer. Despite the presence of a counterargument against both arguments against this one-to-one correlation, the validity of this correlation is still controversial.

If the correlation is valid, then it would make the amount of all real numbers aleph-nought, making the Countinuum Hypothesis meaningless. — Preceding unsigned comment added by 98.195.88.33 (talk) 04:49, 9 February 2016 (UTC)

What do you mean by "a number can be infinitely high and still be an integer"? You must have a meaning of "integer" in mind which is very different from the meaning generally accepted by mathematicians. More important, however, is that your extended concept of "integers" does not have cardinality aleph zero, which destroys the whole point of your suggestion. The editor who uses the pseudonym "JamesBWatson" (talk) 16:00, 9 February 2016 (UTC)

High meant large, and I fixed that. Let me explain what I mean to you. Graham's Number has a ton of digits, and it's still an integer. My definition of an integer is a number that has no non-zero digits after the decimal point. It can have as many non-zero digits as it wants, even an infinite amount, before the decimal point, as long as it doesn't have any after. Also both the set of natural numbers and the set of integers have cardinality zero.

Wrong question

Folks, you're all asking the wrong question. The wrong question is: can every real number be enumerated? This question is too specific, it lacks generality, and detail. The real question is: is the situation conceivable, in which the creation of the set of all natural numbers has come to its end, the creation of the set of all real numbers has come to its end, the creation of all transitions from one natural number in the first set to one real number in the second set has come to its end, and no real number exists, such that it has no transition pointing to it from some natural number? Cantor says: no, one cannot conceive such situation, and here's why… Of course, one can argue that such situation is not conceivable simply because the completion of the set of all natural numbers is not conceivable, but that's another story, to which the argument does not apply. Sure, one needs to have finished the building actions about a set before saying it has the same cardinality as anything else. - 91.122.4.3 (talk) 23:07, 26 April 2016 (UTC)

I think I can add some more to it.

Let's just ask ourselves the question: what is the difference between finite and infinite sets? The difference is, we can conceive of every object in a finite set at the same time, while the same is not true of an infinite set. That ability of ours has consequences for all procedures of enumeration, as enumeration over only a finite set has a limitation: it only can find objects that can all be known and constructed beforehand. But one can freely get used to the idea that it does not matter whether this simultaneous conception of all objects in a set is possible. A set is good enough without that possibility, because what is substantial for a set is the kind of argument that we can do with whatever element in this set. The principle goes, what is true for an arbitrary number in the set is true for every number in it.

So, what do we have? For a digital string whose digits are constructed in a certain way, it is true for an arbitrary string in the set of digital strings, on the condition that the string is put into a correspondence with a number in the set of integers, that that string is different than the string whose digits we can construct, because of the way those digits are constructed. Since it is true for an arbitrary string, it is true for every string that satisfies this condition. Therefore, the string that is different than all of them exists, and it satisfies all conditions that any member of the set of digital strings has to satisfy; that is, the set contains that string. It is not required that we actually construct all digits in the string; suffices that we may do so, because, again, what is true for an arbitrary digit in this string is true for all digits in the string.

Sure, the construction and rememberance is possible only for a finite number of objects. But for a set, the rememberance of all objects is simply not necessary: it is just the same whether it is or is not allowed. I think there are sets for which it is not even known (as of yet) whether they are finite or (actually) infinite. - 37.9.29.40 (talk) 11:55, 24 November 2016 (UTC)

Set theory isn't real

Suppose you construct the sets like this:

0000...  (All zeros)
1000...  (1, then zeroes)
1100...  (11, then zeroes)
1110...  (111, then zeroes)
.......

And so on. The 1s form a triangle. The diagonal pattern is the complement of a sequence of zeroes, so it's all 1s. Do we really believe that this triangle sequence, with a continuing number of 1s, is different from a constructed sequence that, so far, happens to be entirely 1s? 23.121.191.18 (talk) 04:14, 16 August 2017 (UTC)

This question somehow resembles the one asked in the section #not a convincing argument above (although it's obviously not the same). --CiaPan (talk) 09:07, 16 August 2017 (UTC)

The diagonal is an infinite sequence of zeros, so the constructed pattern is an infinite sequence of ones. However, none of the rows used in the construction is built of ones only. Please note that if one was, it would introduce a '1' into the diagonal, which by design contains zeros only!
So the answer is:

YES, the resulting sequence of ones does NOT appear in the list of sequences used in the construction.

--CiaPan (talk) 13:29, 17 August 2017 (UTC)

Yes, there is no single row with all ones. However, we can also show that the infinite set of all such rows does contain it, since for every column i, all (infinitely many) rows starting at i+1 indeed have ones there. — Preceding unsigned comment added by Zde71 (talk • contribs) 19:35, 4 October 2017 (UTC)

@Zde71: Nope. The set, implied by the construction of the array above, does not contain a row with infinitely many ones. Certainly, there are sets of rows, which contain such rows. And those sets do not even have to be infinite – you can easily construct such finite sets. There is even a singleton (one-item set) with such a row:

             { '11111111...' }

However, that doesn't imply such a row belongs in the set discussed above. It's true there are infinitely many rows in it with a one at position 7. There are infinitely many rows with a one at any chosen position. Anyway, none of them has ones only. What's more, each of them has more zeros than ones! (Because each n-th row has only n–1 ones-only leading part and infinitely long tail built of zeros only.) --CiaPan (talk) 07:46, 5 October 2017 (UTC)

That depends on your axioms. At ∞ supposedly such exists, and whether any 0s follows depends on an additional axioms, and one can argue the number derived from the diagonal is at position ∞ that is line number ∞+1 having natural number ∞. Your setting up your axioms to suit your tasts as is the other person. — Preceding unsigned comment added by Victor Kosko (talk • contribs) 23:45, 27 March 2018 (UTC)

@Victor Kosko: No. Natural numbers do not contain ∞. There is no such natural number. And our set is implicitly defined by a sequence, i.e. its items are numbered by natural numbers, hence there is no 'position ∞' in it.
Let alone '∞+1', which is pure nonsense. Even if you insisted on building another arithmetics with something like 'the greatest natural number' denoted by ∞, adding 1 to it would immediately ruin the theory: either you have to admit '∞+1=∞' and your reasoning above becomes inconsistent, or you create an inner contradiction by proving there exists a 'number' ∞+1 greater than the number ∞, which was defined as the greatest one (which means no greater number exists). --CiaPan (talk) 07:30, 28 March 2018 (UTC)

I argued only that neither you nor the other(s) have sufficient axioms. I was using actual not potential ∞ since the diagonal argument is provably wrong with potential ∞ since it just keeps going on If you want to be persnickety then per his argument the "last" row is "row number ∞" "indexed by ∞-1" having "∞-1" 1s followed by ONE 0 not ∞ 0s, the number derived from the diagonal on the disallowed next line. You are allowing transinfinitly many digits/rows in your counterargument. Victor Kosko (talk) 00:32, 29 March 2018 (UTC)

New simple arguments cardinal ∞

1. Cardinal ∞ is pseudo or meta math:

∞ sets have no size and 2 unconnected ∞ sets have no relative size.

Proof; consider the set

1 2 3 4 5 6 7

The set has size 7, which is also the last element. Sets of this type have size = the last element. Consider the set

1 2 3 ………

It is the same type of set so has size = the last element. Set theorests would say The set has the same size as the natural numbers

0 1 2 ………

The set has NO last member But since it has no last member it has NO size, same as the natural numbers!

2 connected sets can have relative size without each having sizes such as the width and height of the set of all sets of 0s and 1s, the height is 2↑width. But the set of natural numbers is not connected to the set of even numbers, then the set of evens would be ½ the size of the natural numbers, or ∞+∞≠(the same)∞.

2. So why do they claim ∞ size sets have = > or < size? Because they think they have proof. The proofs are deceptive. There are 19 techniques directly in the same category as Injection and Surjection (Crudely and omissively):

One to one some matching

One to one matching

One to many matching

The one to one being one to one or one to one same

For ≤ < = > or ≥

2 sets or a set and itself, then < and > would be the same, = by one to one or one to one same.

Set theorists remove the < and > techniques, else 2 sets or a set and itself that are proven = in size would also prove ≤ < > and ≥ in size. This is not mentioned in Wikipedia! They then axiomatically assume that which applies to finite cases applies to ∞ cases contrary to this unmentioned result!. So they claim ≤ means < or = rather than < or = or both. And they assume sets compared are < = or > in relative size but not a combination. Contrary to this result they claim if ≤ and ≥ then =, bijection (techniqually tryjection including one to one all of each set to the other). Since they dropped < and > they need to remove = from ≤, ≥. To attempt this they use the diagonal argument to disprove the = technique(s), however it only exhaustively disproves a proof, does not prove ≠. Disproving a proof is not proving the negative of that proof. Again axiomatically assuming that wich applies to finite cases applies to ∞ cases. In fact = can be proved between sets they claim ≠, so >.

Proof:

Make a binary tree with an extra node at the top and all other nodes having 2 or 0 but not 1 node(s) connected directly below them. Call the nodes with 0 nodes connected below them bottom nodes. It is found in all cases the number of nodes is exactly 2× the number of bottom nodes. Apply this to ∞ cases. The branching to the bottom nodes left and right (and center from the top node) represents, a symbol from each node, 0.?????…, Thus all sequences of 0s and 1s, also thus all real numbers from 0 inclusive to 1 exclusive binary. Match the natural numbers 1 number to 2 nodes for all nodes. The natural numbers are thus 1:2 matched to nodes having 2:1 relation to all sequences of 0s and 1s. This does not contradicting the diagonal argument proof since it only disproves a proof, not the negative of that proof.

3. Wikipedia falsly claims a proof that exponential of ∞ ≠ (the same) ∞ (vs = exponential of ∞ and =∞) rather than that being assumed thus an axiom, by the diagonal argument. Again exhaustive disproof of a proof, not a proof of the negative of that proof. In fact a proof of exponential of ∞ = ∞ is in the Wikipedia article on infinite hotel in the section using spaceships.

Proof:

Assume 2↑∞(Aleph0)≠∞(Aleph0) but = Aleph1

Consider two versions of the set of natural numbers;

One having ∞ many numbers

One having numbers with ∞ many digits (bits) so 2↑∞ many numbers

Consider two sets;

The set of "numerics" having subset the set of countable numerics described each by using the set of all math symbols having to do with numerics, so I, e, Euler's constant, the golden ratio, √π×e, etc. Now obviously the set of numerics has infinitesimal 1÷∞. So the set of numerics between 0 inclusive and 1 exclusive has size ∞ many numbers. That's the set being considered.

The set of numbers between 0 inclusive and 1 exclusive. Presumably these have ∞ many digits (bits) so size 2↑∞

Now are the two first sets the same set? Are the two later sets the same set? To be consistent with their writings set theorists would have to say yes to both

Likewise their are ∞ many points on a double ended line not Aleph1 as set theorists claim to have proved.

Victor Kosko (talk) 23:58, 20 April 2018 (UTC)

Edit for outline, symbols, links, one diagram, please. Victor Kosko (talk) 00:18, 25 April 2018 (UTC)

Mainspace page for this talk page

I converted the mainspace one sentence "article" into a redirect pointing back here, but I'm not sure if that is even that is appropriate. Why was the mainspace page created? Elassint ^Hi 02:42, 22 April 2018 (UTC)

Should not exist at all. I'll tag it for speedy. --Trovatore (talk) 17:00, 22 April 2018 (UTC)

I've tagged it as G6, which is supposed to be "uncontroversial" maintenance. It is possible that there is someone who disagrees, since someone created it. I hope that person will reconsider and not block the deletion. The mainspace equivalent has no possible function. --Trovatore (talk) 17:05, 22 April 2018 (UTC)

Cantor's diagonal argument, float to integer 1-to-1 correspondence, proving the Continuum Hypothesis

Counting the Floats (talk) 16:29, 1 December 2018 (UTC)Hello, Pairing Floats and integers

In the YouTube video above, I prove that there is a 1-to-1 correspondence between positive integers and positive floats. This contradicts the conclusion arrived from Cantor's diagonal argument. I do not attempt to disprove the diagonal argument as it involves infinity which I am not qualified to perform calculations. However, the very simple set of algorithms proving the 1-to-1 correspondence actually proves the Continuum Hypothesis also unveiled by Georg Cantor.

I made an almost identical YouTube video which arrives at this conclusion.

Proving the Continuum Hypothesis

Tamas Varhegyi

secondcause@gmail.com

P.S. I am new to the rules and mechanics of trying to showcase some important set theory algorithmic discoveries. I would appreciate positive, knowledgeable feedback which would enable me to make my case according to established Wikipedia editing and authoring policies.

I might still have previous login or user info active on Wikipedia, please let me know if there is any conflict and if yes how do I clear it up.

Counting the Floats (talk) 16:29, 1 December 2018 (UTC)

Have you been able to calculate to which integer the square root of 2 corresponds using your system? Dmcq (talk) 17:26, 1 December 2018 (UTC)

@Counting the Floats: Your 'unique one-to-one correspondence' doesn't even contain all rationals, let alone ${\sqrt {2}}$ proposed by Dmcq. I'd bet you're unable to find an integer number corresponding to float ${\frac {1}{9}}$ in your 'unique one-to-one correspondence'. And I'll be happy to tell you why 1/9 does not exist in your Table 6. You only need to ask. :) Will you dare to ask, Counting the Floats...? --CiaPan (talk) 23:01, 1 December 2018 (UTC)

Hi Counting the Floats. Unfortunately there is no way to "make [your] case according to established Wikipedia editing and authoring policies". That is simply not what Wikipedia is for. If you believe you have an original insight, you will have to make your case out in the wide world, not here. Once original insights become accepted, or at least enough people pay attention to them to make them "notable", then Wikipedia can talk about them. --Trovatore (talk) 19:59, 1 December 2018 (UTC)

@Counting the Floats: Your claim in the Step 5 (timestamp 2:15) is patently false. I'm talking about 'Note the extreme simplicity of this navigational scheme compared to the one shown in Table 2'

I have deliberately removed the plural and the reference to the Table 3 from the sentence, as that part of the claim is actually true. What concerns Table 2, however, the difference is just in drawing: the Table 2 (timestamp 1:25) uses direct, straight returning arrows, while Table 5 uses semi-rectangular external paths, rounded at their corners. But the order of visiting nodes of the graph is essentially the same. Just flip Table 5 vertically to see this.

As a result, you just re-invented the Cantor's scheme, which was 'convoluted, inconsistent and hard to follow' (timestamp 1:30).

Please note the difference in presence or absence of the zero label is out of scope here. I just comment on the claim about the 'navigational scheme' I quote above.

The remaining comment at timestamp 1:30 results from a misunderstanding: the Cantor's pairing function was not invented for this particular diagonal argument and is not directly used in it. It is an example of $\mathbb {N} ^{2}\leftrightarrow \mathbb {N}$ bijection and if you want to apply it to pairs (numerator, denominator) of fraction, you just need to redefine the domain to get $\mathbb {N} \times \mathbb {N} ^{+}\leftrightarrow \mathbb {N}$ . --CiaPan (talk) 00:38, 2 December 2018 (UTC)

no reals

all depends on how you look at it...what Cantor does is show that real numbers aren't actually numbers since they can't be counted...108.20.114.62 (talk) 14:42, 6 April 2019 (UTC)

No, Cantor shows there's more binary strings (equivalently: more subsets of natural numbers) than natural numbers.

This can be used to prove that there is more real numbers than integers, but that requires defining an additional function, which estabilishes a bijection between all binary sequences and real numbers (or at least a surjection from the former to the latter).

Anyway, uncountability of real numbers is proven much simpler by showing they can't be enumerated with a sequence – see Cantor's first set theory article#The proofs. --CiaPan (talk) 16:01, 6 April 2019 (UTC)

The proof is (EDIT: NOT) incomplete

THIS IS WHAT I WROTE: The current proof claims that the base-2 interpretation of infinite 0/1-sequences as reals into the unit interval [0;1] is an injection. The fact that it is an injection is used in an essential way to transfer the uncountability of the set of infinite bit sequences to the uncountability of reals in the unit interval. However, the interpretation is not an injection. For instance, the sequences 011111.... and 100000.... both map to the same number 1/2, which happens to have two (periodical) base-2 representations: 0.011111... and 0.100000.... Thus, the only thing that is shown here is the uncountability of the set of infinite sequences, not of the reals. To properly extend the proof to the reals, the quotienting of bit sequences in the interpretation as reals has to be accounted for. — Preceding unsigned comment added by Andreasabel (talk • contribs) 18:50, 19 May 2019 (UTC)

UPDATE: Sorry, I overlooked the box with the detailed argument that can be opened. So, the proof is indeed complete. However, the text running up to this is slightly confusing. Why mention the decimal interpretation of bit sequences? It does not help at all. The assumption is that the infinite list of infinite bit streams is an enumeration of the reals in the unit interval. Which it is only in the base-2 interpretation! So what purpose does the decimal interpretation play here? — Preceding unsigned comment added by Andreasabel (talk • contribs) 19:01, 19 May 2019 (UTC)

For the proof of uncountability, it is sufficient to construct an injection T→R. This is done by decimal interpretation. The remaining text is about constructing even a bijection T→R, using (a modification of) binary interpretation. I added an introductory sentence to make this more clear. - Jochen Burghardt (talk) 09:41, 20 May 2019 (UTC)

PS: You can sign your comments by appending ~~~~ to them. This is strongly recommended on talk pages. - Jochen Burghardt (talk) 09:44, 20 May 2019 (UTC)

@Andreasabel:

1. “Why mention the decimal interpretation of bit sequences? It does not help at all.”
   Because it's an encyclopedia, not a university lecture script, and its aim is to present facts and concepts to a widest audience. Whenever possible it's good to use a language and examples comprehensible for an 'ordinary reader', whose mathematical bacground may be as low as a mid-high school. A decimal notation is known to everyone, so this actually helps an 'ordinary reader' to grasp the idea of the injection we consider. If we talked about a binary interpretation, most of them would switch their thinking off, just because 'I have no idea what they're talking about'. Of course we may also include higher-lever, more abstract and general examples – and this is in the box – but the basic description should be as simple as possible (but not simpler!).
2. “The assumption is that the infinite list of infinite bit streams is an enumeration of the reals in the unit interval. Which it is only in the base-2 interpretation!”
   No, and no. There is no such assumption, and that is not true for base-2 interpretation. The first ‘no’: we do not assume the list is an enumeration of anything (except the enumeration of binary sequences.) Instead, we prove (i.e. conclude at, not start from) it can be put into equivalence to an enumeration of numbers from some set. The second ‘no’: the equivalence is not direct or immediate even with binary representation of numbers, and that's because of tails of repeating digits: a repeating one in 0.101111... makes the representation equivalent to 0.110000... with repeating zero, hence the two different binary strings “101111...” and “110000...”, when simply transformed into binary representation of real numbers, become the same number. Hence the list of binary strings is not “an enumeration of the reals in the unit interval” by itself. We make a special trick with interleaving double representations, and only after that we get a desired bijection (“enumeration”).

CiaPan (talk) 06:56, 21 May 2019 (UTC)

Please fix the proof

In the current version, the proof of the special:permalink/953668864#Second theorem is incomplete. Can you fix it, please? --CiaPan (talk) 16:24, 30 April 2020 (UTC)

CiaPan, I think this would be more appropriate on the main talk page, together with a little more detail as to what you think is missing. I glanced at the section but haven't tried to figure out whether I think it's a complete proof or not (which is often a judgment call, since there's always a balance as to how much you expect the reader to fill in). --Trovatore (talk) 17:04, 1 May 2020 (UTC)

At another look, I notice that this complaint is not even about the Cantor's diagonal argument article, but about the (poorly named, but that's a separate issue) Cantor's first set theory article article. I think you should comment on the talk page there. --Trovatore (talk) 18:49, 1 May 2020 (UTC)

Victor Kosko's point of view

The proof provides one exception, to complete one proves it provides infinitely many. That is not, however, the major flaw. You Wikipedians claim it proves trans trans finite which it does not and Cantor knew that, and his proof is different from the articles in one point to bend it toward proving trans trans finite. He considers only hypothetical counts that are constructions. Presumably he came up with the diagonal argument to prove trans trans finite. The editors would not tolerate me fixing it, or commenting thus. The recently added proof of his latter version was added to remove time from cantor's proof to supposedly make it prove trans trans finite, being a time based proof cannot, but the diagonal argument can be considered from a timeless perspective. I do not wish to fix a small matter and ignore a major one. I want the new proof removed. Victor Kosko (talk) 04:55, 1 May 2020 (UTC)

per Revision as of 19:17, 7 April 2020 of 'cantor's first set theory article' Victor Kosko (talk) 05:07, 1 May 2020 (UTC)

Set of all sets

In regards to the last two edits, you set theory editors are confused. The set of all sets to fit your argument would have to be 'size' ℵ1 Aleph1, but that would be the set of all sets of set theory constructions from finite length set theory sentences. The sets of the powerset of the powerset of the natural numbers are 'size' Aleph2 many sets for example, a subset of all sets. If you take the powerset of the powerset etc of the empty set, for infinity that is aleph0 or ω many times, one gets all finite sets but only technically the set of natural numbers, which doesn't count same as the last natural number doesn't, so technically the powerset of the natural numbers is not included. Instead one starts with all sets of finite sets the same 'size' cardinality of the natural numbers, or less, then repeatedly powersets that instead. The 'size' of that is Aleph(Aleph0). The statement it's powerset is larger is not correct. Aleph0 + 1 = Aleph0 and ω + 1 = ω , so the powerset has cardinality Aleph( (Aleph0 + 1) = Aleph0 ) so is the same 'size' and in fact the same set. In primitive set theory sets only consist of sets of sets, so if you think it through the set-all-sets contains itself (unless there are more than one of them which there are) and it's powerset and is it's own powerset.

Technically the set theory literature claims that set is not possible under the new axioms but is a class not containing itself.

Analogiesing to the Aleph0 Aleph1 diagonal argument situation isn't working. Victor Kosko (talk) 04:01, 31 May 2021 (UTC)

diagonal counterexample

It would be an improvement if corrections are needed. Why would Wiki want to promote false ideas? https://app.box.com/s/6u5ydjoo8f97dnsord7b49dff4quqlnz This accesses a 3-page pdf showing Cantor's blind spot. Avoid extrapolating the binary system of symbols to any form of numbers. Keep it simple, my lesson learned.Phyti (talk) 15:54, 15 July 2021 (UTC)

I'm your only decent anti set theory person. Per his argument, no. The argument is correct, the rendition is garbage. Victor Kosko (talk)

Can't tell if that helps or not. I updated the paper with the error (Cantor's blind spot). Phyti (talk) 16:13, 23 July 2021 (UTC)

Your link is a specific link, not s general link. So the link needs to be updated. Victor Kosko (talk) 22:44, 1 August 2021 (UTC) New link https://app.box.com/s/bercujcbdvt3qdz544uwqb5w00gfhnjo revised after a forum review.Phyti (talk) 15:36, 11 August 2021 (UTC)

"Since p differs from each S in the sample by construction, it will differ from all S in the list L, therefore a new sequence p will be formed not in the list L. The set of integers N is not sufficient to count the list L." This is correct and nothing that occurs later in the paper negates it. Fig.2 even illustrates how the numbers in the list L cannot be equivalent to the diagonal number. The rest of the post even contradicts itself about whether the diagonal number is included in the S. Whatever "blind spot" is here isn't Cantor's. MartinPoulter (talk) 18:38, 12 August 2021 (UTC)

Main error number one.
The document linked begins with a claim: Assume a complete list L (...). It's not clearly defined what a 'list' is, but a sample presentation with symbols $S_{1},S_{2},S_{3}$ etc. suggests it is a sequence. The term 'complete' in this context remains undefined as well, but the argument suggests it means 'containing all' (all possible binary sequences). So, the wannabe proof essentialy starts from assuming the intended conclusion. As such it proves nothing, it just makes a circle to present an assumption as a conclusion.
Error number two.
False premise allows arbitrary conclusion. The Cantor's proof shows precisely a sequence can not be 'complete' in the above sense - so the assumption quoted above is false. And false implies anything, hence the conclusion is meaningless. --CiaPan (talk) 20:29, 12 August 2021 (UTC)

This article, linked from the article about the diagonal argument, should clear up some of your confusion: Proof by contradiction. See also Reductio ad absurdum. This has been a well-established form of logical argument for centuries. MartinPoulter (talk) 18:28, 13 August 2021 (UTC)

@MartinPoulter: You're clearly wrong. Proof by contradiction (read it, if you do not believe me) starts from assuming something opposite to what needs to be proven, and a contradiction following from that assumption disproves the assumption. It says: "Suppose NOT P. Now it follows that Q and NOT Q. Which is FALSE. Hence NOT (NOT P). As a result, P." On a contrary, the article in a PDF linked says: "Assume P. Then P. Hence P." Which is Begging the question, an error known for more than two millenia. Nothing to do with a valid method of proving by contradiction. --CiaPan (talk) 21:08, 20 August 2021 (UTC)

Cantor is attempting to show the need for 'transfinite numbers' by showing the infinite set N is not sufficient to form a 1 to 1 correspondence with an infinite set of sequences. If he can form an additional sequence not in the list, the list is incomplete.The list of sequences is defined in section 1, the same as Cantor's, but using (0 and 1) in place of (m and w). The binary tree (fig.1) is an overlay of all possible sequences, and by construction is complete if extended without limit. Its counterpart is the list L that contains all possible sequences itemized individually. In fig.2, in swapping symbols, Cantor constructs the complement p of the diagonal d. The complement p is already in the list, but can't be detected with only one comparison. Both are shown to be in the binary tree. Cantor's conclusion: Since p differs from each S in the sample by construction, it will differ from all S in the list L, therefore a new sequence p will be formed not in the list L. The set of integers N is not sufficient to count the list L. Section 3 shows the basis (italics) for his conclusion is incorrect. Sequence p will differ from all minus one, itself, case 1. He uses case 2 as a basis. It's a property of a set of unique elements, that each differ from the remainder of the set but not itself. If p is new so is d, yet there it is in the list. Cantor contradicts himself. It's simple but subtle and elusive. Phyti (talk) 15:36, 19 August 2021 (UTC)

"The complement p is already in the list" Wrong: p is not in the list, and provably so, because p is different from every member of the list. "If p is new so is d" This does not logically follow. There is no necessity that d is not in the list, and the argument does not require that d is or is not in the list. MartinPoulter (talk) 19:55, 19 August 2021 (UTC)

Prove to yourself that the binary tree is complete. Form a short sequence of symbols that is not in the tree. The tree is symmetrical, thus complementary S.Phyti (talk) 16:19, 20 August 2021 (UTC)

His argument is error. Tree arguments do disprove set theory, however tree arguments and diagonal arguments (list, set) cannot correlate to one another, a common error of set theorists and anti set theorists. Victor Kosko (talk) 03:33, 24 August 2021 (UTC)

The binary tree is complete by definition. After the first selection, 0 or 1, the process continues within the tree via a continuous loop. The set L contains itself at each position. You can follow any randomly selected sequence in L in the tree. There is a 1 to 1 correspondence for the tree and the list. The diagonal sequence is not special since orientation is not part of its definition.Phyti (talk) 16:06, 24 August 2021 (UTC)

@Phyti: You still try to prove nothing by nothing. You never defined what complete means, so 'being complete by definition' means exactly nothing. I have written what I think you mean by 'complete'. But that was just my guess, and explicitly emphasised as such. However, you never confirmed my guess nor fixed it, so your complete remains undefined, i.e. meaningless as 'a definition'. --CiaPan (talk) 21:12, 26 August 2021 (UTC)

From Cantor's original 1891 paper:

"[Namely, let m and n be two different characters, and consider a set [Inbegriff] M of elements

E = (x1, x2, … , xv, …)

which depend on infinitely many coordinates x1, x2, … , xv, …, and where each of the coordinates is either m or w. Let M be the totality [Gesamtheit] of all elements E. To the elements of M belong e.g. the following three:

EI = (m, m, m, m, … ),

EII = (w, w, w, w, … ),

EIII = (m, w, m, w, … ).

I maintain now that such a manifold [Mannigfaltigkeit] M does not have the power of the series 1, 2, 3, …, v, …. This follows from the following proposition: "If E1, E2, …, Ev, … is any simply infinite [einfach unendliche] series of elements of the manifold M, then there always exists an element E0 of M, which cannot be connected with any element Ev."]"

The closest word to 'complete' is 'totality'. His purpose is to show the set M cannot have a 1 to 1 correspondence with N, the set of integers, by forming an additional element E0 not in M. This would require his transfinite set aleph.

The binary tree is 'complete' by design for every position k accumulating 2^k branches. The pdf shows why he can't detect the diagonal d and his construction p, and where his conclusion is incorrect. If his idea had truly been received from above, there would be no error.Phyti (talk) 19:07, 29 August 2021 (UTC)

I did not ask for your guesses about what Cantor could or wanted to prove. I did not ask what the word 'complete' is close to, either. I ask what the word 'complete' means. Specifically, and precisely, what does it mean 'the tree is complete'? --CiaPan (talk) 16:52, 4 September 2021 (UTC)

It helps to read about the author to understand their ideas and their goal. They are not guesses. The binary tree if extended without any boundary contains all possible sequences of 0 and 1. That is why I ask anyone to attempt to form a short sequence that isn't contained in the tree. If the first position is 0 or 1, the sequence never leaves the tree!Phyti (talk) 17:09, 4 September 2021 (UTC)

After many revisions, my final answer. Posted on vixra as 2208.0022. No charge and no 'peer' review, but this is not rocket science!```` — Preceding unsigned comment added by Phyti (talk • contribs) 16:08, 5 August 2022 (UTC)

cantor complaint

In his 1891 article, Cantor considered the set T of all infinite sequences {sn} of binary digits (i.e. consisting only of zeroes and ones). He then produced a constructive proof of the following theorem:

     If s1, s2, …,  sn, … is any enumeration* of elements(which 1-1 corresponds to
     the natural numbers or is a single thread as it were ) , then there always
     exists some element s which corresponds to none of {sn } in that enumeration s.

To look at his proof, and then as a complaint associated to that proof: Consider some “1-1 enumeration” consisting of an arbitrary collection C{of members sn}, and the dual of that collection (ie. a 1,0 mirror imaging C => D) ; where then C and D may be bonded into a single-thread-initial-construction by imagining the representations below of C,D,s,cs embedded in parallel planes, ie. for example ( C as viewed immediately over D over s-cs ) and as such any constructive thread of C may be looped or pulled down into D for-and-at each so defined-corresponding-(1,0)site, and into s and cs only on the diagonal sites, and thus for any-and-all C it’s dual D is and will automatically associate to it as also a single enumeration* C/D-s,cs.

           C                      D                  S              Cs                                                                                                                                                                                                                                                                                                                                                                                                                                                

s1 =(0,1,0,0,0,1,0,...)______ d1 =(1,0,1,1,1,0,1,...)______s=(1,0,1,1,1,0,1,...)______cs = (0,1,0,0,0,1,0,...)

s2 =(1,1,1,1,1,1,1,...)______ d2 =(0,0,0,0,0,0,0,...)

s3 =(1,1,0,1,0,1,0,...)______ d3 =(0,0,1,0,1,0,1,...)

s4 =(1,1,1,0,1,0,1,...)______ d4 =(0,0,0,1,0,1,0,...)

s5 =(1,1,1,1,0,1,1,...)______ d5 =(0,0,0,0,1,0,0,...)

s6 =(1,1,1,1,1,1,1,...)______ d6 =(0,0,0,0,0,0,0,...)

s7 =(1,1,1,1,1,1,0,...)______ d7 =(0,0,0,0,0,0,1,...)

...

Cantor then "constructs" the sequence s just from C by choosing its nth digit as equal to the complement to the nth digit on the diagonal of C. That is:

          s=(1,0,1,1,1,0,1,...)

He next argues by construction that, s differs from each sn, in C since their nth digits differ, and Hence, s cannot occur in the enumeration C.

Based on this theorem, Cantor then uses an indirect argument to show that:

 .          The set T is uncountable.   
                                                                         

However, as a D' may also be seen as automatically bonded to any C' then by construction a derived initial C/D-s,cs always exists such that

            (s is contained in C/D-s,cs) but not C. and thus a complaint is posed that it seems the proof is maybe somehow higher dimensionally saturated dual flawed; 
            as claim:: there is no cantor-type-proof acceptable anti diagonalization of the set C/D-s,cs  ,and
            where s,cs are actually a visualization stepping stone and are unnecessary: As any further "construction" on or thru any C/D already implies an
            associated matching construction on or thru its dual D/C which still produces a counter-example and complaint to cantors proof. (eg. repeat this
            for any case s' , all that is really needed is C/D) as a countable set,  and then it exists as a counter example 
            to the above statement '['any enumeration*']' .

 - Crap

Pwaaben (talk) 13:51, 1 May 2022 (UTC)

Your argument technically does not deal with the diagonal, you say mirror instead of NOT, anti diagonal instead of NOT of the diagonal, and technically are changing his argument from EXACTLY his argument by yours which also has no actual argument in it's conclusion. Clarify Victor Kosko (talk) 20:56, 3 May 2022 (UTC)

i hope this provides you a conclusion Pwaaben (talk) 09:00, 4 May 2022 (UTC)

diagonal = contradiction

Cantor’s diagonal argument leads to a contradiction. Assume one wishes to list all the real numbers. Cantor’s diagonal real D cannot exist until the list is completed. But the list is not completed if there exists a real that isn’t on it. Therefore the existence of D entails that both the list is completed and the list in not completed. 71.184.87.187 (talk) 19:18, 21 May 2022 (UTC)

Yes, that is exactly the structure of the argument. Are you posting it just to confirm that you've understood it? --Trovatore (talk) 20:54, 21 May 2022 (UTC)

Well, I understand that the existance of D means that both a proposition and its negation are true. Thus D does not exist. Do you understand that? 71.184.87.187 (talk) 13:52, 1 June 2022 (UTC)

My previous posts failed to disprove the CDA, primarily for not recognizing the real flaw. Persistence won.

It's non of the factors debated, but so subtle, it's almost invisible. Following the policy of not submitting original work here, I won't. Just informing the moderators and those who were deceived, and those who are free thinkers, it exists.Phyti (talk)phyti. Phyti (talk) 16:26, 13 June 2023 (UTC)

I have returned to one of the original objections to Cantor's diagonal argument. Despite the fact that finite lists are not square, using his (v, u) coordinate system in his 1891 paper for all v, he assumes v=u for an infinite list. The progression of the geometric form of finite lists is exponential with a trend opposite to square.

No one has ever formed an infinite list.

Here is an example of a finite list with {0,1} substituted for {m,w} showing no missing sequence.

2^3 = 8

position

List 1 2 3

000 x

001 x x

010 x x

011 x x x

100

101 x

110 x

111 x x

Since the list is random order, the 2nd diagonal is arbitrarily selected.

D= 011.

Its negation E (=not D) excludes 0 from position 1, and 1 from positions 2 and

3.

E=100, as the only sequence NOT excluded.

A sequence cannot differ from itself Phyti (talk) 16:52, 4 January 2024 (UTC)

Freedom of expression opposes censorship. Here is the link to the latest paper,'Cantor's Illusion".

[2] Phyti (talk) 15:12, 7 January 2024 (UTC)

[3] Phyti (talk) 15:17, 7 January 2024 (UTC)

Do I detect censorship here? Phyti (talk) 15:23, 7 January 2024 (UTC)

It is possible to match each of the three-element strings from {0,1} with a number from 1 through 8. Here is an example such a matching:

1 011

2 101

3 110

4 111

5 010

6 100

7 000

8 001

The sequence appearing along the diagonal is 000. After adding one to each entry, you obtain 111, but this already appears on the list, at spot number 4. Does this refute Cantor's diagonal argument?

The answer is that it does not. There is a key difference that separates this from Cantor's diagonal argument, which is that there are more rows in the list then there are columns. In Cantor's argument, the diagonal drawn through the list meets each row one time. This is key to the argument, because the reason the number obtained from the diagonal is not on the list is because it differs from the 1st number on the list at the 1st decimal place, it differs from the 2nd number on the list at the 2nd decimal place, etc. However, in this example, the diagonal misses some rows altogether. 111 is indeed different from the 1st listed string (011) because it differs in the 1st character, and different from the 2nd listed string at the 2nd character, and the 3rd listed string... but then, there is no reason that 111 should different from the 4th, 5th, etc. strings on the list, since we have run out of characters to compare. So it is fine for there to be a matching from the three-element strings from {0,1} with numbers from 1 through 8, since the diagonal argument needs the diagonal to meet each row once before Cantor's proof by contradiction can kick in.

However, this loophole never happens in Cantor's argument about real numbers. Given any proposed matching from the natural numbers to the real numbers, once you get the number from the diagonal and change each digit, even the trillionth number on the list must differ from this one since they both have trillionth decimal places, and they are different. There is no "running out of digits to compare" that happens with real numbers. C7XWiki (talk) 06:55, 5 March 2024 (UTC)

I’m the only decent anti set theory person you have

the exponential argument is valid, if only aplied to the proof exponential cardinal infinity does not equal the same infinity (aleph 0)

one infinity is exponential of the other to cause the set of reals be ‘all sequences of 1s and 0s’ qualified the same infinite size as the diagonal, yet one infinity must be at least the same size as the other to be able to complete the diagonal.

if you say both are simultaneously so that disproves the final conjecture.

your assuming something absolutely true that is philosophical debatable instead Victor Kosko (talk) 01:18, 7 March 2024 (UTC)

> if you say both are simultaneously so that disproves the final conjecture.

Exactly, that is where the contradiction is.

Cantor's argument is just a plain proof by contradiction, no more special than the proof of irrationality of the square root of 2. In the proof of irrationality of ${\sqrt {2}}$, you start out by making the totally wrong assumption that assume that ${\sqrt {2}}$ can be written as a ratio of integers ${\frac {a}{b}}$ reduced to lowest terms. Then over the course of the proof you show that the assumption is self-refuting, by producing proof that ${\frac {a}{b}}$ was not really reduced to begin with. Even though something totally wrong (the claim that ${\sqrt {2}}={\frac {a}{b}}$ for integers $a,b$) is assumed at the beginning, this does not make the proof wrong. Instead it is what makes the proof work at all, since it works by asking "what if ${\sqrt {2}}$ were rational?" and then showing that assumption is nonsensical, therefore showing that the only option that makes sense is for ${\sqrt {2}}$ to be irrational.

Similarly, when proving that there are infinitely many primes by contradiction, you start the proof by making the totally wrong assumption that some finite set $\{p_{1},\ldots ,p_{n}\}$ is an exhaustive list of the primes. Then the proof proceeds by showing that this assumption is absurd, by producing another prime that has to be outside of the set $\{p_{1},\ldots ,p_{n}\}$. Again, this proof starts by making the assumption "what if there were finitely many primes?", then showing that this assumption is nonsense, therefore showing the only correct option is that there are infinitely many primes.

However, with Cantor's diagonal argument, often people seem to reject the argument based on the claim that the assumption is nonsense. But this is the entire point of how proof by contradiction works, you start with the assumption that there is a complete list of the real numbers indexed by natural numbers, where when written out in decimal there are equally many columns as rows, and then show that this assumption is nonsense. Then the conclusion is that the only option that makes sense is for there to be no complete list of the real numbers with as many columns as rows, and this is what Cantor proved. C7XWiki (talk) 07:48, 7 March 2024 (UTC)

I'm tired and bored revising my paper to refute Cantor's diagonal argument 1891. The current version which I consider sufficient is available on google drive, if you or anyone else is interested. Remember it is not about any number system but the method itself. Phyti (talk) 15:13, 12 March 2024 (UTC)

Not about numbers, symbols, etc.

The diagonal is fake/imitation/counterfeit.

Latest revision only requires being conscious

https://drive.google.com/file/d/1J-5jNHE2raDD9xRwgwS6cTtrOBrTw7_j/view?usp=sharing Phyti (talk) 18:46, 4 April 2024 (UTC)

Just so we're clear, Phyti, you're preaching to the choir here: whatever you write here will do nothing to get your argument accepted or taken seriously by the mathematics community, and "I'm entitled to my opinion" is not an argument. Please also read WP:FREESPEECH, WP:SOAPBOX, and WP:NOR.--Jasper Deng (talk) 20:50, 5 April 2024 (UTC)