Exercise 4.10

Show that every positive number a has exactly one positive square root, as follows:

(a)
Show that if x > 0 and 0 h < 1, then (x + h)2 x2 + h(2x + 1), (x h)2 x2 h(2x).
(b)
Let x > 0. Show that if x2 < a, then (x + h)2 < a for some h > 0; and if x2 > a, then (x h)2 > a for some h > 0.
(c)
Given a > 0, let B be the set of all real numbers x such that x2 < a. Show that B is bounded above and contains at least one positive number. Let b = sup B; show that b2 = a.
(d)
Show that if b and c are positive and b2 = c2, then b = c.

Answers

Lemma 1. If x and x2 < 1, then x < 1 also.

Proof. Suppose that x 1. If x = 1 then clearly x2 = 11 = 1. On the other hand, if x > 1 then clearly x2 = x x > 1 x = x > 1 by property (6) since x > 1 > 0. Thus in either case x2 1 so that we have shown that x 1 implies that x2 1. It then follows that x2 < 1 implies x < 1 by the contrapositive. □

Lemma 2. If 0 < y < x then 0 < y2 < x2.

Proof. Supposing that 0 < y < x, we have 0 = 0 y < y y = y2 = y y < x y = y x < x x = x2 all by property (6) since both x and y are positive. □

Main Problem.

(a)

Proof. First, we know that 0 h < 1. If h = 0 then clearly h = 0 = 02 = h2 so that 0 h2 h is true. If h0 then 0 < h < 1 so that 0 = 0 h < h h = h2 < 1 h = h by property (6) since h > 0 so that again 0 h2 h is true.

We then have

(x + h)2 = (x + h)(x + h) = x2 + 2xh + h2 x2 + 2xh + h (since h2 h) = x2 + h(2x + 1).

Also

(x h)2 = (x h)(x h) = x2 2xh + h2 x2 2xh + 0 (since h2 0) = x2 h(2x),

which show the desired results. □

(b)
We modify this result so that the h in the second part is not just positive but also h < x. In fact, without this stipulation, the theorem becomes obvious since any arbitrarily large h will suffice. Because then then x h is arbitrarily large in magnitude (but negative) so that (x h)2 can be made arbitrarily large so that of course (x h)2 > a. Adding the stipulation that 0 < h < x makes the theorem more useful and is necessary for it to be of use in part (c) below.

Proof. Suppose that x > 0. Then clearly 2x > 2 0 = 0 as well. Also it then follows that 2x + 1 > 1 > 0.

If x2 < a then clearly 0 < a x2. Hence we have that 0 < (a x2)(2x + 1) by Exercise 4.2 parts (i) and (h) since both a x2 and 2x + 1 are positive. So let y = min (1,(a x2)(2x + 1)) so that clearly both y 1 and y (a x2)(2x + 1). Since 0 < 1 and 0 < (a x2)(2x + 1), we have that 0 < y so that it follows from Exercise 4.9 part (d) that there is a rational h such that 0 < h < y. Hence 0 < h < y 1 so that, by part (a), we have

(x + h)2 x2 + h(2x + 1) < x2 + (a x2 2x + 1 ) (2x + 1)(since h < y (a x2)(2x + 1) and 2x + 1 > 0) = x2 + (a x2) = a.

If x2 > a then clearly x2 a > 0. Then we have again that (x2 a)(2x) is positive since we showed previously that 2x is. So let y = min (1,(x2 a)(2x),x) so that clearly y 1, y (x2 a)(2x), and y x. Since both 1, (x2 a)(2x), and x are all positive it follows that 0 < y so that there is a rational h such that 0 < h < y by Exercise 4.9 part (d). Therefore 0 > h > y. Since 0 < h < y 1 we have by part (a) that

(x h)2 x2 h(2x) > x2 (x2 a 2x ) (2x)(since  h > y (x2 a)(2x) and 2x > 0) = x2 (x2 a) = a,

which show the desired results since clearly 0 < h < y x. □

(c)

Proof. Suppose that a > 0 and let B = {x x2 < a}.

If a < 1 then 0 < a < 1 so that a2 = a a < 1 a = a so that a itself is in B (and of course a is positive). Now consider any x B so that x2 < a. Then x2 < a < 1 so that also x < 1 by Lemma 1 . Since x B was arbitrary, this shows that 1 is an upper bound of B.

If a 1 then (12)2 = 122 = 14 < 1 a so that 12 B (and of course 12 is positive). Now consider any x B so that x2 < a. If x 1 then x 1 a. On the other hand, if x > 1 then x2 = x x > 1 x = x since x > 1 > 0 so that x < x2 < a. Thus in both cases x a so that a is an upper bound of B since x was arbitrary.

Therefore in each case B contains a positive element (so that b) and B is bounded above. It then follows that B has a least upper bound b (so that b = sup B). Clearly since B has a positive element x, it follows that 0 < x b so that b is positive.

Now suppose that b2 < a. Then by definition b B so that b has to be the largest element of b since it is the least upper bound. Since we know that b is positive and b2 < a, it follows from part (b) that there is an h > 0 where (b + h)2 < a and hence b + h B. However, since h > 0, it follows that b < b + h, which contradicts the fact that b is the greatest element of B. Hence it cannot be that b2 < a.

So suppose that b2 > a. Then again by part (b) there is an h where 0 < h < b such that (b h)2 > a. Now, since h > 0, it follows that b h < b so that n h is not an upper bound of B (since then b would not be the least upper bound). Hence there is an x B such that b h < x, noting that x2 < a by the definition of B. Since h < b, we have that 0 < b h < x so that (b h)2 < x2 < a by Lemma 2 . But this contradicts the established fact that (b h)2 > a so that it cannot be that b2 > a.

Thus the only possibility remaining is that b2 = a as desired. □

(d)

Proof. Suppose that b and c are positive and that b2 = c2. If it were the case that b < c then 0 < b < c so that 0 < b2 < c2 by Lemma 2 so that clearly b2c2. As this is a contradiction, it has to be that b c. An analogous argument shows that b > c also leads to a contradiction so that b c. Hence it must be that b = c as desired. □

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