Homepage › Solution manuals › James Munkres › Topology › Exercise WO.8
Exercise WO.8
Using Exercises 1-4, construct an uncountable well-ordered set, as follows. Let be the collection of all pairs , where is a subset of and is a well-ordering of . (We allow to be empty.) Define if and have the same order type. It is trivial to show that this is an equivalence relation. Let denote the equivalence class of ; let denote the collection of these equivalence classes. Define
if has the order type of a section of .
- (a)
- Show that the relation is well defined and is a simple order on . Note that the equivalence class is the smallest element of .
- (b)
- Show that if is an element of , then has the same order type as the section of by . [Hint: Define a map by setting for each .]
- (c)
- Conclude that is well-ordered by .
- (d)
- Show that is uncountable. [Hint: If is a bijection, then gives rise to a well-ordering of .]
Answers
(a)
Proof. First, to show that is well defined, suppose that and that and . Then has the same order type as a section of so that there is an order-preserving map from onto a section of . We also then have that has the same order type as since they are in the same equivalence class. Thus there is an order-preserving bijection . Likewise, there is an order-preserving bijection from . It is then trivial to show that is a bijection from onto a section of that preserves order. Hence has the same order type as a section of . Since and were arbitrary elements in their respective equivalence classes, this shows that is well defined such that it does not matter which representatives we use from the equivalence classes.
Now consider any equivalence class in . Then clearly it cannot be that since this would mean that has the same order type as a section of itself, which would contradict what was shown in Exercise WO.2 part (b). Thus is nonreflexive.
Next consider two distinct equivalence classes and . Then it cannot be that and have the same order type, for then they would be the same equivalence class. Then, by EExercise WO.4 part (a), it must be that either has the same order type as a section of or vice-versa. Clearly then, in the former case , and in the latter case . This shows that has the comparability property.
Lastly, suppose that and . Then has the same order type as section of so that there is an order-preserving bijection from onto a section of Likewise, there is an order-preserving bijection from onto a section of . It is then trivial to show that is an order-preserving bijection from onto a section of . It then clearly follows that , which shows that is transitive.
Hence we have shown that satisfies all the requirements of a simple order. □
(b)
Proof. Following the hint, define the map by setting
for any , noting that clearly is well-ordered by the restricted so that the equivalence class is valid and in .
Consider any and in where . Then clearly but (since it is not true that ) so that and are distinct sets. We also clearly have that so that has the same order type (the identity function is the required order-preserving map) as a section of . Hence
so that preserves order since and were arbitrary.
Now we show that is onto . So consider any equivalence class in and hence
so that by definition has the same order type as some section . Hence and are the same equivalence class! Therefore
which of course shows the desired property since was arbitrary.
This shows that is an order-preserving map from onto so that they have the same order type. □
(c)
Proof. Consider any nonempty subset . Thus there is an . If is the smallest element of then we are done, so assume that this is not the case so that there is a where . Now, it was shown in part (b) that has the same order type as the section so this section must be well-ordered since is. Also we have that since . Thus so that is a nonempty subset of so has a smallest element since is well-ordered. In particular, we of course have that , where we use to denote or equal to.
We claim that must be the smallest element of . If not, then there is a where . Of course, we also then have that and hence . Therefore , but since this contradicts the definition of as the smallest element of . So it must be that in fact, is the smallest element of , which shows that is well-ordered by since was an arbitrary subset. □
(d)
Proof. Following the hint, suppose that is countable so that there is a bijection . This of course gives rise to a well-ordering of by simply ordering its elements according to its bijection with , which was shown to be well-ordered in part (c). Then we have that is an element of since is a subset of itself. Thus the equivalence class is an element of . But we know from part (b) that then has the same order type as the section . Since we also know that has the same order type as itself, it follows that has the same order type as its section This was shown not to be possible in EExercise WO.2 (b) so that a contradiction has been reached. So it must be that in fact, is uncountable as desired □