Homepage › Solution manuals › James Munkres › Topology › Exercise 9.8
Exercise 9.8
Show that and have the same cardinality. [Hint: You may use the fact that every real number has a decimal expansion, which is unique if expansions that end in an infinite string of 9’s are forbidden.]
A famous conjecture of set theory, called the continuum hypothesis, asserts that there exists no set having cardinality greater than and lesser cardinality than . The generalized continuum hypothesis asserts that, given the infinite set , there is no set having greater cardinality than and lesser cardinality than . Surprisingly enough, both of these assertions have been shown to be independent of the usual axioms of set theory. For a readable expository account, see [Sm].
Answers
Proof. Since and have the same cardinality there is a bijection . We define a bijection . So, for any , set . Clearly , since is the range of , so that and hence can be the range of .
To show that is injective, consider sets and in so that . Also suppose that so, without loss of generality, we can assume that there is an where . Clearly since . Were it the case that then there would be a such that . But then we would have that since is injective and hence , which we know not to be the case. Hence so that it has to be that since . Since and were arbitrary this shows that is injective.
To show that is surjective consider any so that . Let , noting that is a bijection from to since is bijective. Clearly since is the range of so that . Now consider any so that there is an where . Then, since , there is a where , and hence . Thus so that since was arbitrary. Now consider and let so that clearly . Moreover, so that . Thus as well since was arbitrary. This shows that , from which we conclude that is surjective since was arbitrary.
Hence is a bijection so that and have the same cardinality by definition. □
Main Problem.
Proof. We show this using the Cantor-Schroeder-Bernstein (CSB) Theorem, which was proven in Exercise 7.6 part (b).
First, we construct an injective function from to . For any let so that clearly and hence . Therefore setting means that is a function from to . To show that is injective consider where . Without loss of generality, we can assume that so that there is a where since the rationals are order-dense in the reals. Also set and . Since we have that . Analogously, since we have that . Thus it has to be that , which shows that is injective since and were arbitrary.
Now, it was shown in Exercise 7.1 that is countably infinite and thus has the same cardinality as . From Lemma 1 it then follows that has the same cardinality as so that there is a bijection . Clearly then is an injection from to .
Now let , and we construct an injection . For any sequence set to the decimal expansion , where clearly each is the digit 0 or 1. Clearly is a real number so that is a function from to . It is easy to see that is injective since different sequences will result in different decimal expansions. Since none of the expansions end in an infinite sequence of 9’s, clearly the corresponding real numbers will be different.
Now, it was shown in Exercise 7.3 that and have the same cardinality so that there is a bijection . It then follows that is an injection of into . Since we have shown the existence of both injections, the result follows from the CSB Theorem. □