Intuition The ONE core ideaIf you keep taking steps that switch direction every time and get smaller and smaller toward zero , you cannot wander forever — you must settle onto a single spot. The whole alternating series test is just this "hopping toward a flag" picture made exact, and everything below is the vocabulary you need to say it precisely.
This page assumes you know nothing . Every symbol the parent proof uses is built here, one on top of the last, with a picture attached to each.
Before signs and limits, we need the raw object: a sum that never ends .
Definition Sequence vs. seriesA sequence is an ordered list of numbers, one for each counting number: a 1 , a 2 , a 3 , … series is what you get when you add the terms of a sequence: a 1 + a 2 + a 3 + ⋯
The picture: a sequence is dots on a number line (one per step); a series is the running total as you walk through those dots.
Intuition Why we can't just "add them all"You can't literally add infinitely many numbers in finite time. So we cheat: we add the first N , watch that running total, and ask "where is it heading?" That heading is the whole game. See Convergence of Series — overview .
n n counter : it takes the values 1 , 2 , 3 , … which term we mean. a n n
Picture: n step number on your walk. a 5
Why the topic needs it: without a counter we can't say "the term after this one" (a n + 1 n → ∞ how terms change as n .
Definition Sigma notationn = 1 ∑ N a n a 1 + a 2 + ⋯ + a N ∑ add ; the n = 1 start counting at 1 ; the N stop at N .
When the top is ∞
Picture: ∑ machine with a start dial (bottom) and stop dial (top) that pours every term into one running total.
∑ n = 1 ∑ ∞ process , not automatically a value. Whether it becomes a number is exactly what "converges" means.
This is the single most important object in the proof, so we give it a picture of its own.
s N s N = ∑ n = 1 N a n = a 1 + a 2 + ⋯ + a N . after N — a normal, finite sum. s 1 = a 1 s 2 = a 1 + a 2
Picture: mark your position after each step on a number line. s 1 , s 2 , s 3 , … new sequence made of running totals .
Why the topic needs it: the parent proof never studies the infinite sum directly. It studies the sequence of partial sums s N those positions settle down. Convergence of the series is defined as convergence of s N
− 1 ( − 1 ) + 1 − 1 ( − 1 ) 0 = + 1 , ( − 1 ) 1 = − 1 , ( − 1 ) 2 = + 1 , ( − 1 ) 3 = − 1 , … Even power ⟹ + 1 − 1 (Multiplying by − 1
Now ( − 1 ) n − 1
n n − 1 ( − 1 ) n − 1
1
0
+ 1
2
1
− 1
3
2
+ 1
4
3
− 1
So ( − 1 ) n − 1 + , − , + , − , … positive . That is why the parent writes
∑ ( − 1 ) n − 1 b n = b 1 − b 2 + b 3 − b 4 + ⋯
Intuition Why separate the sign from the sizeSplitting each term into a sign ( − 1 ) n − 1 positive size b n all the conditions on the sizes b n
Definition Absolute value∣ x ∣ ∣ x ∣ x 0 ≥ 0 ∣ − 3 ∣ = 3 ∣3∣ = 3
Picture: ∣ x ∣ x
Definition The size sequenceb n b n = ∣ a n ∣ > 0 magnitude of the n length of the hop , ignoring direction. In an alternating series a n = ( − 1 ) n − 1 b n
Why the topic needs it: the two test conditions ("decreasing" and "goes to zero") are both about hop lengths , so we need a name for those lengths alone: that name is b n
Definition Monotone decreasingA sequence is decreasing (monotone non-increasing) if each term is no bigger than the one before : b n + 1 ≤ b n n
Picture: the dots step downhill (or flat), never uphill . Each hop in the walk is shorter than or equal to the last.
Intuition Why "decreasing" is one of the two conditionsIn the proof, grouping terms as ( b 1 − b 2 ) + ( b 3 − b 4 ) + ⋯ each bracket ≥ 0 . That is true precisely because b 1 ≥ b 2 b 3 ≥ b 4 Monotone Convergence Theorem .
Common mistake "Eventually decreasing" is enoughThe condition only needs to hold for large n (after some finite point). A few early wiggles don't matter — the tail is what determines convergence.
This is the other condition, and it's the meaning behind ∞
Definition Limit equals zero (plain words)n → ∞ lim b n = 0 as n b n 0 Pick any tiny target distance; eventually every b n
Picture: the hop lengths shrink toward zero — squeezed into a shrinking band around 0
Intuition Why "goes to zero" is the second conditionIn Step 4 the proof writes s 2 m + 1 = s 2 m + b 2 m + 1 b 2 m + 1 → 0 meet at the same spot . If the hops did not shrink to zero, even and odd totals could stay a permanent gap apart — no single limit, no convergence.
Common mistake "Goes to zero" alone is not enough (in general)The Harmonic Series ∑ 1/ n → 0 diverges . Vanishing terms are necessary but not sufficient — you also need the alternation and the decrease. This is exactly what the nth-Term Test for Divergence and Mistake A in the parent warn about.
Definition Series convergesThe series ∑ a n s N → ∞ lim s N = s s sum . If no such number exists, the series diverges .
Picture: the running-total dots s 1 , s 2 , s 3 , … home in on one point s
Why the topic needs it: the Leibniz test's entire conclusion is one word — converges . Now you know it means "the partial-sum positions settle onto a single spot," and you'll meet the stronger cousin in Absolute vs Conditional Convergence .
Converges means sN settles
Read each question, answer out loud, then reveal.
What does a n n a n n n
What does n = 1 ∑ N a n a 1 + a 2 + ⋯ + a N n = 1 n = N
Define the partial sum s N s N = a 1 + ⋯ + a N N s N
Compute ( − 1 ) n − 1 n = 1 , 2 , 3 , 4 + 1 , − 1 , + 1 , − 1
What is ∣ − 7 ∣ ∣ x ∣ 7 x 0
Write "the sizes are decreasing" as an inequality. b n + 1 ≤ b n n
State in plain words what n → ∞ lim b n = 0 As n b n 0
Does "terms go to 0 No — e.g. the harmonic series ∑ 1/ n 1/ n → 0
What does it mean for a series to converge to s Its partial sums satisfy lim N → ∞ s N = s s
