Foundations — Direct comparison test

This foundations page builds — from absolute zero — every symbol and idea the parent note leans on. If a word below feels obvious to you, read it anyway: the parent secretly assumes you own all of them.

0. The starting picture: what even is a series?

Before any symbol, a picture. Imagine dots on a number line, one for each height $a_1,a_2,a_3,\dots$ — these are the terms, the individual piles of candy.

Figure 1 — each term $a_n$ is a pile of height $a_n$ sitting at its own address $n$ on the horizontal axis; the piles here shrink as you walk right.

We are going to stack them: put $a_1$ down, then place $a_2$ on top, then $a_3$, and so on. The question of the whole chapter is: does this running tower reach a finite ceiling, or does it climb forever?

1. The natural numbers $\mathbb{N}$ — the addresses we count with

Picture: evenly spaced tick marks running rightward forever, labelled $1,2,3,\dots$ — one slot for every pile.

Why the topic needs it: every symbol below is indexed by a member of $\mathbb{N}$. "For all $n$" always secretly means "for all $n$ in $\mathbb{N}$".

2. The subscript $a_n$ — a term with an address

Picture: a row of labelled boxes. Box number $n$ holds the value $a_n$.

Why the topic needs it. The whole test is a rule about each address separately: "at every address $n$, my pile is no taller than yours." Without a name for "the pile at address $n$", we could not even phrase that.

3. A sequence — an endless labelled list

Picture: the same row of boxes as before, but now emphasised as one object — the whole endless list, not just a single pile.

Why the topic needs it: two different sequences will star in this topic — the terms $a_1,a_2,\dots$ and the running totals $S_1,S_2,\dots$ (Section 5). Both are sequences; naming the concept lets us talk about "what the list does in the long run".

4. The inequality $0\le a_n\le b_n$ — "no taller than"

The parent's central hypothesis is the double inequality, holding for all $n\ge N$ (some fixed starting address $N\in \mathbb{N}$): $0\le a_n\le b_n(n\ge N).$ Read left to right: "zero, no taller than my pile $a_n$, no taller than your pile $b_n$." Two piles at each address from $N$ onward, mine always the shorter.

Figure 2 — at every address the blue pile $a_n$ (ours) is no taller than the orange pile $b_n$ (the partner); the gray double-arrow marks the gap $b_n-a_n\ge 0$.

Why the topic needs it: this term-by-term "no taller than", holding eventually, is the entire input of the test. Everything else is machinery to convert it into a conclusion.

5. Sigma $\sum$ — the "add them all" symbol

Picture: $\sum$ is a machine with a mouth that swallows the boxes from $1$ to $n$ and prints one number: their total height.

The letter $k$ here is a dummy — a walker that only exists inside the sum. ${\sum }_{k=1}^n{a}_k$ and ${\sum }_{j=1}^n{a}_j$ mean exactly the same total.

Why the topic needs it: the parent writes $\sum a_n$ everywhere. When the top is a number $n$ it is a finite sum (safe, ordinary addition). When the top is $\infty$ it is the infinite series — the real object of study, defined in Section 7.

6. Partial sums $S_n$ — the running tower

Figure 3 — the blue staircase is the sequence of partial sums $S_n$: each step adds the next pile $a_n$, and the heights press up toward the red dashed ceiling.

Why a new symbol $S_n$ and not just $\sum$? Because we want to watch the tower grow. The list $S_1,S_2,S_3,\dots$ is itself a sequence (Section 3) — and the whole game is asking what that list does as $n$ marches to infinity.

7. The limit ${\lim }_{n\to \infty }{S}_n$, and convergence vs divergence

First we must say precisely what it means for a sequence of heights to "settle to a ceiling".

Picture: draw a horizontal line at $S$ and a thin shaded strip of half-width $\epsilon$ around it. "Limit $S$" means the staircase eventually enters that strip and stays trapped inside — no matter how thin you make it.

Picture: two towers side by side. One rises fast at first, then the additions get so tiny the height flattens against an invisible ceiling — convergence. The other keeps adding just enough each time to break through any ceiling you draw — divergence.

Why the topic needs it: "converges" / "diverges" is the output of the test. The parent never computes $S$ — it only decides which of these two words applies, by comparison.

8. Bounded above — the "ceiling exists" idea

Picture: draw a horizontal line at height $B$. Bounded-above means every dot $S_1,S_2,\dots$ lives on or below that line.

Why the topic needs it: the proof's key step shows the tower's heights are all trapped under a finite number $B$ (the total of the bigger series). Combined with "never shrinks", that traps the tower — which is the next idea.

9. The engine: Monotone Convergence

Picture: a tower that only grows, but can never exceed the ceiling line $B$. It has nowhere to go but squeeze up toward some final height at or below $B$. It cannot oscillate (it only goes up) and cannot escape (the ceiling blocks it). So it must settle.

Figure 4 — the green staircase only rises (never down) yet stays under the red bound $B$; being cornered, it must converge to the gray limit line.

Why the topic needs it: this is literally the proof of DCT. Non-negative terms give (a) increasing; a convergent bigger series gives (b) bounded above; the theorem then forces convergence. Own this and you own the test.

10. Packaging it: the Direct Comparison Test itself

Now every symbol above earns its keep. Here is the parent's theorem stated once, in full, with all hypotheses on the table.

11. Two benchmark series you must already trust

The test always compares your mystery series to a known one. Two known families do almost all the work:

Why the topic needs them: DCT converts "unknown" into "known" — but only if you carry a stable of knowns. These two are the benchmark partners the parent's examples reach for every time.

Equipment checklist

Read each question, answer aloud, then reveal.