Real Analysis · Undergraduate
Limits of Sequences: The ε-N Definition
Quick answer
A sequence a₁, a₂, a₃, … converges to L when its terms eventually stay as close to L as anyone demands. Precisely: for every ε > 0 there is an N such that |aₙ − L| < ε for all n > N. A proof finds N in terms of ε, often by working backward from the inequality. To show that a sequence diverges, find one ε that no N can meet, as for (−1)ⁿ. From the definition, limits are unique and convergent sequences are bounded.
What you'll learn
- State the ε-N definition of a limit
- Prove limits like 1/n → 0 and (2n + 1)/(n + 3) → 2
- Prove that a sequence diverges
- Prove that limits are unique and convergent sequences are bounded
Eventually as close as anyone wants
A sequence converges to , written , if
Read it as a game. A challenger names a tolerance . You answer with an index such that every term after the -th lies inside the band . If you can always answer, the limit is . It mirrors the ε-δ definition for functions, with “far enough along the sequence” in place of “close enough to ”.
Why the order of the quantifiers matters
is chosen after , so it may depend on : smaller tolerances usually need larger . But is chosen before , so one must work for every later term at once. The definition does not ask that terms get closer at every step, only that from some point on they never leave the band. A sequence can wander early and still converge; what happens in the first million terms never affects the limit.
Worked examples
Common mistakes
Practice problems
-
Prove that .
Answer
Choose .
Full solution
For , .
-
Prove that .
Answer
; choose .
Full solution
For , .
-
For and , find the smallest whole number such that every has .
Answer
Full solution
Need , that is , so .
-
Prove that diverges.
Answer
It is unbounded, and convergent sequences are bounded.
Full solution
For any and , terms with are more than away from .
-
Prove that if , then .
Answer
.
Full solution
The same that works for works for .
-
Does imply that converges? Answer yes or no.
Answer
No
Full solution
has for all , yet it diverges.
-
Write the negation of in symbols.
Answer
Full solution
Flip each quantifier and negate the inequality.
-
A student proves by saying ” gets smaller and smaller.” Why is that not a proof?
Answer
Decreasing does not imply a limit of : also decreases but tends to .
Full solution
A proof must show the terms eventually stay within every of , with an explicit .
Frequently asked questions
What does aₙ → L mean?
For every ε > 0 there is a natural number N such that |aₙ − L| < ε whenever n > N.
How do you find N in a proof?
Work backward: simplify |aₙ − L|, find which n make it smaller than ε, and choose N accordingly. Then write the proof forward.
How do you prove a sequence diverges?
Show that for every candidate L, some ε > 0 has terms at distance at least ε from L beyond every N.
Can a sequence have two limits?
No. If aₙ → L and aₙ → M, the terms would eventually be within ε of both, which forces |L − M| < 2ε for every ε, so L = M.
Is every convergent sequence bounded?
Yes. Beyond some N all terms lie within 1 of L, and the finitely many earlier terms have a largest size.