Homepage › Solution manuals › James Munkres › Topology › Exercise 10.6
Exercise 10.6
Let be the minimal uncountable well-ordered set.
- (a)
- Show that has no largest element.
- (b)
- Show that for every , the subset is uncountable.
- (c)
- Let be the subset of consisting of all elements such that has no immediate predecessor. Show that is uncountable.
Answers
Proof. If we let , then clearly . If were countable then would be countable by Theorem 7.5 since is also countable. Since we know that is uncountable it, therefore, must be that is uncountable as well. □
Main Problem.
It is assumed in the following that is the well-order on .
(a)
Proof. Suppose to the contrary that does have a largest element . Then, for any , we have that . Hence either or . Therefore since clearly both and are both subsets of . Now since is a section of , it is countable. Since is also clearly countable, it follows from Theorem 7.5 that their union is countable. But this contradicts the fact that is uncountable! Hence it has to be that has no largest element as desired. □
(b)
Proof. Consider any . Let so that we must show that is uncountable. Let so that clearly we have that . It is then easy to show that . Now, since is a section of , it is countable so that clearly is also countable by Theorem 7.5. Then, since itself is uncountable, it follows that is also uncountable by Lemma 1 . □
(c)
Proof. First, we show that is not bounded above. Assume the contrary so that is an upper bound of . It then follows that the set is such that every element of has an immediate predecessor since otherwise there would be a where so that would not be an upper bound of since then .
Now, we know from part (a) that has no largest element so it follows from Exercise 10.2 that every element of has an immediate successor. Since it follows that each element has an immediate successor . Moreover, we then have that so that also. Hence every element of has an immediate successor in .
Now, we know that is uncountable by part (b) so that it has a smallest element since it is then a nonempty subset of the well-ordered . We derive a contradiction by showing that has the same order type as and is thus countable. We do this by defining an increasing bijection . First, set and then set to the immediate successor of for , which was shown to exist above. Then the function uniquely exists by the principle of recursive definition. Clearly we have that for all since is the immediate successor of . Hence is increasing and therefore also injective.
To show that is surjective suppose the contrary so that the set is non-empty. Since clearly, this is a subset of the well-ordered , it has a smallest element . Now, we know that so that , and in fact since is the smallest element of . Since we know that it has an immediate predecessor and that so that . However, it cannot be that since and is the smallest element of . Thus so that there is an where . But then since is the immediate successor of . As this contradicts the fact that , it must be that is in fact surjective!
Therefore we have shown that is a bijection from to so that is countable. But we know from part (b) that is uncountable. As mentioned above, this is a contradiction so it must be that indeed is not bounded above. From this, it immediately follows from the contrapositive of Theorem 10.3 that must be uncountable. □
It is interesting to note that corresponds to the ordinal number , which is the first uncountable ordinal, and the set of part (c) corresponds to the set of limit ordinals in . All of the curious properties deduced here for apply to too, assuming we allow the choice axiom.