Type a command or search the notes. Tab cycles completions. Up and down recall history when blank. Escape dismisses, then leaves the prompt.
MATH
[1251]

Theorems from Power series

All theorems from Power series.

Back to Power series

Convergence has a central interval

Every real power series has a radius R∈[0,∞]R\in[0,\infty] with the following behaviour:

  • absolute convergence for ∣x−a∣<R|x-a|<R;
  • divergence for ∣x−a∣>R|x-a|>R;
  • separate endpoint behaviour when 0<R<∞0<R<\infty.

To see why the region has this shape, suppose the series converges at some x0≠ax_0\ne a. Then its terms satisfy ∣ck(x0−a)k∣≤M|c_k(x_0-a)^k|\le M for some M>0M>0. At any point with ∣x−a∣<∣x0−a∣|x-a|<|x_0-a|,

∣ck(x−a)k∣≤M∣x−ax0−a∣k.|c_k(x-a)^k| \le M\left|\frac{x-a}{x_0-a}\right|^k.

The right-hand side is geometric with ratio below 11, so convergence at one point forces absolute convergence at every point closer to the centre.

Algebra of power series

Inside a common interval where the power series converge absolutely, if

f(x)=∑k=0∞ak(x−a)k,g(x)=∑k=0∞bk(x−a)k,f(x)=\sum_{k=0}^{\infty}a_k(x-a)^k, \qquad g(x)=\sum_{k=0}^{\infty}b_k(x-a)^k,

then

f(x)±g(x)=∑k=0∞(ak±bk)(x−a)k,f(x)\pm g(x) =\sum_{k=0}^{\infty}(a_k\pm b_k)(x-a)^k,

and

f(x)g(x)=∑k=0∞(∑j=0kajbk−j)(x−a)k.f(x)g(x) =\sum_{k=0}^{\infty} \left(\sum_{j=0}^{k}a_jb_{k-j}\right)(x-a)^k.

The second formula is the Cauchy product. The coefficient of (x−a)k(x-a)^k collects every pair of terms whose powers add to kk. Products at endpoints require separate justification when endpoint convergence is only conditional.

Differentiate and integrate term by term

Inside the radius of convergence,

ddx∑k=0∞ak(x−a)k=∑k=1∞kak(x−a)k−1,\frac{d}{dx}\sum_{k=0}^{\infty}a_k(x-a)^k =\sum_{k=1}^{\infty}ka_k(x-a)^{k-1},

and

∫∑k=0∞ak(x−a)k dx=C+∑k=0∞akk+1(x−a)k+1.\int\sum_{k=0}^{\infty}a_k(x-a)^k\,dx =C+\sum_{k=0}^{\infty}\frac{a_k}{k+1}(x-a)^{k+1}.

Both resulting power series have the same open radius of convergence as the original one.

On every closed interval [a−r,a+r][a-r,a+r] with 0<r<R0<r<R, the original series and its differentiated series converge uniformly. This local uniform control justifies the termwise operations; pointwise convergence alone would not.

Uniform convergence on a set means that for every tolerance ε>0\varepsilon>0, there is one index NN such that ∣Sn(x)−f(x)∣<ε|S_n(x)-f(x)|<\varepsilon for every n>Nn>N and every input xx in the set. Pointwise convergence may require a different NN at each input.

The theorem concerns only the open interval. Uniform convergence at either endpoint is a separate question and endpoint behaviour may change after differentiating or integrating.

If

f(x)=∑k=0∞ak(x−a)k,f(x)=\sum_{k=0}^{\infty}a_k(x-a)^k,

then evaluating derivatives at the centre gives

f(j)(a)=j!aj.f^{(j)}(a)=j!a_j.

Consequently, the power series is the Taylor series of the function it defines.

On this page