Exercise 4.8

(a)
Show that has the greatest lower bound property.
(b)
Show that inf {1nn +} = 0.
(c)
Show that given a with 0 < a < 1, inf {ann +} = 0. [Hint: Let h = (1 a)a, and show that (1 + h)n 1 + nh.]

Answers

(a)

Proof. Suppose that A is an arbitrary nonempty set of real number that is bounded below by a. Now let B = {xx A} and b = a. First, we claim that b is an upper bound of B. So consider any y B so that y = x for some x A. Then a x since a a lower bound of A. It then follows from Exercise 4.2 part (d) that y = x a = b. Since y B was arbitrary, this shows that b is an upper bound of B.

Since B is clearly nonempty (since A is), we have that B has a least upper bound d = sup B since the reals have the least upper bound property. We claim that c = d is the greatest lower bound of A. So first consider any x A so that y = x B. Then we have y d since d = sup B. Hence c = d y = x again by Exercise 4.2 part (d). Since x A was arbitrary, this shows that c is in fact a lower bound of A.

Now suppose that x is any lower bound of A. Then, by the same argument as above for b = a, we have that y = x is an upper bound of B. It then follows that d y since d is the least upper bound of B. Then, again by Exercise 4.2 part (d), we have x = (x) = y d = c, which shows that c is in fact the greatest lower bound since x was arbitrary. This completes the proof. □

(b)

Proof. First, let A = {1nn +} so that we must show that inf A = 0. For any x A we have that x = 1n for some n +. Then n > 0 so that x = 1n > 0 also by Exercise 4.2 part (i). Hence 0 x is true, which shows that 0 is a lower bound of A since x was arbitrary.

Now consider any x > 0 so that also 1x > 0 by Exercise 4.2 part (i). Then, by the Archimedean ordering property there is an n + such that n > 1x > 0 (since otherwise 1x would be an upper bound of +). It then follows from Exercise 4.2 part (j) that 1n < 1(1x) = x. Since clearly 1n A we have that x is not a lower bound of A. Since x > 0 was arbitrary, this shows that 0 is the greatest lower bound of A since, by the contrapositive, x being a lower bound of A implies that x 0. □

(c)

Proof. Consider any real a where 0 < a < 1. First we show that the set {1ann +} has no upper bound. To this end define h = (1 a)a = 1a 1 so that 1 + h = 1 + (1a 1) = 1a. Clearly we have

a < 1 a > 1 1 a > 1 1 = 0 1 a a > 0 a = 0 (since a > 0) h > 0

so that 1 + h > 1 > 0 and

h > 0 h2 > h 0 = 0 (since h > 0) nh2 > n 0 = 0

for any n + since n > 0.

We show by induction that (1 + h)n 1 + nh for all n +. For n = 1 we clearly have (1 + h)n = (1 + h)1 = 1 + h 1 + h = 1 + 1 h = 1 + nh. Now, supposing that (1 + h)n 1 + nh,we have

(1 + h)n+1 = (1 + h)n(1 + h) (1 + nh)(1 + h) (since 1 + h > 0) = 1 + nh + h + nh2 1 + nh + h (since nh2 > 0) = 1 + (n + 1)h,

which completes the induction. So consider any real x. Then, since we know that + has no upper bound, there is an n + where n > xh (noting that h > 0) so that

n > xh nh > (xh)h = x (since h > 0) 1 + nh > 1 + x > x.

Then we have 1an = (1a)n = (1 + h)n 1 + nh > x, which shows that the set {1ann +} is unbounded above since x was arbitrary.

Now we show the main result. Let A = {ann +} so that we must show that inf A = 0. First we show by induction that 0 is a lower bound of A. For n = 1 we clearly have an = a1 = a 0. Then, if an 0, we have an+1 = an a 0 a = 0 since a > 0. This completes the induction so that clearly 0 is indeed a lower bound of A.

Now consider any real x > 0 so that 1x > 0 also. Then, by what was shown above, we know that there is an n + such that 1an > 1x > 0. We then have an = 1(1an) < 1(1x) = x by Exercise 4.2 part (j). This shows that x is not a lower bound of A since obviously an A. It then follows that 0 is the greatest lower bound of A since x > 0 was arbitrary, because, by the contrapositive, x being a lower bound of A implies that x 0. Hence 0 = inf A as desired. □

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