The Axiom of Choice is Wrong (2007)
cornellmath.wordpress.com
cornellmath.wordpress.com
I can't help him there.
I can kind of grasp the continuum hypothesis, there does seem to be a distinction between countable and uncountable infinity. Continuing the game beyond that to this area of large cardinals strikes me as just a language game.
Most mind blowing, IMHO, is Cantor's middle third's set[1]. Uncountable nowhere dense totally disconnected, ... it's an amazing set and so easy to construct.
Comparing the cardinality of the natural and real numbers doesn't have much to do with the continuum hypothesis. It's simply true that there are many many many more reals than rationals. It's not a hypothesis.
But I do agree that the Cantor set is pretty awesome.
The Axiom of Choice is also independent of ZF set theory. Have you read the more modern expositions of these independence proofs based on various Topoi?
So the first guy says the sum, not a color? If he's allowed to say arbitrary things he can as well tell everyone their color "next guy is white, next green, etc.".
The set of equivalence classes of infinite strings is uncountable, so using the axiom of choice here is invalid.
As far as I know, the countable one is still reasonable.
Let's say we have a infinitely long bit string, b. This equivalence class has an infinite number of elements in it! That is, there is an infinite number of strings with suffix b.
b, 0b, 1b, 00b, 01b, 10b, 11b, etc.
Can you use the axiom of choice in this case? I think it is required that each bin has a finite number of objects, even though there are infinite bins.
Yes, you can.
> I think it is required that each bin has a finite number of objects, even though there are infinite bins.
No, the axiom says only that the product of nonempty sets is nonempty. It doesn't say anything about the number of sets or their sizes.
For those who don't see the connection: Each element of a product of sets consists of a choice of one item from each set. Saying the product is nonempty is saying there is a way to make such choices. For example, the product of {1,2} and {a,b} contains, among other things, the pair (1, b), which can be thought of as choosing 1 from the first set and b from the second.
There are restricted versions of the Axiom of Choice (e.g., Countable Choice, Dependent Choice); however, none of these are called "the Axiom of Choice".
The only way out of this is for 1b and b to actually be the same equivalence class, that is, that of b. But, can we do that? I feel like that is wrong.
I think it's clearer if you describe things the way the article does. Don't say "these are the classes"; say "here is the relation".
As the article says:
> Call two such sequences ‘equivalent’ if they are equal after a finite number of entries.
To see whether this is an equivalence relation, you only need to check whether it is reflexive, symmetric, and transitive. Figuring out what the classes are, might be interesting, but it is not necessary.
18x belongs in the 8x class, but 28x belongs in both the 28x and 8x classes.
I think the author meant for you to interpret "equal after a finite number of entries" in the more normal fashion (e.g., 123x = 456x but 1x != 111x, the prefixes have to have equal length.) But your way seems to work fine too.