Squeeze theorem for sequences: Foundations — Maths deep dive

Before you can trust that picture, you must be fluent in every symbol the parent note throws at you. We build them one at a time, from absolute zero — each one earns its place before the next appears.

1. The subscript $n$ and the notation $(a_{n})$

Picture a row of numbered lockers. Locker $1$ holds $a_{1}$ , locker $2$ holds $a_{2}$ , and so on — the lockers never run out. $n$ is which locker you point at; $a_{n}$ is what's inside.

Why the topic needs it. The Squeeze Theorem talks about three lists — $(a_{n})$ , $(b_{n})$ , $(c_{n})$ — being compared at the same locker $n$ . Without the subscript we could not say "at each position, the middle number sits between the outer two."

2. The arrow $\to$ , $\infty$ , and the symbol $lim$

Picture walking down the endless locker row and watching the numbers inside. If they get closer and closer to a fixed height $L$ and stay near it, that $L$ is the limit.

Why the topic needs it. The whole conclusion " $b_{n} \to L$ " is a statement about this settling-down behaviour. The intuition above ("pile up around $L$ ") is enough to read the theorem, but to prove it we need a precise meaning of "pile up," which we build in Sections 3–4.

See Limit of a sequence (epsilon-N definition) for the full machinery — here we only need the picture.

3. Absolute value $∣ x ∣$ — distance on the number line

Picture the number line as a ruler. $∣ b_{n} - L ∣$ is simply how far the term $b_{n}$ is from the target $L$ — you don't care which side it's on, only the gap.

Why the topic needs it. "The sequence gets close to $L$ " is made exact as " $∣ b_{n} - L ∣$ becomes tiny." We are about to name exactly how tiny — that is the job of $ε$ in the next section, and only once $ε$ exists can we turn this distance into the two-sided band the proof uses.

4. Epsilon $ε$ and the index $N$ — "how close" and "how far out"

Now that $ε$ has a meaning, the distance idea from Section 3 becomes a precise two-sided statement:

Why the topic needs it. The parent's proof literally plays this game three times — once for the lower wall $a_{n}$ , once for the upper wall $c_{n}$ , then it combines the two thresholds those games produce. Section 6 names those thresholds ( $N_{0}$ , and the two the walls give); the point here is that no line of the proof makes sense without $ε$ and a threshold $N$ .

5. The inequality chain $a_{n} \leq b_{n} \leq c_{n}$

Picture three dots on a vertical ruler at each locker: a bottom dot $a_{n}$ , a top dot $c_{n}$ , and $b_{n}$ pinned somewhere between them.

Why the topic needs it. This chain is the sandwich. Combined with $ε$ - $N$ , the outer walls squeezing to $L$ drag $b_{n}$ into the band.

6. "Eventually" and the three thresholds $N_{0}, N_{1}, N_{2}$

Picture ignoring the first stretch of the locker row entirely; only the endless tail counts. Limits are blind to any finite starting chunk.

The Squeeze proof juggles three such thresholds, and it is worth naming them now:

$N_{0}$ — the locker from which the sandwich $a_{n} \leq b_{n} \leq c_{n}$ holds (the "eventually" of the inequality).
$N_{1}$ — the threshold the lower wall's limit game (Section 4) hands you: from $N_{1}$ on, $a_{n}$ is inside its $ε$ -band.
$N_{2}$ — the threshold the upper wall's game hands you: from $N_{2}$ on, $c_{n}$ is inside its band.

To make all three facts true at once you step out to whichever is furthest, $N = max (N_{0}, N_{1}, N_{2})$ — past that locker every ingredient is in place.

Why the topic needs it. The parent stresses " $a_{n} \leq b_{n} \leq c_{n}$ for all $n \geq N_{0}$ " and then combines walls at $N = max (N_{0}, N_{1}, N_{2})$ . You never have to prove the bound from locker $1$ — just from some point on.

a_{n}

mean and what picture goes with it?

The

n

-th number in an endless list; the contents of locker number

n

What do

lim

\to

, and

=

do in

lim_{n \to \infty} a_{n} = L

lim

names the single settling number,

\to

means "heads toward,"

=

asserts it is

L

Rewrite

∣ b_{n} - L ∣ < ε

without the absolute value.

L - ε < b_{n} < L + ε

In the

ε

N

game, who picks

ε

and who must respond?

An opponent picks a tiny

ε

; you must find a threshold

N

that works for it.

What are the three thresholds

N_{0}, N_{1}, N_{2}

in the Squeeze proof?

N_{0}

where the sandwich holds,

N_{1}

where the lower wall enters its band,

N_{2}

where the upper wall enters its band.

What does

a_{n} \leq b_{n} \leq c_{n}

let you conclude on its own (no limits)?

Only that the middle sits between the walls at each locker — nothing about limits yet.

Why must the bound only hold for

n \geq N_{0}

, not all

n

Limits ignore any finite chunk at the start of a sequence.

Why is dividing

- 1 \leq sin n \leq 1

n

safe but by a negative not?

n

is positive so the chain keeps direction; a negative multiplier flips every inequality.

What does "bounded" give the Squeeze Theorem?

Ready-made constant walls (like

- 1 \leq sin n \leq 1

) to fence in a messy term.

Connections

Parent topic (Hinglish) — where these tools assemble.
Limit of a sequence (epsilon-N definition) — the precise meaning of $\to$ , $ε$ , $N$ .
Bounded sequences — where the walls come from.
Algebra of limits (sum, product, quotient) — the alternative when the middle term is tame.
Squeeze theorem for functions — the same idea for continuous inputs.
Standard limits ( n-th roots, n!/n^n, ln n / n ) — the wall-limits the examples reuse.

Foundations — Squeeze theorem for sequences

1. The subscript $n$ and the notation $(a_{n})$

2. The arrow $\to$ , $\infty$ , and the symbol $lim$

3. Absolute value $∣ x ∣$ — distance on the number line

4. Epsilon $ε$ and the index $N$ — "how close" and "how far out"

5. The inequality chain $a_{n} \leq b_{n} \leq c_{n}$

6. "Eventually" and the three thresholds $N_{0}, N_{1}, N_{2}$

7. Bounded sequences — where the walls come from

How these feed the topic

Equipment checklist

Connections