Homepage › Solution manuals › James Munkres › Topology › Exercise 4.10
Exercise 4.10
Show that every positive number has exactly one positive square root, as follows:
- (a)
- Show that if and , then
- (b)
- Let . Show that if , then for some ; and if , then for some .
- (c)
- Given , let be the set of all real numbers such that . Show that is bounded above and contains at least one positive number. Let ; show that .
- (d)
- Show that if and are positive and , then .
Answers
Proof. Suppose that . If then clearly . On the other hand, if then clearly by property (6) since . Thus in either case so that we have shown that implies that . It then follows that implies by the contrapositive. □
Proof. Supposing that , we have all by property (6) since both and are positive. □
Main Problem.
- (a)
-
Proof. First, we know that . If then clearly so that is true. If then so that by property (6) since so that again is true.
We then have
Also
which show the desired results. □
- (b)
- We modify this result so that the
in the second part is not just positive but also
. In
fact, without this stipulation, the theorem becomes obvious since any arbitrarily large
will suffice.
Because then then
is arbitrarily large in magnitude (but negative) so that
can be made arbitrarily large so that of course
. Adding the
stipulation that
makes the theorem more useful and is necessary for it to be of use in part (c)
below.
Proof. Suppose that . Then clearly as well. Also it then follows that .
If then clearly . Hence we have that by Exercise 4.2 parts (i) and (h) since both and are positive. So let so that clearly both and . Since and , we have that so that it follows from Exercise 4.9 part (d) that there is a rational such that . Hence so that, by part (a), we have
If then clearly . Then we have again that is positive since we showed previously that is. So let so that clearly , , and . Since both 1, , and are all positive it follows that so that there is a rational such that by Exercise 4.9 part (d). Therefore . Since we have by part (a) that
which show the desired results since clearly . □
- (c)
-
Proof. Suppose that and let .
If then so that so that itself is in (and of course is positive). Now consider any so that . Then so that also by Lemma 1 . Since was arbitrary, this shows that is an upper bound of .
If then so that (and of course is positive). Now consider any so that . If then . On the other hand, if then since so that . Thus in both cases so that is an upper bound of since was arbitrary.
Therefore in each case contains a positive element (so that ) and is bounded above. It then follows that has a least upper bound (so that ). Clearly since has a positive element , it follows that so that is positive.
Now suppose that . Then by definition so that has to be the largest element of since it is the least upper bound. Since we know that is positive and , it follows from part (b) that there is an where and hence . However, since , it follows that , which contradicts the fact that is the greatest element of . Hence it cannot be that .
So suppose that . Then again by part (b) there is an where such that . Now, since , it follows that so that is not an upper bound of (since then would not be the least upper bound). Hence there is an such that , noting that by the definition of . Since , we have that so that by Lemma 2 . But this contradicts the established fact that so that it cannot be that .
Thus the only possibility remaining is that as desired. □
- (d)
-
Proof. Suppose that and are positive and that . If it were the case that then so that by Lemma 2 so that clearly . As this is a contradiction, it has to be that . An analogous argument shows that also leads to a contradiction so that . Hence it must be that as desired. □