Skip to content
Tutorials Center
My learning

Topics

Lesson 11 of 37 · Sequences and Limits

Limit Laws and the Squeeze Theorem

Prove that limits respect sums, products and quotients, use the squeeze theorem, and compute limits like n-th roots and rational expressions.

Proving every limit from the epsilon-N definition would be exhausting. Fortunately limits behave well under arithmetic, so most limits can be built from a few basic ones. This lesson proves the limit laws and the squeeze theorem, two tools that handle nearly every sequence you will meet.

The algebra of limits

Theorem. If a_n → a and b_n → b, then:

  1. a_n + b_n → a + b
  2. c·a_n → c·a for any constant c
  3. a_n·b_n → ab
  4. a_n / b_n → a/b if b ≠ 0 (and b_n ≠ 0 for all n)
  5. If a_n ≤ b_n for all n then a ≤ b.

Proof of (1). Let ε > 0. Choose N_1 with |a_n - a| < ε/2 for n ≥ N_1, and N_2 with |b_n - b| < ε/2 for n ≥ N_2. For n ≥ N = max(N_1, N_2), the triangle inequality gives

|(a_n + b_n) - (a + b)| ≤ |a_n - a| + |b_n - b| < ε/2 + ε/2 = ε. ∎

Proof of (3). Since (b_n) converges it is bounded, say |b_n| ≤ B. Write

a_n b_n - ab = (a_n - a) b_n + a (b_n - b).

So |a_n b_n - ab| ≤ B|a_n - a| + |a||b_n - b|. Given ε > 0 make |a_n - a| < ε/(2B) and |b_n - b| < ε/(2(|a| + 1)) for large n; the right side is below ε. ∎

Splitting ε into pieces such as ε/2 is a standard technique, the "epsilon over two" trick.

Proof idea of (4). Show 1/b_n → 1/b (since |b_n| > |b|/2 for large n, |1/b_n − 1/b| = |b − b_n|/(|b_n||b|) < 2|b − b_n|/|b|²), then apply (3).

Python Limits of rational expressions

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

To compute (3n² + 5n)/(2n² − 7): divide top and bottom by n² to get (3 + 5/n)/(2 − 7/n²). Since 1/n → 0 and 1/n² → 0, the laws give 3/2.

The squeeze theorem

Theorem. If a_n ≤ b_n ≤ c_n for all n (or from some index on) and a_n → L and c_n → L, then b_n → L.

Proof. Given ε > 0, pick N so for n ≥ N: L − ε < a_n and c_n < L + ε. Then L − ε < a_n ≤ b_n ≤ c_n < L + ε, so |b_n − L| < ε. ∎

Example. sin(n)/n → 0: −1/n ≤ sin(n)/n ≤ 1/n, and both outer sequences tend to 0.

Example. n^{1/n} → 1. For n ≥ 2 write n^{1/n} = 1 + h_n with h_n ≥ 0. By the binomial expansion, n = (1 + h_n)ⁿ ≥ 1 + n(n−1)/2 · h_n², so h_n² ≤ 2/n, hence 0 ≤ h_n ≤ √(2/n) → 0. Squeeze gives h_n → 0.

Python Squeezing sin(n)/n and the n-th root of n

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Other useful limits

Sequence Limit Idea
c^{1/n}, c > 0 1 squeeze or monotone
rⁿ, ` r < 1`
n/rⁿ, r > 1 0 rⁿ grows faster than any power of n
(1 + 1/n)ⁿ e monotone bounded (next lesson)
√(n + 1) − √n 0 multiply by the conjugate

Example. √(n + 1) − √n = 1/(√(n + 1) + √n), and 0 < 1/(√(n+1) + √n) < 1/(2√n), which tends to 0 (squeeze). The conjugate trick turns a difference of large numbers into a small fraction.

Always look for a rewriting before attacking with epsilons: divide by the top power, multiply by a conjugate, or squeeze between simple bounds.

Python Conjugate trick numerically

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

The rewritten form is also more accurate in floating-point arithmetic, because it avoids subtracting two nearly equal numbers.

Check your understanding

Quick check · 4 questions

of 4 answered You scored / 4 · perfect!

  1. 1. If a_n → 2 and b_n → 5, what does a_n·b_n converge to?

    The limit of a product is the product of the limits.
  2. 2. What does the squeeze theorem need?

    Two outer sequences with a common limit trap the middle one.
  3. 3. What is the limit of (3n² + 5n)/(2n² − 7)?

    Divide by n²: (3 + 5/n)/(2 − 7/n²) → 3/2.
  4. 4. Which is correct about inequalities and limits?

    Strict inequality can become equality in the limit: 0 < 1/n but both limits compare as 0 ≤ 0.

Summary

  • Limits respect sums, constant multiples, products and quotients (with nonzero denominator limit).
  • The "epsilon over two" trick and boundedness of convergent sequences drive the proofs.
  • Squeeze theorem: a sequence between two sequences with the same limit has that limit.
  • Compute rational-function limits by dividing by the highest power; use conjugates for square-root differences.
  • Weak inequalities are preserved by limits; strict ones are not.

Next: The Monotone Convergence Theorem