4.3.1 · D1Calculus III — Sequences & Series

Foundations — Sequences — convergence, divergence, boundedness, monotonicity

3,187 words14 min readBack to topic

Before you can read the parent note, you need to own every symbol it throws at you. Below, each symbol gets three things: plain words, the picture, and why the topic needs it. They are ordered so each one leans only on the ones above it.


1. The counting numbers

The picture: a row of evenly spaced ticks marching rightward off the edge of the page — position 1, position 2, position 3… These are the slots a sequence fills. They are the "" that will "march off to infinity" (a phrase we make precise in Section 2b).

Why the topic needs it: a sequence is a list, and a list needs numbered slots. supplies the slot numbers.


2. Ordering on and : , , ,

The picture: point at two dots on the number line; the one further left is the smaller. "" simply means " sits strictly to the right of " — i.e. it is positive.

Why the topic needs it first: every later statement — "", "", "" — is a comparison. We must fix what "greater/less" means before using it. Note are strict (equality forbidden); allow equality.


2b. What "" means — and the symbol

The picture: the ticks of streaming off the right edge of the page forever. There is no last tick; names that "keeps going" behaviour, marked as an open horizon, never a dot you land on.

Why the topic needs it: the one question of the whole subject is "what happens as grows without bound?" The symbol lets us write that compactly (in and ), but you must always mentally translate it back to "for slots as far right as you like".


3. The real numbers and the number line

The picture: a horizontal line with in the middle, positive numbers () to the right, negative () to the left. Unlike 's isolated ticks, has no holes — between any two points there is always another.

Figure — Sequences — convergence, divergence, boundedness, monotonicity

Why the topic needs it: the values a sequence takes live here. Slot numbers come from (top ruler in the figure); the values they point to are real numbers (bottom line). The "gap-free" property is not decorative — it is the deep fact (Completeness of the Real Numbers) that later powers the Monotone Convergence Theorem.


4. A function

The picture: every tick on the top ruler shoots an arrow down to exactly one point on the number line. Input , input , and so on. A sequence is literally this bundle of arrows.

Why the topic needs it: calling a sequence a "function" is not pedantry — it tells us the rules of functions apply (each input gets exactly one output; we can ask about long-run behaviour just like Limits of functions but only at integer inputs).


5. The term and the whole sequence

The picture: is one dot; is the whole scatter of dots. The parentheses are the "box" that says treat all of them together.

Why the topic needs it: convergence is a property of the whole list, never of one term. We need one symbol for a single value () and a different symbol for the list-as-a-thing ().


6. The subscript index vs. a fixed cutoff , and the tail

The picture: imagine a vertical dashed fence dropped at slot . Everything to the right of the fence is "the tail". is a walker; is the fence post.

Why the topic needs it: the whole definition of convergence is a statement about the tail — "past some fence, every term behaves". The first terms are allowed to misbehave; only matters. Confusing moving- with frozen- makes the definition unreadable.


7. Absolute value — distance

The picture: the length of the gap between two dots, always positive, no matter which is on the left.

Figure — Sequences — convergence, divergence, boundedness, monotonicity

Why the topic needs it: to say " gets close to a target value" we first need a name for that target and a way to measure closeness. Absolute value is the tool that turns "close" into a measurable, sign-free number.


8. The target value

The picture: one special dot on the number line, and we watch whether the sequence's dots pile up on top of it. In figure s03 it is the solid central horizontal line the terms squeeze toward.

Why the topic needs it: "do the terms settle on a single number?" only makes sense once we name that single number. is that name. The distance from Section 7 measures how far term still is from the target.


9. The tolerance and the band around

The picture: two horizontal guide-lines a height above and below , forming a horizontal stripe. The statement means the dot sits inside the stripe.

Figure — Sequences — convergence, divergence, boundedness, monotonicity

Why the topic needs it: "close" is vague; a stripe of any width you name is precise. If we can trap the whole tail in every stripe — even the razor-thin ones — the terms genuinely home in on .


10. The quantifiers and

The picture: is the challenger trying every stripe width; is you finding one fence that works for the width in hand. The order matters: the challenger moves first (), then you respond () — so your may depend on their .

Why the topic needs it: the convergence definition is exactly a two-move game written with these symbols: Read it aloud: "for any stripe, there is a fence past which every tail term lies inside." Every symbol in that line is now defined.


11. Implication , the limit symbol , and divergence

The picture: the arrow is a one-way street — being past the fence forces being inside the stripe (not the reverse). is the single word "converges" wearing a formula costume.

Why the topic needs it: "converges" and "diverges" are the two verdicts the whole subject delivers. You cannot answer the core question without a precise name — and criterion — for the "no, they never settle" case.


12. Bounds: , , , ,

The picture: two horizontal rails, a ceiling and a floor, with all the dots sandwiched between. is the ceiling pushed down until it just touches the dots; is the floor pushed up until it just touches.

Figure — Sequences — convergence, divergence, boundedness, monotonicity

Why the topic needs it: boundedness is a necessary condition for convergence (a sequence diverging to can't settle). And / are the exact values a monotone bounded sequence lands on — the heart of the Monotone Convergence Theorem, guaranteed to exist by Completeness of the Real Numbers.


13. Monotone comparisons: vs

The picture: a staircase that only ever goes up (or only ever goes down) — never a wobble. Contrast : pure zig-zag, not monotone, and (from Section 11) divergent.

Why the topic needs it: monotone + bounded is the winning combination that forces convergence. To test monotonicity you look at the sign of , so you must first know exactly what means.


How these feed the topic

N counting slots

ordering less and greater

infinity as a direction

function a n to a value

R gap-free number line

infinite list a n

index n vs fence N and tail

absolute value as distance

epsilon band around L

target value L

convergence definition

for all and there exists

divergence and diverges to infinity

bounds M m K sup inf

Monotone Convergence

monotone a n plus one vs a n

the number e and recursive limits

Read top to bottom: the number systems and ordering build the notion of a term and the "" horizon; the term plus a moving index plus distance plus a target plus quantifiers build the convergence definition (and its opposite, divergence); bounds plus monotonicity plus that definition build the payoff theorem.


Equipment checklist

Test yourself — cover the right side of each ::: line and answer out loud.

is the set of
counting numbers , going on forever with no largest.
versus
is strictly-left-of (equality forbidden); allows equality.
"" means
sits strictly right of , i.e. is positive.
is
a label for "grows without bound / keeps going", never a number you can reach or plug in.
"" means
let run through slots with no stopping point; ask the long-run behaviour.
pictured as
a continuous, gap-free number line (no holes between points).
means
a rule sending each natural number to exactly one real number .
versus
is one value (a dot); is the whole never-ending list as one object.
Little versus big
is the running slot number; is a fixed "from here on" fence we choose and freeze.
The tail is
the list of all terms past the fence: (first terms dropped).
reads as
the distance between and on the number line (always ).
stands for
the candidate limit — the single fixed value we test whether the terms crowd toward.
is
a challenger-chosen tolerance setting the half-width of the band .
and mean
"for every / no matter which" and "there exists at least one".
says
for any band around , some fence exists past which every tail term lies inside it.
A sequence diverges when
no real passes the test (it oscillates, or grows to ).
means
(terms beat any height) — still a divergence, not a finite limit.
, , are
an upper bound (ceiling), a lower bound (floor), and a symmetric bound .
and are
the least upper bound and greatest lower bound; they exist (by completeness) only when the sequence is bounded above / below.
Increasing versus decreasing
always (up-staircase) versus always (down-staircase).
Why "bounded" alone is not enough
it stops escape to but not wobble; you also need monotonicity (see Bolzano–Weierstrass Theorem for the subsequence rescue).
Recall Where these lead next

With every symbol owned, you can now read the parent note's proofs, the Squeeze Theorem, Cauchy Sequences, and how The number e is defined as a monotone-bounded limit — all built from the foundations above.