Exercise 4.2

Prove the following “laws of inequalities” for , using axioms (1)-(6) along with the results of Exercise 1:

(a)
x > y and w > zx + w > y + z.
(b)
x > 0 and y > 0x + y > 0 and x y > 0.
(c)
x > 0 x < 0.
(d)
x > y x < y.
(e)
x > y and z < 0xz < yz.
(f)
x0x2 > 0, where x2 = x x.
(g)
1 < 0 < 1.
(h)
xy > 0x and y are both positive or both negative.
(i)
x > 01x > 0.
(j)
x > y > 01x < 1y.
(k)
x < yx < (x + y)2 < y.

Answers

Lemma 1. x + x = 2x for any real x.

Proof. We simply have

x + x = x 1 + x 1 (by (3)) = x(1 + 1) (by (5)) = x 2 (since 2 is defined as 1 + 1) = 2x (by (2))

as desired. □

Main Problem.

(a)

Proof. We have

x + w > y + w (by (6) since x > y) = w + y (by (2)) > z + y (by (6) since w > z) = y + z (by (2))

as desired. □

(b)

Proof. First, we have

x + y > 0 + y (by (6) since x > 0) = y + 0 (by (2)) = y (by (3)) > 0.

Also

x y > 0 y (by (6) since x > 0 and y > 0) = 0 (by Exercise 4.1 part (b))

as desired. □

(c)

Proof. () Suppose that x > 0. Then we have

x = x + 0 (by (3)) = 0 + (x) (by (2)) < x + (x) (by (6) since 0 < x) = 0. (by (4))

() Suppose now that x < 0. Then we have

x = x + 0 (by (3)) = 0 + x (by (2)) > x + x (by (6) since 0 > x) = x + (x) (by (2)) = 0 (by (4))

as desired. □

(d)

Proof. () Suppose that x > y. Then we have

y = y + 0 (by (3)) = y + (x + (x)) (by (4)) = (x + (x)) + (y) (by (2)) = x + (x + (y)) (by (1)) > y + (x + (y)) (by (6) since x > y) = y + (y + (x)) (by (2)) = (y + (y)) + (x) (by (1)) = 0 + (x) (by (4)) = x + 0 (by (2)) = x. (by (3))

() Now suppose that x < y. Then we have

x = x + 0 (by (3)) = x + (y + (y)) (by (4)) = (y + (y)) + x (by (2)) = (y + y) + x (by (2)) = y + (y + x) (by (1)) > x + (y + x) (by (6) since  y > x) = x + (x + y) (by (2)) = (x + x) + y (by (1)) = (x + (x)) + y (by (2)) = 0 + y (by (4)) = y + 0 (by (2)) = y (by (3))

as desired. □

(e)

Proof. First, by Exercise 4.1 part (d), we have (z) = z < 0 so that z > 0 by part (c). Then, since x > y, it follows from (6) that

x(z) > y(z) (xz) > (yz) (by Exercise 4.1 part (e) applied to both sides) xz < yz (by part (d))

as desired. □

(f)

Proof. Since x0 we either have that x > 0 or x < 0 since the < relation is an order (in particular a linear order since this is part of the definition of order in this text). If x > 0 then we have x2 = x x > 0 x = 0 by (6) (since x > 0) and Exercise 4.1 part (b). If x < 0 then we have 0 = 0 x < x x = x2 by part (e) (since 0 > x) and Exercise 4.1 part (b). Together these show the desired result. □

(g)

Proof. By (4) we know that 10 so that 12 > 0 by part (f). However, we have 12 = 1 1 = 1 by (3). Hence 1 = 12 > 0. It then follows from part (c) that 1 < 0 so that we have 1 < 0 < 1 as desired. □

(h)

Proof. () Suppose that xy > 0. It cannot be that x = 0, for then we would have 0 = 0 y = xy > 0 by Exercise 4.1 part (b), which is impossible by the definition of an order. Hence we have x0, and an analogous argument shows that y0 as well. We then have the following:

Case: x > 0. Suppose that y < 0. Then, by part (e) and Exercise 4.1 part (b), we have xy < 0 y = 0 since x > 0 and y < 0, which contradicts our initial supposition. Thus, since we know that y0, it has to be that y > 0 as well.

Case: x < 0. Suppose that y > 0. Then, by (6) and Exercise 4.1 part (b), we have 0 = 0 y > xy since 0 > x and y > 0, which again contradicts the initial supposition. So it must be that y < 0 also since y0.

Therefore in every case either both x and y are positive or they are both negative. Since x0, these cases are exhaustive so that this shows the result.

() Suppose that either x > 0,y > 0 or x < 0,y < 0. In the case where both x > 0 and y > 0 we clearly have xy > 0 y = 0 by (6) and Exercise 4.1 part (b). In the other case in which x < 0 and y < 0 we have 0 = 0 y < xy by part (e) and Exercise 4.1 part (b) since 0 > x and y < 0. Hence xy > 0 in both cases. □

(i)

Proof. First, it cannot be that 1x = 0 because then we would have 1 = x(1x) = x 0 = 0 x = 0 by (4), (2), and Exercise 4.1 part (b). This is clearly a contradiction since we know that 10 by (3). Hence 1x0. Now suppose that 1x < 0 so that 1 = x(1x) < 0 (1x) = 0 by part (e) since x > 0 and 1x < 0, and we have also used Exercise 4.1 part (b). This is also a contradiction since it was proved in part (g) that 1 > 0. Hence the only remaining possibility is that 1x > 0 as desired. □

(j)

Proof. First, since the order is transitive, we have x,y > 0. It then follows from part (i) that 1x,1y > 0. Then (1x)(1y) > 0 by part (h). We then have

1 x = 1 x 1 (by (3)) = 1 x (y 1 y ) (by (4)) = (1 x y) 1 y (by (1)) = (y 1 x ) 1 y (by (2)) = y (1 x 1 y ) (by (1)) < x (1 x 1 y ) (by (6) since y < x and (1x)(1y) > 0) = (x 1 x ) 1 y (by (1)) = 1 1 y (by (4)) = 1 y 1 (by (2)) = 1 y (by (3))

as desired. □

(k)

Proof. First, we know by part (g) that 1 > 0 so that

2 = 1 + 1 (by the definition of 2) > 0 + 1 (by (6) since 1 > 0 ) = 1 + 0 (by (2)) = 1 (by (3)) > 0. (by part (g))

To summarize, 0 < 1 < 2. It then follows from part (i) that 12 > 0. We then have

x < y x + x < x + y (by (6)) 2x < x + y (by Lemma 1 ) (2x)1 2 < (x + y)1 2 (by (6) since 12 > 0) (x 2)1 2 < x + y 2 (by (2) and the definition of division) x (2 1 2 ) < x + y 2 (by (1)) x 1 < x + y 2 (by (4)) x < x + y 2 . (by (3))

Similarly, we have

x < y x + y < y + y (by (6)) x + y < 2y (by Lemma 1 ) (x + y)1 2 < (2y)1 2 (by (6) since 12 > 0) x + y 2 < (y 2)1 2 (by the definition of division and (2)) x + y 2 < y (2 1 2 ) (by (1)) x + y 2 < y 1 (by (4)) x + y 2 < y. (by (3))

This shows that x < (x + y)2 < y as desired. □

User profile picture
2019-12-01 00:00
Comments