Power Series

⚡ Key Takeaways

A power series is an infinite series of the form ∑n=0∞an(x−c)n\sum_{n=0}^\infty a_n (x-c)^n, a "polynomial of infinite degree" centered at cc. Key result: every power series has a radius of convergence RR (possibly 00 or ∞\infty) inside which it converges absolutely and defines an infinitely differentiable function. Where it applies: representing functions, solving ODEs, complex analysis, generating functions, numerical computation. Who/when: Newton (~1665), Taylor (1715), Cauchy and Abel (1820s) gave the rigorous convergence theory.

💡 The Core Insight

A power series is the bridge between local data (the coefficients ana_n, which encode derivatives at one point) and a function on an interval. Convergence is governed by a single number RR, the radius of convergence, determined entirely by how fast ∣an∣|a_n| grows. Inside RR the series behaves like an infinitely-long polynomial: you may differentiate, integrate, add, and multiply term-by-term. At the boundary ∣x−c∣=R|x-c|=R anything can happen.

Formal Statement

DefinitionPower Series

A power series centered at cc with coefficients {an}n≥0\{a_n\}_{n\ge 0} is the series

1
∑n=0∞an(x−c)n=a0+a1(x−c)+a2(x−c)2+⋯\quad \sum_{n=0}^{\infty} a_n (x-c)^n = a_0 + a_1(x-c) + a_2(x-c)^2 + \cdots

Derivation hint: this is the definition; each term is a coefficient an∈Ra_n \in \mathbb{R} (or C\mathbb{C}) times a power of the displacement x−cx-c from the center cc. Here xx is the variable, cc is the center, ana_n is the nn-th coefficient, and nn ranges over the non-negative integers. The series defines a function f(x)f(x) on the set of xx where it converges, with f(c)=a0f(c)=a_0 always (every other term vanishes at x=cx=c).

DefinitionRadius and Interval of Convergence

The radius of convergence R∈[0,∞]R \in [0,\infty] is the number such that the series [1] converges absolutely for ∣x−c∣<R|x-c|<R and diverges for ∣x−c∣>R|x-c|>R. It is given by the Cauchy–Hadamard formula

2
1R=lim sup⁡n→∞∣an∣1/n\quad \frac{1}{R} = \limsup_{n\to\infty} |a_n|^{1/n}

Derivation hint: apply the root test to ∑∣an(x−c)n∣\sum |a_n(x-c)^n|; the series converges when lim sup⁡∣an(x−c)n∣1/n=∣x−c∣ lim sup⁡∣an∣1/n<1\limsup |a_n(x-c)^n|^{1/n} = |x-c|\,\limsup|a_n|^{1/n} < 1. with conventions 1/0=∞1/0=\infty and 1/∞=01/\infty=0. The interval of convergence is (c−R,c+R)(c-R, c+R) together with whichever endpoints converge — these must be tested separately.

TheoremCauchy–Hadamard Theorem

For the power series ∑an(x−c)n\sum a_n(x-c)^n with RR defined by [2]: 1. The series converges absolutely for every xx with ∣x−c∣<R|x-c|<R. 2. The series diverges for every xx with ∣x−c∣>R|x-c|>R. 3. On any closed sub-interval [c−r,c+r][c-r,c+r] with r<Rr<R, convergence is uniform. No general claim is made for ∣x−c∣=R|x-c|=R.

TheoremRatio Test for Radius

If the limit exists, the radius is also given by

3
R=lim⁡n→∞∣anan+1∣\quad R = \lim_{n\to\infty} \left| \frac{a_n}{a_{n+1}} \right|

Derivation hint: apply the ratio test to the terms un=an(x−c)nu_n = a_n(x-c)^n; convergence requires lim⁡∣un+1/un∣=∣x−c∣lim⁡∣an+1/an∣<1\lim |u_{n+1}/u_n| = |x-c|\lim|a_{n+1}/a_n| < 1. This is easier to apply when ratios simplify, but [2] always works whereas [3] can fail when the limit does not exist.

Why It Holds / Derivation

ProofExistence of a Radius via Abel's Lemma

Step 1 — A convergence-at-one-point lemma. Suppose ∑an(x0−c)n\sum a_n(x_0-c)^n converges for some particular x0≠cx_0 \ne c. Then its terms are bounded: there is MM with ∣an(x0−c)n∣≤M|a_n(x_0-c)^n| \le M for all nn, since terms of a convergent series tend to 00.

Step 2 — Comparison with a geometric series. For any xx with ∣x−c∣<∣x0−c∣|x-c| < |x_0-c|, set t=∣x−c∣∣x0−c∣<1t = \frac{|x-c|}{|x_0-c|} < 1. Then

4
∣an(x−c)n∣=∣an(x0−c)n∣⋅tn≤M tn\quad |a_n(x-c)^n| = |a_n(x_0-c)^n|\cdot t^n \le M\,t^n

Derivation hint: factor (x−c)n=(x0−c)n (x−cx0−c)n(x-c)^n = (x_0-c)^n\,\big(\tfrac{x-c}{x_0-c}\big)^n and bound the first factor by MM using Step 1.

Step 3 — Conclusion. Since ∑nMtn=M1−t<∞\sum_{n} M t^n = \frac{M}{1-t} < \infty, the comparison test gives absolute convergence at xx. Thus convergence at x0x_0 forces convergence at every closer point.

Step 4 — Define RR. Let R=sup⁡{∣x0−c∣:∑an(x0−c)n converges}R = \sup\{ |x_0-c| : \sum a_n(x_0-c)^n \text{ converges}\}. By Step 3, all points strictly inside radius RR converge; points strictly outside cannot converge (else they would force convergence at a point beyond RR, contradicting the sup). This RR coincides with [2]. ■\blacksquare

∎
TheoremTerm-by-Term Differentiation and Integration

If f(x)=∑n=0∞an(x−c)nf(x)=\sum_{n=0}^\infty a_n(x-c)^n has radius R>0R>0, then ff is infinitely differentiable on (c−R,c+R)(c-R,c+R), and the derivative and antiderivative series

5
f′(x)=∑n=1∞n an(x−c)n−1,∫f dx=C+∑n=0∞ann+1(x−c)n+1\quad f'(x) = \sum_{n=1}^{\infty} n\,a_n (x-c)^{n-1}, \qquad \int f\,dx = C + \sum_{n=0}^{\infty} \frac{a_n}{n+1}(x-c)^{n+1}

Derivation hint: uniform convergence on compact sub-intervals (Cauchy–Hadamard part 3) permits interchange of limit and derivative/integral; lim sup⁡(n∣an∣)1/n=lim sup⁡∣an∣1/n\limsup(n|a_n|)^{1/n}=\limsup|a_n|^{1/n} shows the radius is unchanged. both have the same radius of convergence RR.

TheoremTaylor Coefficients are Forced

If f(x)=∑n=0∞an(x−c)nf(x)=\sum_{n=0}^\infty a_n(x-c)^n on (c−R,c+R)(c-R,c+R), then differentiating [1] repeatedly and evaluating at x=cx=c gives

6
an=f(n)(c)n!\quad a_n = \frac{f^{(n)}(c)}{n!}

Derivation hint: apply [5] nn times; all terms with power <n<n vanish under differentiation, all with power >n>n vanish at x=cx=c, leaving only n! ann!\,a_n. So a function has at most one power series representation at a given center — its Taylor series.

NH
Niels Henrik Abel
1802–1829

The Norwegian mathematician Abel, in his 1826 paper on the binomial series, gave the first fully rigorous treatment of power-series convergence at a time when "summing divergent series" was rampant. He famously complained that "divergent series are the invention of the devil." His Abel's theorem — that if ∑anRn\sum a_n R^n converges then f(x)→∑anRnf(x)\to \sum a_n R^n as x→R−x\to R^- — rescued endpoint behavior and justified results like ln⁡2=1−12+13−⋯\ln 2 = 1 - \tfrac12 + \tfrac13 - \cdots. Abel died of tuberculosis at 26, days before a letter arrived offering him a professorship in Berlin.

Building Intuition

🧠 Intuition

Think of a power series as a dial of weights ana_n tuning how strongly each power (x−c)n(x-c)^n contributes. Near the center x=cx=c, the low powers dominate and the series looks like its first few terms — a polynomial approximation. As you move away from cc, higher powers grow and the question becomes whether the coefficients shrink fast enough to tame them. The radius RR is exactly the tipping point: a competition between coefficient decay (∣an∣1/n|a_n|^{1/n}) and distance growth (∣x−c∣|x-c|). The geometric series ∑xn=11−x\sum x^n = \frac{1}{1-x} is the prototype — it converges for ∣x∣<1|x|<1 and blows up exactly where the function it represents has a singularity, at x=1x=1. This is the deep moral: the radius of convergence is the distance to the nearest singularity (visible clearly in the complex plane).

Figure
Convergence behavior of a power series on the real line

```svg

x c c − R c + R converges (absolutely) diverges diverges R Σ aₙ(x−c)ⁿ : interval of convergence ? test separately ? test separately

```

Worked Examples

ExampleFinding the Interval of Convergence

Given: the series ∑n=1∞(x−2)nn 3n\displaystyle \sum_{n=1}^{\infty} \frac{(x-2)^n}{n\,3^n}. Find RR and the full interval of convergence.

Step 1 — Apply the ratio test for the radius. Here an=1n 3na_n = \frac{1}{n\,3^n}. Compute

∣anan+1∣=(n+1) 3n+1n 3n=3⋅n+1n→3.\left|\frac{a_n}{a_{n+1}}\right| = \frac{(n+1)\,3^{n+1}}{n\,3^n} = 3\cdot\frac{n+1}{n} \to 3.

So R=3R = 3 and the open interval is (2−3, 2+3)=(−1,5)(2-3,\,2+3) = (-1, 5).

Step 2 — Test the left endpoint x=−1x=-1. Then (x−2)n=(−3)n(x-2)^n = (-3)^n, giving

∑n=1∞(−3)nn 3n=∑n=1∞(−1)nn,\sum_{n=1}^\infty \frac{(-3)^n}{n\,3^n} = \sum_{n=1}^\infty \frac{(-1)^n}{n},

the alternating harmonic series, which converges.

Step 3 — Test the right endpoint x=5x=5. Then (x−2)n=3n(x-2)^n = 3^n, giving

∑n=1∞3nn 3n=∑n=1∞1n,\sum_{n=1}^\infty \frac{3^n}{n\,3^n} = \sum_{n=1}^\infty \frac{1}{n},

the harmonic series, which diverges.

Answer:

R=3,interval of convergence =[−1, 5)\boxed{R = 3, \quad \text{interval of convergence } = [-1,\,5)}
ExampleSumming and Differentiating a Series

Given: Starting from the geometric series 11−x=∑n=0∞xn\displaystyle \frac{1}{1-x} = \sum_{n=0}^\infty x^n for ∣x∣<1|x|<1, evaluate S=∑n=1∞n2n\displaystyle S = \sum_{n=1}^{\infty} \frac{n}{2^n}.

Step 1 — Differentiate term-by-term (valid for ∣x∣<1|x|<1 by [5]).

ddx11−x=1(1−x)2=∑n=1∞n xn−1.\frac{d}{dx}\frac{1}{1-x} = \frac{1}{(1-x)^2} = \sum_{n=1}^\infty n\,x^{n-1}.

Step 2 — Multiply by xx to match the desired powers.

x(1−x)2=∑n=1∞n xn.\frac{x}{(1-x)^2} = \sum_{n=1}^\infty n\,x^{n}.

Step 3 — Substitute x=12x = \tfrac12 (inside ∣x∣<1|x|<1, so legal).

S=∑n=1∞n2n=1/2(1−1/2)2=1/21/4=2.S = \sum_{n=1}^\infty \frac{n}{2^n} = \frac{1/2}{(1 - 1/2)^2} = \frac{1/2}{1/4} = 2.

Answer:

  ∑n=1∞n2n=2  \boxed{\;\sum_{n=1}^{\infty} \frac{n}{2^n} = 2\;}

Common Misconceptions

⚠️ Common mistake

Convergence does not equal representation. A function can be infinitely differentiable, have a Taylor series that converges everywhere, and yet that series may not equal the original function. Convergence of the Taylor series is necessary but not sufficient for ff to be analytic. You must check that the remainder term Rn(x)→0R_n(x)\to 0, not merely that the series converges.

Endpoints are NOT determined by RR. The interval can be open, half-open, or closed. Always test x=c±Rx=c\pm R separately — the ratio/root tests are silent there because they give the boundary case L=1L=1.

CounterexampleA Smooth Function Whose Taylor Series Lies

Define

f(x)={e−1/x2,x≠00,x=0.f(x) = \begin{cases} e^{-1/x^2}, & x \ne 0 \\ 0, & x=0. \end{cases}

Every derivative f(n)(0)=0f^{(n)}(0) = 0 (the exponential decay beats every polynomial). Therefore its Maclaurin series is

∑n=0∞f(n)(0)n!xn=0+0⋅x+0⋅x2+⋯=0,\sum_{n=0}^\infty \frac{f^{(n)}(0)}{n!}x^n = 0 + 0\cdot x + 0\cdot x^2 + \cdots = 0,

which converges (to 00) for all xx — yet f(x)≠0f(x) \ne 0 for any x≠0x\ne 0. The series converges everywhere but represents ff only at the single point x=0x=0. Such functions are smooth (C∞C^\infty) but not analytic.

Connections

connection

Power series are the analytic backbone connecting several areas. They specialize to <a class="wiki-link" href="/wiki/taylor-series">Taylor Series</a> when coefficients come from derivatives via [6], and to <a class="wiki-link" href="/wiki/maclaurin-series">Maclaurin Series</a> when c=0c=0. The <span class="wiki-link-missing">Geometric Series</span> is the foundational example and the engine for deriving many others by substitution and term-by-term operations. In <span class="wiki-link-missing">Complex Analysis</span>, a function is holomorphic precisely when it is locally a power series, and the radius equals the distance to the nearest singularity in C\mathbb{C}. They generalize to <a class="wiki-link" href="/wiki/math-topgeo-laurent-series">Laurent Series</a> (allowing negative powers) and connect to <a class="wiki-link" href="/wiki/fourier-series">Fourier Series</a> as another way to expand functions in a basis. The convergence theory rests on the <span class="wiki-link-missing">Ratio Test</span>, <span class="wiki-link-missing">Root Test</span>, and <a class="wiki-link" href="/wiki/math-analysis-uniform-convergence">Uniform Convergence</a>, and the boundary behavior is governed by <span class="wiki-link-missing">Abel&#39;s Theorem</span>.

Real-World Applications

🔬 Where this appears

Historical Development

⏳ History
- ~1665 — Isaac Newton develops the generalized binomial series (1+x)α=∑(αn)xn(1+x)^\alpha = \sum \binom{\alpha}{n}x^n and uses infinite series freely to compute areas and invert functions.
- 1668 — Nicholas Mercator publishes the series for ln⁡(1+x)\ln(1+x).
- 1671 — James Gregory and (independently) Newton obtain the arctangent series, later used to compute π\pi.
- 1715 — Brook Taylor publishes Methodus Incrementorum, formalizing what becomes Taylor's theorem, though without convergence considerations.
- 1742 — Colin Maclaurin popularizes the special case centered at 00 in his Treatise of Fluxions.
- 1748 — Leonhard Euler's Introductio treats series as a central object, deriving eix=cos⁡x+isin⁡xe^{ix}=\cos x + i\sin x and many identities — formally, with little rigor.
- 1821 — Augustin-Louis Cauchy's Cours d'analyse introduces rigorous limits and the root test, giving (with Hadamard later) the radius formula [2].
- 1826 — Niels Abel proves the binomial series rigorously and establishes Abel's theorem on endpoint convergence.
- 1892 — Jacques Hadamard's thesis cements the lim sup⁡\limsup form of [2], now called the Cauchy–Hadamard theorem.

Subtleties & Limits

open-problem

The hardest questions concern the boundary ∣x−c∣=R|x-c|=R and the gap between convergence and analytic representation.

  • Boundary behavior is delicate. A series may converge at some boundary points and diverge at others; characterizing the convergence set on the circle ∣z−c∣=R|z-c|=R (in the complex case) connects to deep results like the Fatou and Carleson theorems on radial and tangential limits.
  • Divergent-yet-useful series. Asymptotic series (e.g., for ∫0∞e−t1+xtdt\int_0^\infty \frac{e^{-t}}{1+xt}dt) diverge for every x≠0x\ne 0 yet give superb finite-term approximations — formalized by Borel summation and the theory of resurgence (Écalle), still active research.
  • Lacunary series and natural boundaries. Series like ∑z2n\sum z^{2^n} converge on ∣z∣<1|z|<1 but cannot be analytically continued past the boundary circle at all (Hadamard's gap theorem) — the unit circle is a "wall." Determining when such natural boundaries occur remains subtle.
  • Multivariable and operator-valued series raise convergence questions (domains of convergence are no longer disks; "Reinhardt domains") that are genuinely harder and not fully classified.

See Also

Taylor Series · Maclaurin Series · Geometric Series · Radius of Convergence · Abel's Theorem · Uniform Convergence · Complex Analysis · Laurent Series · Generating Functions · Ratio Test · Root Test · Analytic Function