Series (mathematics) - Foundations of Series

An Introduction to Series and Their Convergence What is a Series? A series is an infinite sum of terms from a sequence. If you have a sequence $\{an\}$, you can write its corresponding series as: $$\sum{n=1}^{\infty} an = a1 + a2 + a3 + \cdots$$ This notation, called sigma notation, provides a compact way to represent infinite sums. The challenge with series is that we cannot simply add up infinitely many numbers the way we do with finite sums. Instead, we need a more sophisticated approach using the concept of limits. Understanding Partial Sums The key to making sense of infinite sums is to consider partial sums. The $n$th partial sum of a series $\sum{k=1}^{\infty} ak$ is defined as: $$Sn = a1 + a2 + a3 + \cdots + an$$ In other words, $Sn$ is just the sum of the first $n$ terms. As $n$ increases, you're adding more and more terms to your partial sum, gradually building toward the complete infinite series. The sequence of partial sums $\{S1, S2, S3, \ldots\}$ completely determines the behavior of the series. This is the crucial insight: instead of trying to understand an infinite sum directly, we examine what happens to the finite partial sums as we include more and more terms. Example: For the series $\sum{n=1}^{\infty} \frac{1}{2^n}$, the first few partial sums are: $S1 = \frac{1}{2}$ $S2 = \frac{1}{2} + \frac{1}{4} = \frac{3}{4}$ $S3 = \frac{1}{2} + \frac{1}{4} + \frac{1}{8} = \frac{7}{8}$ $S4 = \frac{1}{2} + \frac{1}{4} + \frac{1}{8} + \frac{1}{16} = \frac{15}{16}$ Notice how the partial sums are increasing and appear to be approaching 1. Convergence and Divergence A series converges when the limit of its partial sums exists and is finite. Formally, we say that $\sum{n=1}^{\infty} an$ converges if: $$\lim{n \to \infty} Sn = L$$ for some finite number $L$. We call $L$ the sum of the series. Conversely, a series diverges if the limit of the partial sums does not exist (or is infinite). This could happen in several ways: The partial sums might increase without bound The partial sums might oscillate and never settle to a single value The partial sums might approach different limits depending on how you approach infinity Key Insight: Understanding whether a series converges or diverges is about asking: "As I keep adding more and more terms, do my partial sums stabilize toward a particular value?" Common Examples To build intuition, here are three essential examples you should know: The Geometric Series: The series $\sum{n=0}^{\infty} r^n$ (where $r$ is a constant) converges when $|r| < 1$, and its sum is: $$\sum{n=0}^{\infty} r^n = \frac{1}{1-r} \quad \text{(when } |r| < 1\text{)}$$ When $|r| \geq 1$, the series diverges. Geometric series are important because they're one of the few series where we can compute the sum explicitly. The Harmonic Series: The series $\sum{n=1}^{\infty} \frac{1}{n} = 1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + \cdots$ diverges, even though the individual terms $\frac{1}{n}$ approach zero. This is a famous counterexample showing that terms approaching zero is not sufficient for convergence. The Alternating Harmonic Series: The series $\sum{n=1}^{\infty} (-1)^{n+1}\frac{1}{n} = 1 - \frac{1}{2} + \frac{1}{3} - \frac{1}{4} + \cdots$ converges to $\ln 2$. This example is crucial because it shows that including alternating signs can rescue a divergent series into convergence. Absolute vs. Conditional Convergence Not all convergent series are created equal. There are two important distinctions: Absolute Convergence: A series $\sum{n=1}^{\infty} an$ is absolutely convergent if the series of absolute values also converges: $$\sum{n=1}^{\infty} |an| \text{ converges}$$ Absolute convergence is the "strongest" form of convergence. When a series converges absolutely, you have a guarantee: any rearrangement of the terms will produce the same sum. This makes absolutely convergent series behave predictably. Conditional Convergence: A series is conditionally convergent (or semi-convergent) when it converges, but the series of absolute values diverges. In other words: $\sum{n=1}^{\infty} an$ converges, but $\sum{n=1}^{\infty} |an|$ diverges The alternating harmonic series is a classic example: it converges to $\ln 2$, but $\sum{n=1}^{\infty} \frac{1}{n}$ (the absolute values) diverges. Why This Matters: Here's the striking difference—a theorem called the Riemann Rearrangement Theorem states that if a series is only conditionally convergent, you can rearrange its terms to make it converge to any real number you choose, or even make it diverge. This shows that conditionally convergent series are fragile: their convergence depends on the order of the terms. In contrast, absolutely convergent series are robust: rearrangement doesn't matter. Truncation Error for Alternating Series When you approximate a series by computing only its first $n$ terms (the $n$th partial sum $Sn$), you introduce an error, called the truncation error (or remainder). The truncation error is: $$Rn = S - Sn$$ where $S$ is the true sum of the series and $Sn$ is your approximation. For alternating series that satisfy the alternating series test (decreasing positive terms approaching zero), there's a useful bound: the truncation error in absolute value is bounded by the first omitted term: $$|Rn| \leq |a{n+1}|$$ This is remarkably practical. It tells you that if you stop after $n$ terms, your error is no larger than the $(n+1)$th term itself. Example: For the alternating harmonic series $\sum{n=1}^{\infty} (-1)^{n+1}\frac{1}{n}$, if you approximate the sum using only the first 10 terms, your error is at most $\frac{1}{11} \approx 0.091$. This gives you a concrete handle on how accurate your approximation is.