You can set up a one to one correspondence between all the points on a line (or in a square or in a cube) and all the clock faces a working clock can produce but you cannot do the same with all possible clock faces.
The set of all clock faces a working clock can produce - call this the set of all valid clock faces - has the same topology (and cardinality) as a circle. The set of all possible clock faces has the same topology (and cardinality) as a 2-dimensional torus.
However, the cardinality of a 2-dimensional torus is the same as the cardinality of a square, which is the same as the cardinality of a line (as you yourself recognize), which is the same as the cardinality of a circle.
Therefore the set of all valid clock faces has the same cardinality as the set of all possible clock faces.
the faces a working clock can produce is just ONE way all real numbers can be paired together, the power set is ALL the ways 2 real numbers can be paired together, it has a larger cardinality than the points on a line and is the number of all possible clock faces.
A power set indeed has a larger cardinality than the set it is a power set of. However, the set of all possible clock faces is not the power set of the set of all valid clock faces.
Subscribe to RSS Feed
= f037147d6e6c911a85753b9abdedda8d)
Firstly, thank you for stating what you meant by clock faces. You should really have stated that explicitly, though, as it's not a standard term. Also I had to read that twice to notice you were making a distinction between "clock faces" and "valid clock faces".
But this is simply wrong:
If S is strictly contained in T, and S is a finite set, then T necessarily has strictly larger cardinality than S. The same does not hold for infinite sets - this is just the old "Galileo's paradox"; Z has the same cardinality as N despite strictly containing it.
EDIT: Sorry, I wrote something wrong here before due to misreading! Thanks to steven0461 for catching the real problem.
You seem to be equivocating between C and the power set of C. C is in bijection with R, its power set is not. (And since C is in bijection with R, its introduction was really unnecessary - you could have just used the power set of R.) (You also seem to be using unordered pairs when you want ordered pairs, but that's a more minor issue.)
In short this has a number of errors (fortunately they seem to be discrete, specifically locatable errors) and I suggest you go back and reread your basic set theory.
How did Cantor prove that there were more real numbers than integers? He set up a mapping between every single integer and a unique real number and then showed that there were still some real numbers not associated with an integer; this proved that the real numbers had a larger cardinality than the integers.
In the same way I can show you a mapping that associates every single real number with a unique clock face (all the clock faces a properly working clock can produce in this case) but I can also show you clock faces (an infinite number of them in fact) that are not involved in this mapping; I can show you clock faces not associated with a real number, thus the number of all possible clock faces must have a larger cardinality than the real numbers.
It's incontrovertible that every number on the real number line is associated with unique clock face and it's also incontrovertible that not every clock face is associated with a unique number on the real number line; this is the very method one uses to determine the cardinality of infinite sets, it worked for Cantor and the logic is ironclad.
John K Clark