Section 1.3 solutions Math 310 Fall 2012 1 1 1 is equivalent to a < rn < a + .

. For each n 1 we n n n can nd a rational rn with this property by Theorem 1.18. 2. The inequality |a rn | < 4. If m is a lower bound for a set E , then any m with m < m is also a lower bound. If E has two inma s1 and s2 , then we have s1 s2 and s2 s1 , hence s1 = s2 . 6. a) Let s = inf E . Since s is the greatest lower bound, s + is no longer a lower bound for E , hence there is a E with s + > a. The inequality a s is true since s is a lower bound. b) If E is bounded below, then E is bounded above, so it has a supremum s. The number s is the smallest such that a s for all a E . It follows that a s and s is the greatest with this property. Hence E has inmum s. 7. a) Let a E such that x a for all x E . In particular, a is an upper bound. If b is an upper bound for E , then a b, so a is the least upper bound. b) If a E is a lower bound for E , then a = inf E . Indeed, a x for all x E , and if b is another lower bound, then b a, hence a is the greatest lower bound. c) We have sup(0, 1) = 1 and inf(0, 1) = 0, which are not in (0, 1). 1 1 9. First we assume a > 0. We look for n N such that 2n > and 2n > . It suces a ba 1 1 to take n such that n > log2 and n > log2 . This is possible from the Archimedean a ba 1 1 Principle. In particular, we get n < a and n < b a. Consider the set 2 2 k E = {k N : n a}. 2 Since 1 E , E is nonempty. It is bounded above by 2n a. Let k0 = sup E . Then k0 N and m we can take m = k0 + 1 and q = n . We have m / E and hence q > a. On the other hand, 2 k0 k0 1 b = a + (b a) n + (b a) > n + n = q, 2 2 2 m so indeed, a < n < b. 2 For a 0, let k N such that k > a. Then 0 < k + a < k + b. Applying the rst m m part to k + a < k + b, we nd a dyadic rational n such that k + a < n < k + b. Then 2 2 m m 2n k k = is a dyadic rational between a and b. 2n 2n