Exercise 6.7.6

(a)
Let c n = 1 3 5 ( 2 n 1 ) 2 4 6 2 n

for n 1 . Show c n < 2 2 n + 1 .

(b)
Use (a) to show that n = 0 a n converges (absolutely, in fact) where a n is the sequence of Taylor coefficients generated in Exercise 6.7.4.
(c)
Carefully explain how this verifies that equation (1) holds for all x [ 1 , 1 ]

Answers

(a)
We can show this by induction, if a bit inelegantly. The base case is trivial matter of computation. For the inductive case, we want to show c n + 1 = c n 2 n + 1 2 n + 2 2 2 n + 1 2 n + 1 2 n + 3 . If we work through the algebra of the claim 2 n + 1 2 n + 1 < 2 n + 1 2 n + 3 , we find that this is equivalent to
8 n 3 + 20 n 2 + 14 n + 3 < 8 n 3 + 20 n 2 + 16 n + 4

which is clearly true for n 1 , and the inductive step is done.

(b)
| a n | = c n ( 2 n 1 ) < 2 ( 2 n 1 ) 2 n + 1 2 ( 2 n 1 ) 2 3 which implies absolute convergence by comparison against an appropriate geometric series.
(c)
(b) implies that the Taylor series of 1 x converges absolutely at 1. With Theorem 6.5.2, the Taylor series converges uniformly over [ 1 , 1 ] and is therefore continuous. We also have that the Taylor series converges to 1 x for x ( 1 , 1 ) , which is also continuous. Therefore taking limits as both functions approach ± 1 gets us that they are equal over [ 1 , 1 ] .
User profile picture
2022-01-27 00:00
Comments