quote
Its result can be used to show that the notion of the [set of all sets]? is an inconsistent notion; if S would be the set of all sets then P(S) would at the same time be bigger than S and a subset of S.
end quote
Can the diagonal argument really do this? If we accept the existence of uncountable infinities (and i guess you do if you accept the diagonal argument) then it is pretty clear that the set of all sets must be of uncountable size if it exists. How do you define an ordered list of elements of an uncountable set? If you can't define an ordered list, how do you apply the diagonal argument? (Maybe you can, but it's not immediately obvious how. I think a bit more needs to be written about this if the above quote is to remain.)
If you look at the second proof you can see that it makes no assumptions about S being ordered. That is in fact the main difference between the actual diagonalization argument and its generalization that is used in the second proof. I will add a remark that the second proof is not equal to the actual diagonal argument but a generalization of it. -- Jan Hidders
That sounds good to me. Thanks.
OTOH, the line:
seems like pure and utter bunk. 0.01999... and 0.02000... are only the same number to computers, who can't see off into infinity. In the mathematical world, they're completely different.
Or has it been too long since my math degree?
Could you be slightly more terse? :-) Seriously, please expand. Wikipedia demands proof!
Here's another argument: look at the formula for geometric series, and then calculate 0.999999... = 9/10 + 9/100+ 9/1000 + 9/10000 + .... = 9 ( 1/10 + (1/10)2 + (1/10)3 + ... ) = 9 ( 1 / (1 - 1/10) - 1) = 1. --AxelBoldt
Or
1/3 0.333... + 2/3 + 0.666... ----- ---------- 3/3 = 0.999... = 1
Excellent arguments, all -- thanks! I sit corrected. -- NK