18.

100A PS9
Author: Eric Emer March 13, 2013

Reading 6.5-7.7 Collaborators: None.

1
1.1

Exercise 6.5 #1
a
S = {sin n/6 : n Z} max S = sup S = 1 min S = inf S = 1

1.2

b
S = {(cos n )/n : n N} max S = sup S = 1/2 (max when n = 2) min S = inf S = 1 (min when n = 1)

1.3

c
S= 1 n + cos : nN n 2

max S = sup S = 5/4 (max when n = 4) inf S = 1

1.4

d
S = n2n : n N max S = sup S = 1/2 (max when n = 1, 2) inf S = 0

2
2.1

Exercise 6.5 #3
a

By the Completeness Property for sets, we know that sup A and sup B exist. By denition, for all a A, a sup A. Also, for all b B , b sup B . Because A B , this means that also, for all a A, a sup B . Transitively, a sup A sup B . So, A B = sup A sup B .

2.2

By the Completeness Property for sets, we know that inf A and inf B exist. By denition, for all a A, a inf A. Also, for all b B , b inf B . Because A B , this means that also, for all a A, a inf B . So by denition of inmum, inf A inf B . So, A B = inf A inf B .

2.3

We let x cA. We notice that for some a A, x = ca. For all a A, a = sup A, by denition of least upper bound. By simple algebra, it must also be that ca c. Consider least upper bound k = sup cA for cA. Then it must be that x k for all x cA. Consider again the case where x = ca, then ca k , and a k c . We know that is the least upper bound of A, so it must be that k/c. Concluding that c k . So c sup A is the least upper bound as well. The supremum of a set is unique, so it must be that c sup A = sup cA.

2.4

We let x cA. We notice that for some a A, x = ca. For all a A, a = inf A, by denition of greatest lower bound. By simple algebra, it must also be that ca c. Consider greatest lower bound k = inf cA for cA. Then it must be that x k for all x cA. Consider again the case where x = ca, then ca k , and a k c . We know that is the greatest lower bound of A, so it must be that k/c. Concluding that c k . So c inf A is the greatest lower bound as well. The inmum of a set is unique, so it must be that c inf A = inf cA.

2.5

Allow = inf A. Then by denition a for all a A. By sign-change law, it also holds that a for all a A. Now we can apply the denition of an upper bound, and see that is an upper bound for the set A. We dene k as any upper bound on A. Then it would hold that k a for all a A. Also by the sign-change law, k a for all a A. Because is the greatest lower bound of A, it must also be that k . By the sign-change law, k . Since k was any upper bound, this means that is the least upper bound. We know from our design that = inf A, and we conclude from the conditions and the denition of supremum as lowest upper bound that is the is the supremum of A. So sup (A) = inf A.

2.6

Allow = sup A. Then by denition a for all a A. By sign-change law, it also holds that a for all a A. Now we can apply the denition of a lower bound, and see that is a lower bound for the set A. We dene k as any lower bound on A. Then it would hold that k a for all a A. Also by the sign-change law, k a for all a A. Because is the least upper bound of A, it must also be that k . By the sign-change law, k . Since k was 2

any lower bound, this means that is the greatest lower bound. We know from our design that = sup A, and we conclude from the conditions and the denition of inmum as greatest lower bound that is the is the inmum of A. So inf (A) = sup A.

2.7

We examine the denition of supremum, and see that for all a A, a sup A. Similarly, for all b B , b sup B . Therefore, we can add these terms, to show that a + b sup A + sup B for all a A, b B . This happens to fulll the denition of an upper bound, so therefore sup (A + B ) sup A + sup B .

2.8

h
sup (A B ) sup (A) + sup (B )

From (g) we know that and from (e) sup (A) = inf A Combining sup ((A + B )) inf A inf B inf (A + B ) inf A inf B inf (A + B ) inf A + inf B

3
3.1

Problem 6-2
a

1 We know m = sup S . Consider, bn = m n for all n N. By sup-2, this is not an upper bound on S, since it is less than m , the least upper bound. Therefore, we conclude that there exists an 1 1 an S such that m n < an m . Because limn (m n )=m , for this an , it is clear from the Squeeze Theorem that as n , so an m .

3.2

We know from part (g) of the previous problem that: sup (A + B ) sup A + sup B We examine the denition of supremum, and see that for all a A, a sup A. Similarly, for all b B , b sup B . Therefore, we can add these terms, to show that a + b sup A + sup B for all a A, b B . However, by denition of supremum, we see that if a + b has a least upper bound, that least upper bound is sup (A + B ). Therefore a + b sup (A + B ) for all a A, b B . Because the inequality holds for all b B , we can also say from denition of least upper bound/supremum that a + sup B sup (A + B ). Similarly, the inequality holds for all a A, so we can say from denition of least upper bound that sup A + sup B sup (A + B ). Because we have proven the inequality in both directions, sup (A + B ) = sup A + sup B .

4
4.1

Problem 7-7
a
1 1 1 c2k = , and c2k+1 = + 2 2 2(k + 1) lim c2k = lim c2k+1 = C = 1 2

4.2

The Cesaro Sum in terms of the ak term, cn = a1 + . . . + n an =

n k=1

ak

4.3

We consider problem 3-1b, where bn = (a1 + . . . + an )/n We can show that an L = bn L. Proof. We wish to show that if an L then bn L. Recall: bn = a1 + a2 + . . . + an n

We know that if an L, then an L 0. Therefore, we examine: (a1 L) + (a2 L) + . . . + (an L) =0 n n We would expect that the above equation would go to zero because the numerator would go to zero (we know that an L 0). We can transform the equation: lim (a1 L) + (a2 L) + . . . + (an L) = lim (bn L) = 0 n n n Now that we know that bn L 0 as n , we can conclude by addition that bn L as n . lim Proof. In the Cesaro Summation, we now suppose that for sn = consider, s1 + . . . + sn cn = n and so, as above, sn C = cn C . Proof. For a convergent lim cn = lim an , we have that as n , so an , we have that sn C . We

an C . Therefore, an

s1 + . . . + sn n an nC = lim = lim = lim C = C = n n n

So the Cesaro Sum is the same as the regular sum.