John Jones wrote:The mapping of rational number to integer, and to squares etc, cannot, as a mapping, be restricted to following the sequence in which integers, etc are presented (1, 2, 3, 4, etc). There is no reason why a mapping of a rational number can't be mapped to the same integer twice, etc.
In examining if something is countable, you don't map rational numbers to integer -- you try to map integer numbers to whatever set's countability you intend to prove. So to prove that the rational numbers are countable, you try to find a way to go through the set of integers, and make sure that for each integer, there is exactly one rational number it maps to. There are ways to make sure that each rational number gets an integer mapped onto it (or in other words, "gets counted"). Some rational numbers get counted several times. (As in 1/1, 2/2, 3/3, ...), but that doesn't matter, because it only proves that there are still integers left over after each distinct rational number got counted.
The same issue arises when you prove that the real numbers are
not countable. Some decimal representations stand for the same real number (1=0.9999999...), and this raises possibility that the real numbers only
appear uncountable because Cantor's proof "wastes" integers. The article I pointed to acknowledges this.
Quote:(There's also a technical requirement to avoid any of the alternate decimal representations of numbers, because for example 1=0.9999... but God knows we don't want to get into that here.)
But a popular treatment of a moderately difficult mathematical point will only bear so many technical complications.