Scribd
Upload
887 views4 pages

HW 2

The document contains solutions to exercises involving properties of sets of real numbers. It first lists properties that fail or hold for the sets of natural and integer numbers. It then proves two parts of a theorem about ordered fields. Next, it proves inequalities involving the absolute value of sums of real numbers. Finally, it finds bounds, suprema, and computes unions and intersections of bounded sets of real numbers.

Uploaded by

Troy Wiley
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
887 views4 pages

HW 2

The document contains solutions to exercises involving properties of sets of real numbers. It first lists properties that fail or hold for the sets of natural and integer numbers. It then proves two parts of a theorem about ordered fields. Next, it proves inequalities involving the absolute value of sums of real numbers. Finally, it finds bounds, suprema, and computes unions and intersections of bounded sets of real numbers.

Uploaded by

Troy Wiley
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Homework #2

3.1 (a) Which of the properties A1A4, M1M4, DL, O1O5 fail for N? (b) Which of these properties fail for Z? Solution: (a) Since 0 N, A3 and A4 have to fail. (That A4 fails is also clear since the / negative numbers are not in N.) In addition, M4 fails since the only natural number whose reciprocal is a natural number is 1. All the other properties hold. (b) The only property that fails for Z is M4. (The only integers whose reciprocals are integers are 1 and 1.)

3.4 Prove (v) and (vii) of Theorem 3.2. Solution: (v) In an ordered eld, 0 < 1. Proof: Theorem 3.2(iv) says 0 a2 for any a in the eld. Since 1 = 1 1 by M3, we have 0 1. Since 0 = 1, we conclude that 0 < 1. (vii) For any a and b in an ordered eld, if 0 < a < b then 0 < b1 < a1 . Proof: Since 0 < a, (vi) tells us that 0 < a1 . By transitivity (O3), 0 < b, so 0 < b1 as well. Hence, by (iii), 0 < a1 b1 . Now, a<b a a1 b1 < b a1 b1 aa1 b1 < b b1 a1 (1)b1 < bb1 a1 b1 < (1)a1 b1 < a1 So 0 < b1 < a1 . by by by by by O5 M1, M2 M4, M1 M3, M4 M3

3.6 (a) Prove that |a + b + c| |a| + |b| + |c| for all a, b, c in R. (b) Use induction to prove |a1 + a2 + + an | |a1 | + |a2 | + + |an | for n numbers a1 , a2 , . . . , an . Solution: (a) Well, |a + b + c| = |(a + b) + c| |a + b| + |c| by the Triangle Inequality. Using the triangle inequality once more, we get |a + b| + |c| |a| + |b| + |c|. (To be explicit, the triangle inequality says |a + b| |a| + |b|. Adding |c| to each side (O4), we get |a + b| + |c| |a| + |b| + |c|.) By transitivity (O3), |a + b + c| |a| + |b| + |c|. (b) The base case is exactly the triangle inequality. For the inductive step, assume |a1 + a2 + + ak | |a1 | + |a2 | + + |ak | and show that |a1 + a2 + + ak + ak+1 | |a1 | + |a2 | + + |ak | + |ak+1 |. Well, |a1 +a2 + +ak +ak+1 | = |(a1 +a2 + +ak )+ak+1 | |a1 +a2 + +ak |+|ak+1 | by the triangle inequality. By the inductive hypothesis, |a1 + a2 + + ak | + |ak+1 | |a1 | + + |ak | + |ak+1 |.

4.1 For each set below that is bounded above, list three upper bounds for the set. Otherwise, write NOT BOUNDED ABOVE or NBA. (a) [0, 1] (b) (0, 1) (c) {2, 7} (d) {, e} (e) {1/n | n N} (f) {0} (g) [0, 1] [2, 3] (h) n=1 [2n, 2n + 1] (i) (j) {1 1/3n | n N} n=1 [1/n, 1 + 1/n] n (k) {n + (1) /n | n N} (l) {r Q | r < 2} (m) {r Q | r2 < 4} (n) {r Q | r2 < 2} (o) {x R | x < 0} (p) {1, /3, 2 , 10} (q) {0, 1, 2, 4, 8, 16} (r) n=1 (1 1/n, 1 + 1/n) (s) {1/n | n N and n is prime} (t) {x R | x3 < 8} 2 (u) {x | x R} (v) {cos(n/3) | n N} (w) {sin(n/3) | n N} Solution: (a) (c) (e) (g) (i) (k) (m) (o) (q) (s) (u) (w) 7, 12, 1000000 7, 12, 1000000 7, 12, 1000000 7, 12, 1000000 7, 12, 1000000 NBA 7, 12, 1000000 7, 12, 1000000 30, e7 , 1012 30, e7 , 1012 NBA 1, 2, 3 (b) (d) (f) (h) (j) (l) (n) (p) (r) (t) (v) 7, 12, 1000000 7, 12, 1000000 7, 12, 1000000 NBA 7, 12, 1000000 7, 12, 1000000 7, 12, 1000000 30, e7 , 1012 30, e7 , 1012 30, e7 , 1012 1, 2, 3

4.3 For each set in Execise 4.1, give its supremum if it has one. Otherwise, write NO sup. Solution: (a) (c) (e) (g) (i) (k) (m) (o) (q) (s) (u) (w) 1 7 1 3 1 NO sup 2 0 16 1/2 NO sup 3/2 (b) (d) (f) (h) (j) (l) (n) (p) (r) (t) (v) 1 0 NO sup 1 2 2 10 1 2 1

4.7 Let S and T be nonempty bounded subsets of R. (a) Prove that if S T , then inf T inf S sup S sup T . (b) Prove that sup(S T ) = max{sup S, sup T }. Proof: (of (a)) Well, inf T is a lower bound for T , so inf T t, t T . Since S T , s S s T ; hence, inf T s, s S. We see that inf T is a lower bound for S. Since inf S is the greatest lower bound of S, inf T inf S. Similarly, since s S s T , sup T is an upper bound for S. Since sup S is the least upper bound, we have sup S sup T . Finally, for any s S, inf S s and s sup S. By transitivity (O3), inf S sup S. Putting these together, we have inf T inf S sup S sup T . Proof: (of (b)) Let s = sup S, t = sup T and v = max{sup S, sup T }. For any s S, we have s s v and for any t T we have t t v, so for any x S T we have x v. That is, v is an upper bound of S T . Now we show that v is the least upper bound. For any w < v, either w < t or w < s (or both). Either way, there is an x S T (in S if w < s , in T if w < t ) such that w < x. So w is not an upper bound of S T . We conclude that v is the least upper bound of S T . In other words, v = sup(S T ).

You might also like