Re:Was Cantor Wrong? Are the real numbers countable?
by freefrancisco on Wednesday December 04, 2013 @12:13AM
(#6845158)
Thanks for your reply, the index of finite size is the part where I was confused.
I have actually done some googling about this before, and never caught it, because I wasn't exactly sure where I was uneasy. This has bothered me for a while, but reading that post in HN prompted me to think about it more, and I started writing my thoughts in a communicable manner in order to organize my own thinking. I figured publishing it and submitting it to HN would be a very effective way to get immediate feedback. In HN if you are wrong people will gladly let you know quickly. Also putting it in HN helps prompt people to post and argue about it and other ideas that are related, so it's an interesting and fun discussion.
For your binary tree construction, a trancedental real number can be represented by a path of infinite length down the tree. Your argument is that since a breadth first traversal will eventualy exhaust that whole path, that the real number described by it will have been encountered. There are two ways to interpret what you are doing wrong:
- If we are indexing/pairing these nodes by time steps (an index), your construction is using a countably infinite time step to express the numbers described by an entire path (which defeats the point of being countable).
- For countable sets, you have to give me an index of finite size. If I give you a real number, you need to return a natural number (or equivalent) that indicates where it is. To test this, give me the index of pi in your claimed "countable" enumeration. The reason you wont be able to somewhat follows from Cantor's diagonalization scheme.
You might want to do some Googling before spending the time to write up an entire blog post about it (god forbid posting it to HN). The mistake you made is very common and has been discussed to death. You would have caught it.