Section 10: Problem 6 Solution
Working problems is a crucial part of learning mathematics. No one can learn topology merely by poring over the definitions, theorems, and examples that are worked out in the text. One must work part of it out for oneself. To provide that opportunity is the purpose of the exercises.
James R. Munkres
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.
(a) A section by any element must be countable, however, if there were the largest element 
, the section 
 would be uncountable.
(b) 
 is uncountable, therefore, at least one of the sets on the right must be uncountable.
(c) Every countable subset of 
 has an upper bound (Theorem 10.3). Suppose 
 is countable, and 
 is its upper bound. Using (a) and Exercise 2(a), every 
 has an immediate successor, which we call 
. Then, the set 
 is a countable, hence, bounded from above subset of 
. According to Exercise 1, 
 has the least upper bound, call it 
. Then, 
 has no immediate predecessor. Indeed, suppose 
 is an immediate predecessor of 
, but then, 
 for some 
, and 
. We conclude that 
, and 
. Contradiction.
In few words, the two facts that (a) every countable subset of 
 is bounded from above, and (b) for every element of 
 there is a greater element that has no immediate predecessor, imply that 
 cannot be bounded from above, and, hence, cannot be countable.
