Infinite Series

Master convergence tests and understand when infinite sums make sense

When Can We Add Infinitely Many Numbers?

An infinite series is a sum of infinitely many terms. But when does such a sum make sense? The series converges if the sequence of partial sums converges to a finite limit.

We'll explore various convergence tests that help determine whether a series converges, including the comparison test, ratio test, root test, and the important distinction between absolute and conditional convergence.

Partial Sums: Building Infinite Sums Step by Step

A series converges if its partial sums Sn = a1 + a2 + ... + an approach a finite limit. Watch how different series behave -- some settle down to a value, others grow without bound.

Speed:
Term 0 / 60

Σ(1/2)ⁿ

Geometric series with r = 1/2, converges to 1

Sum: S = 1.000000

Key insight: A series is really a sequence of partial sums in disguise. All the tools from sequence convergence apply: a series converges if and only if its partial sums form a Cauchy sequence.

Geometric Series: The Fundamental Example

The geometric series is the most important series in analysis. It converges if and only if |r| < 1, with a closed-form sum. Adjust the ratio to see the boundary between convergence and divergence.

|r| = 0.50 < 1 ✓
-1.501.5

Geometric Series Formula

Σ rⁿ = r + r² + r³ + ... = r / (1 - r) when |r| < 1

With r = 0.50, the sum converges to 1.0000

Partial sums Sₙ
Individual terms aₙ
Limit (if convergent)

Key insight: The geometric series sum a/(1-r) for |r| < 1 is both a closed-form formula and a comparison benchmark. Many convergence proofs ultimately reduce to bounding a series by a geometric one.

Convergence Test Laboratory

Different tests work best for different series. The ratio test excels with factorials, the root test with nth powers, while the divergence test quickly catches series that cannot possibly converge.

Σ(1/2)ⁿ

Geometric series with r = 1/2, converges to 1

Convergent

Divergence Test

lim_{n→∞} aₙ ≠ 0 ⟹ Σaₙ diverges

lim aₙ = 0, so the test is inconclusive (series may still diverge)

Ratio Test

L = lim_{n→∞} |a_{n+1}/a_n|

L = 0.5000 < 1, so the series converges absolutely

Computed L ≈ 0.5000

Root Test

L = lim_{n→∞} |a_n|^{1/n}

L = 0.5000 < 1, so the series converges absolutely

Computed L ≈ 0.5000

Alternating Series Test

b_n ↓ 0 ⟹ Σ(-1)^n b_n converges

Series is not alternating, test does not apply

Test Summary

  • Divergence Test: Inconclusive
  • Ratio Test: Proves convergence
  • Root Test: Proves convergence
  • Alternating Series Test: Inconclusive

Choosing the Right Test

  • Divergence Test: Always try first - quick way to detect divergence
  • Ratio Test: Best for series with factorials or exponentials
  • Root Test: Best when aₙ involves nth powers
  • Alternating Series Test: Only for strictly alternating series
  • Comparison Tests: Compare to known series (p-series, geometric)

Key insight: No single convergence test works for all series. The art of series analysis is choosing the right test -- ratio for factorials, root for exponentials, comparison for polynomial decay.

The p-Series: A Critical Threshold

The p-series converges if and only if p > 1. The borderline case p = 1 (harmonic series) diverges despite its terms going to zero -- a crucial example showing that terms going to zero is necessary but not sufficient for convergence.

Converges (p > 1)

p-Series: Σ 1/n^p

Converges if and only if p > 1

  • p = 1: Harmonic series (diverges!)
  • p = 2: Basel problem (= π²/6)
  • p = 3: Apéry's constant

Current (p = 2.0):

Sum ≈ 1.6251Exact: π²/6 ≈ 1.6449

Σ1/n^2.0
Σ1/n (harmonic)

Key insight: The harmonic series diverges even though its terms approach zero. This is the classic example showing that the divergence test (terms not going to zero) catches failures, but passing it guarantees nothing.

The Riemann Rearrangement Theorem

A conditionally convergent series can be rearranged to sum to any value! This stunning result shows why absolute convergence is so important -- absolutely convergent series always sum to the same value regardless of ordering.

Speed:
Term 0 / 50

Riemann Rearrangement Theorem

A conditionally convergent series can be rearranged to converge to any real number!

The alternating harmonic series Σ(-1)^(n+1)/n converges to ln(2) ≈ 0.693. But by rearranging its terms (adding positive terms until we exceed the target, then negative terms until we go below), we can make it converge to any value we want—in this case, 1.50.

Rearranged series → 1.50
Original series → ln(2)

Key insight: Absolute convergence means the series of absolute values converges. Such series behave like finite sums -- rearrangement-invariant and safe to manipulate. Conditional convergence is fragile by comparison.

Key Takeaways

  • Convergence -- a series converges when its partial sums approach a finite limit; this reduces series problems to sequence problems
  • Geometric series -- converges if and only if |r| < 1, serving as the benchmark for comparison tests
  • p-series threshold -- converges for p > 1, diverges for p <= 1; the harmonic series (p = 1) is the critical boundary case
  • Absolute vs conditional -- absolutely convergent series are well-behaved under rearrangement; conditionally convergent series are not