Exercise 3.15

Assume that the real line has the least upper bound property.

(a)
Show that the sets [0,1] = {x0 x 1}, [0,1) = {x0 x < 1}

have the least upper bound property.

(b)
Does [0,1] × [0,1] in the dictionary order have the least upper bound property? What about [0,1] × [0,1)? What about [0,1) × [0,1]?

Answers

(a)
We show this for both sets simultaneously as their proofs are nearly identical. We note the minor differences in parentheses.

Proof. Let A = [0,1] (or A = [0,1)) and consider any nonempty subset A0 of A that is bounded above in A. So suppose that b is an upper bound of A0 in A so that 0 b 1 (or 0 b < 1). Now, of course, A0 has a least upper bound c in since it is also a nonempty subset of that is bounded above. Obviously, c b since it is the least upper bound. For any x A0 we of course have that x A so that 0 x 1 (or 0 x < 1), and clearly x c since it is an upper bound of A0. Thus we have 0 x c b 1 (or 0 x c b < 1) so that c A. Hence A0 has a least upper bound in A as desired. □

(b)
First we claim that both [0,1] × [0,1] and [0,1) × [0,1] have the least upper bound property. We show this for both sets simultaneously as their proofs are identical.

Proof. Let X = [0,1] × [0,1] (or X = [0,1) × [0,1]). Suppose that A is a nonempty subset of X that is bounded above and that x1 × y1 is an upper bound of A in X. Then of course we have x1 [0,1] (or x1 [0,1)). Define Ax = {xx × y A} so that clearly Ax [0,1] (or Ax [0,1)). It then follows that x x1 for any x Ax since x1 × y1 is an upper bound of A in the dictionary order. Also clearly Ax is nonempty since A is. Thus Ax is a nonempty subset of [0,1] (or [0,1)) that is bounded above (by x1) so that it has a least upper bound a by what was shown in part (a).

Now, if aAx then set b = 0. Otherwise, define Ay = {ya × y A}. Then, since a Ax, there is a y [0,1] where a × y A, which shows that y Ay and hence Ay. We also clearly have that Ay [0,1] so that Ay is bounded above by 1. Then Ay has a least upper bound b, again by what was shown in part (a). In either case, we assert that a × b is the least upper bound of A in X in the dictionary order.

First, it is obvious that a × b X is based on how a and b were defined. Consider any x × y A so that x Ax, and hence x a since a is the least upper bound of Ax. If x < a then of course x × y a × b, so assume that x = a. Then a = x Ax so that b was defined as the least upper bound of Ay. Then we have that y Ay since x × y = a × y A, and thus y b since b is the least upper bound of Ay. This shows that x × y a × b so that we have shown that a × b is an upper bound of A since x × y was arbitrary.

To show that it is the least upper bound consider any x0 × y0 X where x0 × y0 < a × b. If x0 < a then there must be an x Ax where x0 < x since x0 cannot be an upper bound of Ax since x0 < a and a is the least upper bound of Ax. Then, since x Ax, there is a y [0,1] where x × y A. Hence x0 × y0 < x × y since x0 < x so that x0 × y0 is not an upper bound of A. On the other hand, if x0 = a we must have y0 < b so that it cannot be that b = 0, and hence it must be that a Ax. Then there must be a y Ay where y0 < y since y0 cannot be an upper bound of Ay since y0 < b and b is the least upper bound of Ay. Hence a × y A, x0 = a, and y0 < y so that x0 × y0 < a × y A, which shows that x0 × y0 is not an upper bound of A. Thus in either case x0 × y0 is not an upper bound of A, which shows that a × b is the least upper bound since x0 × y0 < a × b was arbitrary.

This of course completes the proof that A has a least upper bound, which shows that X has the least upper bound property since A was an arbitrary nonempty subset. □

We also claim that [0,1] × [0,1) does not have the least upper bound property.

Proof. Let X = [0,1] × [0,1). Consider the set A = {0} × [0,1), which is clearly a nonempty subset of X. This subset also obviously has an upper bound in X in the dictionary order, for example, the point 1 × 0. So let x1 × y1 be any upper bound of A in X and suppose for the moment that x1 = 0. Then y1 [0,1) so that 0 y1 < 1, but then there is a y0 such that 0 y1 < y0 < 1. Then y0 [0,1) so that x1 × y0 = 0 × y0 A, but also x1 × y1 < x1 × y0 so that x1 × y1 cannot be an upper bound of A. So it must be that in fact x10 and hence x1 > 0. Now let x0 = x12 > 0 and y0 = 0 so that clearly x × y < x0 × y0 < x1 × y1 for any x × y A since x = 0 < x12 = x0 < x1. This shows that x0 × y0 is still an upper bound of A but that x0 × y0 < x1 × y1. Since x1 × y1 was an arbitrary upper bound of A, this proves that A can have no least upper bound! □

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