Infinite Series

⚡ Key Takeaways

An infinite series is the sum of infinitely many terms, $\sum_{n=1}^\infty a_n$ , defined as the limit of its partial sums. Key result: a series converges iff its sequence of partial sums has a finite limit; otherwise it diverges. Applies in: calculus, analysis, physics, numerical computation, and probability. Who/when: formalized by Cauchy (1821) and Weierstrass (1850s) after centuries of use by Archimedes, Newton, Euler, and others.

💡 The Core Insight

A series is not a sum — it is a sequence in disguise. The object you actually study is the sequence of partial sums $(s_N)$ . Everything about convergence, value, and behavior of $\sum a_n$ is a statement about the limit of $(s_N)$ . The terms $a_n$ are merely the differences $s_N - s_{N-1}$ . This reframing — series-as-sequence — is the single idea that makes the whole subject rigorous.

DefinitionSeries and Partial Sums

Given a sequence of real (or complex) numbers $(a_n)_{n\ge 1}$ , the $N$ -th partial sum is

1

\quad s_N = \sum_{n=1}^{N} a_n = a_1 + a_2 + \cdots + a_N.

Derivation hint: This is a finite sum, always well-defined; $N$ ranges over positive integers. The infinite series $\sum_{n=1}^\infty a_n$ converges to $S$ if

2

\quad \lim_{N\to\infty} s_N = S, \qquad S\in\mathbb{R}.

Derivation hint: This is the standard $\varepsilon$ – $N$ limit applied to the sequence $(s_N)$ ; $S$ is called the sum. If no such finite $S$ exists, the series diverges. Here $a_n$ is the general term, $n$ the index, and $S$ the sum (a number, not a process).

DefinitionAbsolute and Conditional Convergence

A series $\sum a_n$ converges absolutely if $\sum |a_n|$ converges. It converges conditionally if $\sum a_n$ converges but $\sum |a_n|$ diverges.

TheoremCauchy Criterion for Series

$\sum a_n$ converges if and only if for every $\varepsilon>0$ there exists $N$ such that for all $m>n\ge N$ ,

3

\quad \left| \sum_{k=n+1}^{m} a_k \right| < \varepsilon.

Derivation hint: Apply the Cauchy criterion for sequences to $(s_N)$ in the complete space $\mathbb{R}$ ; the tail sum is $s_m - s_n$ .

TheoremThe

n

-th Term Test (Necessary Condition)

If $\sum a_n$ converges, then $\lim_{n\to\infty} a_n = 0$ . Equivalently, if $a_n \not\to 0$ , the series diverges.

4

\quad \sum_{n=1}^\infty a_n \text{ converges} \;\Longrightarrow\; \lim_{n\to\infty} a_n = 0.

Derivation hint: $a_n = s_n - s_{n-1} \to S - S = 0$ when both partial sums tend to the same limit $S$ .

⚠️ Common mistake

The converse of equation [4] is false. $a_n \to 0$ does not imply convergence. The harmonic series $\sum 1/n$ has $a_n = 1/n \to 0$ yet diverges. The $n$ -th term test can only prove divergence, never convergence.

ProofGeometric Series — the prototype

Consider $\sum_{n=0}^\infty r^n$ with $|r| < 1$ .

Step 1. Write the partial sum and multiply by $r$ :

5

\quad s_N = \sum_{n=0}^{N} r^n, \qquad r\,s_N = \sum_{n=0}^{N} r^{n+1} = \sum_{n=1}^{N+1} r^{n}.

Derivation hint: shift the index by one inside the second sum.

Step 2. Subtract to telescope:

6

\quad s_N - r\,s_N = 1 - r^{N+1} \;\Longrightarrow\; s_N = \frac{1 - r^{N+1}}{1 - r}.

Derivation hint: nearly all middle terms cancel, leaving the first term $1$ and the last $-r^{N+1}$ .

Step 3. Take the limit. Since $|r|<1$ , $r^{N+1}\to 0$ , so

7

\quad \sum_{n=0}^\infty r^n = \lim_{N\to\infty}\frac{1-r^{N+1}}{1-r} = \frac{1}{1-r}.

Derivation hint: only the $r^{N+1}$ term depends on $N$ and it vanishes; the rest is constant. If $|r|\ge 1$ then $r^n\not\to 0$ , so by the $n$ -th term test the series diverges. $\blacksquare$

∎

ProofDivergence of the Harmonic Series

Step 1. Group terms in blocks of doubling length:

8

\quad \sum_{n=1}^\infty \frac{1}{n} = 1 + \frac12 + \left(\frac13+\frac14\right) + \left(\frac15+\cdots+\frac18\right) + \cdots

Derivation hint: the $k$ -th block runs from $n=2^{k-1}+1$ to $n=2^k$ and contains $2^{k-1}$ terms.

Step 2. Bound each block below by its smallest term times its count:

9

\quad \sum_{n=2^{k-1}+1}^{2^k} \frac{1}{n} \;\ge\; 2^{k-1}\cdot \frac{1}{2^k} = \frac12.

Derivation hint: each of the $2^{k-1}$ terms is at least $1/2^k$ , the value of the largest index.

Step 3. Hence $s_{2^k} \ge 1 + \tfrac{k}{2} \to \infty$ . The partial sums are unbounded, so the series diverges. $\blacksquare$ Derivation hint (Oresme, ~1350): each parenthesized block contributes at least $1/2$ , and there are infinitely many blocks.

∎

TheoremAbsolute Convergence Implies Convergence

If $\sum |a_n|$ converges, then $\sum a_n$ converges, and $\left|\sum a_n\right| \le \sum |a_n|$ . Derivation hint: by the Cauchy criterion, $\left|\sum_{k=n+1}^m a_k\right| \le \sum_{k=n+1}^m |a_k| < \varepsilon$ ; completeness of $\mathbb{R}$ finishes it.

AC

Augustin-Louis Cauchy

1789–1857

Cauchy gave the modern, limit-based definition of series convergence in his Cours d'Analyse (1821), ending two centuries of confident but sometimes nonsensical manipulation of divergent series. He introduced the partial-sum definition, the Cauchy criterion, the ratio and root tests, and the Cauchy product of two series. His insistence that a series means its limit of partial sums — and nothing else — turned analysis from a collection of formal tricks into a rigorous deductive science. Where Euler had written $1 - 1 + 1 - 1 + \cdots = \tfrac12$ , Cauchy declared the question ill-posed: the partial sums oscillate and have no limit.

🧠 Intuition

Picture the partial sums as the position of a walker on the number line. Each term $a_n$ is a step: positive terms step right, negative terms step left. The series converges if the walker eventually settles arbitrarily close to a fixed point and stays there. It diverges if the walker runs off to infinity (like $\sum 1/n$ , who keeps inching right forever) or paces back and forth without settling (like $\sum (-1)^n$ ). Convergence requires the steps to shrink ( $a_n\to 0$ ) — but that alone isn't enough. The steps must shrink fast enough that their accumulated total stays bounded. The harmonic walker takes shrinking steps yet covers infinite distance, because $1/n$ shrinks too slowly. Compare to $\sum 1/n^2$ : steps shrink fast enough, total distance is finite ( $=\pi^2/6$ ).

Figure

Partial sums of a convergent (geometric, gold) vs divergent (harmonic, gray) series

ExampleGeometric Series with Numbers

Given: A bouncing ball is dropped from height $h_0 = 10\text{ m}$ ; after each bounce it returns to $0.6$ of its previous height. Find the total vertical distance travelled before coming to rest.

Step 1. First drop: $10$ m. Each subsequent bounce goes up and comes down, contributing $2\times$ the bounce height. Bounce heights: $10(0.6),\,10(0.6)^2,\dots$

D = 10 + 2\sum_{n=1}^\infty 10(0.6)^n.

Step 2. Evaluate the geometric series with first term $a = 10(0.6)=6$ and ratio $r=0.6$ :

\sum_{n=1}^\infty 6\,(0.6)^{n-1} = \frac{6}{1-0.6} = 15 \;\Rightarrow\; \sum_{n=1}^\infty 10(0.6)^n = 15.

Step 3. Total:

D = 10 + 2(15) = 40.

Answer: $\boxed{D = 40\ \text{m}}$ . The infinite number of bounces yields a finite total distance because $|r|<1$ .

ExampleTelescoping Series with Numbers

Given: Compute $\displaystyle \sum_{n=1}^\infty \frac{1}{n(n+1)}$ .

Step 1. Partial fractions:

\frac{1}{n(n+1)} = \frac{1}{n} - \frac{1}{n+1}.

Step 2. Write the partial sum and cancel:

s_N = \sum_{n=1}^N\left(\frac1n - \frac1{n+1}\right) = \left(1-\tfrac12\right)+\left(\tfrac12-\tfrac13\right)+\cdots+\left(\tfrac1N-\tfrac1{N+1}\right) = 1 - \frac{1}{N+1}.

Step 3. Take the limit:

\lim_{N\to\infty} s_N = 1 - 0 = 1.

Answer: $\boxed{\sum_{n=1}^\infty \frac{1}{n(n+1)} = 1}$ (dimensionless). The structure of telescoping makes the exact sum visible.

⚠️ Common mistake

Five frequent errors: 1. " $a_n\to 0$ means the series converges." False — see the harmonic series. 2. "You can rearrange terms freely." Only for absolutely convergent series. Conditional convergence is fragile. 3. "Convergence depends on the first few terms." No — convergence is a tail property; finitely many terms change the sum but never the convergence status. 4. " $\sum a_n =$ the formula $1/(1-r)$ always." That formula is valid only for $|r|<1$ . 5. "Divergent series have no value." Some can be assigned values via summation methods (Cesàro, Abel), but these are not the ordinary sum.

CounterexampleRiemann Rearrangement

The alternating harmonic series converges conditionally:

\sum_{n=1}^\infty \frac{(-1)^{n+1}}{n} = 1 - \tfrac12 + \tfrac13 - \tfrac14 + \cdots = \ln 2 \approx 0.693.

But by Riemann's rearrangement theorem, its terms can be reordered to sum to any real number $L$ — or to $+\infty$ , or $-\infty$ . For instance, taking enough positive terms to exceed $5$ , then one negative, then more positives, etc., drives the sum to $5$ . This is impossible for absolutely convergent series, whose sum is rearrangement-invariant. Commutativity of addition does not survive the limit process for conditional convergence.

connection

Infinite series sit at the crossroads of analysis. Through Power Series, series become functions and bridge to Taylor Series expansions of $e^x$ , $\sin x$ , and $\ln(1+x)$ . The Convergence Tests (ratio, root, comparison, integral, alternating) provide the practical machinery for deciding convergence. The Integral Test links series sums to Improper Integrals, so $\sum 1/n^p$ converges exactly when $\int_1^\infty x^{-p}\,dx$ does ( $p>1$ ). Fourier Series generalize the idea to expansions in trigonometric functions and underpin Partial Differential Equations. The notion of Uniform Convergence determines when term-by-term differentiation and integration are valid, connecting to Sequences of Functions. Finally, the Cauchy Criterion for series is the same completeness principle that defines the real numbers via Cauchy Sequences.

🔬 Where this appears

⏳ History

- c. 250 BCE — Archimedes sums a geometric series (

\sum 4^{-n} = 4/3

) to find the area of a parabolic segment via exhaustion.

- c. 1350 — Nicole Oresme proves the harmonic series diverges by the doubling-block argument (equations [8]–[9]).

- 1650 — Pietro Mengoli poses the Basel problem (

\sum 1/n^2 = ?

) and studies telescoping series.

- 1668 — Nicholas Mercator & James Gregory discover power series for

\ln(1+x)

and

\arctan x

.

- 1734 — Leonhard Euler solves the Basel problem:

\sum 1/n^2 = \pi^2/6

, and pioneers manipulation of divergent series.

- 1812 — Carl Friedrich Gauss gives the first fully rigorous convergence study (the hypergeometric series), introducing the Gauss test.

- 1821 — Augustin-Louis Cauchy defines convergence via partial sums in Cours d'Analyse; states the ratio/root tests and Cauchy criterion.

- 1837 — Peter Gustav Lejeune Dirichlet distinguishes absolute from conditional convergence and identifies rearrangement dangers.

- 1854 — Bernhard Riemann proves the rearrangement theorem for conditionally convergent series; advances Fourier theory.

- 1890s — Cesàro, Abel, Borel develop rigorous summation methods that assign values to certain divergent series.

open-problem

Where the theory still bites:

Divergent series with meaning. Expressions like $\zeta(-1) = 1+2+3+\cdots = -\tfrac{1}{12}$ (via analytic continuation of the Riemann zeta function) appear in string theory and the Casimir effect. Making such "sums" rigorous requires regularization, not ordinary convergence — the boundary between formal and meaningful remains delicate.
Asymptotic series. Many physical expansions (QED, WKB) are divergent yet give superb numerical results when truncated optimally. The theory of resurgence and Borel summation attempts to recover exact answers from divergent data, an active research area.
Conditional convergence in higher dimensions. Multiple series and lattice sums (e.g., Madelung constants for crystal energies) depend on summation order in subtle ways; their "correct" values require careful regularization, and some convergence questions remain open.
Open arithmetic questions. Whether certain rapidly converging series produce irrational or transcendental constants (e.g., values of $\zeta(2k+1)$ beyond $\zeta(3)$ , proven irrational by Apéry 1978) is largely unresolved.

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also