Homepage › Solution manuals › James Munkres › Topology › Exercise 4.2
Exercise 4.2
Prove the following “laws of inequalities” for , using axioms (1)-(6) along with the results of Exercise 1:
- (a)
- and .
- (b)
- and and .
- (c)
- .
- (d)
- .
- (e)
- and .
- (f)
- , where .
- (g)
- .
- (h)
- and are both positive or both negative.
- (i)
- .
- (j)
- .
- (k)
- .
Answers
Proof. We simply have
as desired. □
Main Problem.
- (a)
-
Proof. We have
as desired. □
- (b)
-
Proof. First, we have
Also
as desired. □
- (c)
-
Proof. Suppose that . Then we have
Suppose now that . Then we have
as desired. □
- (d)
-
Proof. Suppose that . Then we have
Now suppose that . Then we have
as desired. □
- (e)
-
Proof. First, by Exercise 4.1 part (d), we have so that by part (c). Then, since , it follows from (6) that
as desired. □
- (f)
-
Proof. Since we either have that or since the relation is an order (in particular a linear order since this is part of the definition of order in this text). If then we have by (6) (since ) and Exercise 4.1 part (b). If then we have by part (e) (since ) and Exercise 4.1 part (b). Together these show the desired result. □
- (g)
-
Proof. By (4) we know that so that by part (f). However, we have by (3). Hence . It then follows from part (c) that so that we have as desired. □
- (h)
-
Proof. Suppose that . It cannot be that , for then we would have by Exercise 4.1 part (b), which is impossible by the definition of an order. Hence we have , and an analogous argument shows that as well. We then have the following:
Case: . Suppose that . Then, by part (e) and Exercise 4.1 part (b), we have since and , which contradicts our initial supposition. Thus, since we know that , it has to be that as well.
Case: . Suppose that . Then, by (6) and Exercise 4.1 part (b), we have since and , which again contradicts the initial supposition. So it must be that also since .
Therefore in every case either both and are positive or they are both negative. Since , these cases are exhaustive so that this shows the result.
Suppose that either or . In the case where both and we clearly have by (6) and Exercise 4.1 part (b). In the other case in which and we have by part (e) and Exercise 4.1 part (b) since and . Hence in both cases. □
- (i)
-
Proof. First, it cannot be that because then we would have by (4), (2), and Exercise 4.1 part (b). This is clearly a contradiction since we know that by (3). Hence . Now suppose that so that by part (e) since and , and we have also used Exercise 4.1 part (b). This is also a contradiction since it was proved in part (g) that . Hence the only remaining possibility is that as desired. □
- (j)
-
Proof. First, since the order is transitive, we have . It then follows from part (i) that . Then by part (h). We then have
as desired. □
- (k)
-
Proof. First, we know by part (g) that so that
To summarize, . It then follows from part (i) that . We then have
Similarly, we have
This shows that as desired. □