Exercise 2.8.6

(a)
Assuming the hypothesis - and hence the conclusion - of Theorem 2.8.1, show that k = 2 d k converges absolutely.
(b)
Imitate the strategy in the proof of Theorem 2.8.1 to show that k = 2 d k converges to S = lim n s nn .

Answers

(a)
Note that i = 1 n j = 1 n a ij contains all of the terms of k = 2 d k , and thus by comparison to i = 1 n j = 1 n | a ij | , k = 2 | d k | must converge.
(b)
What we need to show is that for all 𝜖 > 0 there exists N such that for all n > N , | S k = 2 n d k | < 𝜖 . Note first that k = 2 n d k contains all the elements of s pp when p n 2 , and that s qq contains all the elements of k = 2 n d k as long as q n 1 .

Since ( s nn ) S , for arbitrary 𝜖 1 > 0 we can choose n 1 large enough such that | s n 1 n 1 S | < 𝜖 1 . If we choose N = 2 n then whenever n > N , k = 2 n d k will contain all terms in s n 1 s n 1 , and if we choose m = n 1 then s mm will contain all terms in k = 2 n d k . Thus

k = 2 n | d k | t n 1 n 1 t mm t n 1 n 1

where t nn was defined near the start of the proof of Theorem 2.8.1. Moreover since t nn converges (as proved in Exercise 2.8.3a) and is thus a Cauchy sequence, for arbitrary 𝜖 2 > 0 , we can also choose n 1 large enough to ensure for any m 1 > n 1 , t m 1 m 1 t n 1 n 1 < 𝜖 2 .

Putting it all together, choosing 𝜖 1 = 𝜖 2 = 𝜖 2 , n 1 large enough to satisfy the two conditions discussed above, and N = 2 n 1 :

| S k = 2 n d k | | S s n 1 n 1 | + | k = 2 n d k s n 1 n 1 | < 𝜖 1 + | k = 2 n | d k | t n 1 n 1 | 𝜖 1 + t mm t n 1 n 1 < 𝜖 1 + 𝜖 2 = 𝜖

completing the proof.

User profile picture
2022-01-27 00:00
Comments