Homepage › Solution manuals › James Munkres › Topology › Exercise 10.4
Exercise 10.4
- (a)
- Let denote the set of negative integers in the usual order. Show that a simple ordered set fails to be well-ordered if and only if it contains a subset having the same order type as .
- (b)
- Show that if is simply ordered and every countable subset of is well-ordered, then is well-ordered.
Answers
(a)
Proof. Let be a set with simple order .
Suppose that is not a well-ordering of . Then there exists a nonempty subset of such that has no smallest element. For any define the set . Clearly and for any since otherwise would be the smallest element of . Now let be a choice function on the collection of nonempty subsets of , which of course exists by the axiom of choice. Since is nonempty there is a . It then follows from the principle of recursive definition that there is a function such that
It then is easy to show that for all , i.e. that the sequence defined by is decreasing. If we then simply define by for , it is clear that is an order-preserving bijection from to some subset of . Clearly also since . Hence the subset has the same order type as .
Now suppose that has a subset with the same order type as . Clearly then is nonempty and has no smallest element since does not. The existence of this shows that fails to be well-ordered. □
(b)
Proof. Suppose that is a set that is simply ordered by such that every countable subset is well-ordered by . Consider any nonempty subset . Suppose for a moment that the restricted does not well-order . Then it follows from part (a) that has a subset with the same order type as . However, clearly (since ) and is countable (since is countable) and thus it should be well-ordered. As this is impossible since has the same order type as (which is clearly not well-ordered), it has to be that the restricted does in fact well-order . Hence has a -smallest element, which shows that is well-ordered since was arbitrary. □