« Supplementary Exercises*: Well-Ordering: Problem 5 Solution

Supplementary Exercises*: Well-Ordering: Problem 7 Solution »

Supplementary Exercises*: Well-Ordering: 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
Use Exercises 1 and 5 to prove the following:
Theorem. The maximum principle is equivalent to the well-ordering theorem.
Given the maximum principle and a nonempty set we need to construct a well-ordering on . Consider the strict partial order on the collection of well-ordered subsets of as in Exercise 5. The collection is not empty as, for example, there are finite well-ordered subsets of . By the maximum principle, there exists a maximal ordered subcollection of . Take the union of all subsets of in , a well-ordered subset of (Exercise 5(b)). If there is , then , where is the extension of defined by for all , is a well-ordered subset of , and it is strictly -greater than any subset in , as . But this contradicts the maximality of , as . So, and is a well-ordering on .
Given the well-ordering theorem and a nonempty set together with a strict partial order , we need to prove that there is a maximal ordered subset of . Let be a well-ordering on , and by the general principle of recursive definition (Exercise 1), we construct using Then, if it is -ordered, and otherwise (sections are all with respect to ). The idea is exactly as in the text: take all elements one-by-one in some order, and see if you can add each one to the existing ordered subset so that the resulting subset is still ordered. Note, that is an -ordered subset of , and is always a suborder of . Hence, the union is an ordered subset of (this is similar but even either than Exercise 5(b)). Further, it is a maximal ordered subset of . Indeed, if some , then is not ordered, neither is .