Mathematics · lesson 1 of 3
Sequence limits and epsilon proofs
For every ε>0 there exists N such that every n≥N satisfies the error bound.
Learn the ideas
Prerequisites: Logic, inequalities and real sequences.
Quantifier order
For every ε>0 there exists N such that every n≥N satisfies the error bound.
Construct N
Solve the desired inequality for n, then choose an integer cutoff meeting it.
Cauchy criterion
A real sequence converges exactly when it is Cauchy, using completeness of the reals.
Counterexamples
One carefully verified counterexample refutes a universal claim; many examples do not prove it.
Worked examples
Prove 1/n tends to zero using the epsilon definition.
Credit the order of quantifiers, an explicit N, and a bound for every n≥N.
Given ε>0, choose an integer N>1/ε. For n≥N, 0<1/n≤1/N<ε.
Prove every convergent real sequence is bounded.
Credit both tail control and the finite initial segment.
If a_n→L, eventually abs(a_n−L)<1, so the tail is bounded by abs(L)+1. Take the maximum of that bound and the finitely many initial absolute values.
Check your understanding
8 questionsDecimals or fractions are accepted for numeric answers. Proofs and written responses use sample answers and require human marking. This is practice, not a protected examination.
Further reading and review references
These are reference links, not copied exercises, institutional endorsement or proof of independent review.