2 ms·
Thanks for your time and attention on the matter; I've enjoyed the thread. I think you might have convinced me on that point; certainly my attempts to follow up
by roenxi 6y ago
Thanks for your time and attention on the matter; I've enjoyed the thread. I think you might have convinced me on that point; certainly my attempts to follow up were incoherent to the point where even I could tell.
> I really don't understand your objection
Bob's strategy is bunk, we've started by assuming something that is false. Therefore, the assumption that the reals are countable might already invalidate the proof that a bounded but monotonically increasing sequence converges. If that assumption is invalid, then the argument in this proof might already fail even before the contradiction we later identify. So it is obvious to me we're going to have a contradiction. But the contradiction might be elsewhere than in the true facts that the proof gives. So the proof might not be correct.
I suppose I accept the proof will find a contradiction, but I'm not sure that the contradiction it found was the first one to arise. I can imagine that this might be a proof that Bob has a winning strategy without further argument:
* Reals are countable
* Bounded monotonic increasing sequence converges to a Real
* These are inconsistent assumptions so I can prove anything
* Therefore Bob has a winning strategy
So that means all the additional logic the proof adds in has to be re-verified from first principles to ensure that everything is still valid and internally consistent as far as it went after assuming that the reals are countable. I'm not good enough at maths to know that this specific proof of a winning strategy doesn't contain subtle flaws, so I don't trust it (maybe proof by contradiction just isn't for me). I struggle to accept it as simpler - the Cantor proof constructs a direct counterexample and is very satisfying to me.