LeoMath

Foundations of calculus

Limits

Saying “arbitrarily close” precisely with ε–δ.

about 7 min

Start from a problem

Problem

an=nn+1a_n=\dfrac{n}{n+1} never reaches 11, yet we want to say it "tends to 11". Right now that sentence has no testable meaning: how close counts as close? From which term on?

Without a precise definition, "tends to" is a feeling; it can be neither proved nor refuted. We need one sentence that turns "arbitrarily close" into a statement that can be checked.

Observe

Look at the sequence an=nn+1a_n = \dfrac{n}{n+1}: 12, 23, 34, 45, …\tfrac12,\ \tfrac23,\ \tfrac34,\ \tfrac45,\ \dots

It never reaches 11, yet it gets ever closer. We want to say "ana_n tends to 11". But what does "ever closer" mean? bn=1−1nb_n = 1-\tfrac1n also gets closer; cn=1+(−1)nnc_n = 1+\tfrac{(-1)^n}{n} jumps from side to side and also gets closer. What do these three kinds of "approaching" have in common?

Conjecture

This: however small an error you allow, from some term onward every term is within that error of 11.

"However small" becomes an arbitrary positive number ε\varepsilon; "from some term onward" becomes an index NN. That is what we will turn into a definition.

Definition

Definition 1.1Limit of a sequence

Let (an)(a_n) be a real sequence and L∈RL\in\mathbb R. If for every ε>0\varepsilon>0 there exists N∈NN\in\mathbb N such that ∣an−L∣<ε|a_n-L|<\varepsilon whenever n>Nn>N, we say (an)(a_n) converges to LL and write lim⁡n→∞an=L\lim_{n\to\infty}a_n=L.

Mind the order of quantifiers: first an arbitrary ε\varepsilon is given, then we find NN. NN may depend on ε\varepsilon (usually smaller ε\varepsilon forces larger NN). Swapping the order, "there exists NN such that for all ε\varepsilon", would demand an=La_n=L exactly from some point on, which is a different statement.

Definition 1.2Limit of a function

Let ff be defined on a punctured neighbourhood of x0x_0. If for every ε>0\varepsilon>0 there exists δ>0\delta>0 such that ∣f(x)−L∣<ε|f(x)-L|<\varepsilon whenever 0<∣x−x0∣<δ0<|x-x_0|<\delta, we write lim⁡x→x0f(x)=L\lim_{x\to x_0}f(x)=L.

ε\varepsilon controls the output error, δ\delta controls the input window. The definition says: however accurate you want the output, you can find how accurate the input must be.

Derivation: verifying a limit from the definition

Example 1.1

Show lim⁡n→∞nn+1=1\lim_{n\to\infty}\dfrac{n}{n+1}=1.

Let ε>0\varepsilon>0. We need ∣nn+1−1∣=1n+1<ε\left|\dfrac{n}{n+1}-1\right|=\dfrac1{n+1}<\varepsilon, which holds when n+1>1εn+1>\tfrac1\varepsilon. Take N=⌈1ε⌉N=\lceil\tfrac1\varepsilon\rceil; then for n>Nn>N, 1n+1<1N≤ε\tfrac1{n+1}<\tfrac1N\le\varepsilon.

The pattern is always the same: simplify ∣an−L∣|a_n-L| to an expression in nn, then solve for how large nn must be.

Theorems and proofs

Theorem 1.1Uniqueness of the limit

If lim⁡an=L\lim a_n=L and lim⁡an=M\lim a_n=M, then L=ML=M.

Proof

Suppose L≠ML\ne M and set ε=∣L−M∣2>0\varepsilon=\tfrac{|L-M|}2>0. There are N1,N2N_1,N_2 with ∣an−L∣<ε|a_n-L|<\varepsilon for n>N1n>N_1 and ∣an−M∣<ε|a_n-M|<\varepsilon for n>N2n>N_2. For n>max⁡(N1,N2)n>\max(N_1,N_2), ∣L−M∣≤∣L−an∣+∣an−M∣<2ε=∣L−M∣,|L-M|\le|L-a_n|+|a_n-M|<2\varepsilon=|L-M|, a contradiction.

Theorem 1.2Algebra of limits

If an→La_n\to L and bn→Mb_n\to M, then an+bn→L+Ma_n+b_n\to L+M, anbn→LMa_nb_n\to LM, and if M≠0M\ne0, an/bn→L/Ma_n/b_n\to L/M.

Proof

We prove the product rule, the most instructive case. Write anbn−LM=(an−L)bn+L(bn−M).a_nb_n-LM=(a_n-L)b_n+L(b_n-M). A convergent sequence is bounded: there is BB with ∣bn∣≤B|b_n|\le B for all nn. Given ε>0\varepsilon>0, choose NN so that for n>Nn>N, ∣an−L∣<ε2B|a_n-L|<\dfrac{\varepsilon}{2B} and ∣bn−M∣<ε2(∣L∣+1)|b_n-M|<\dfrac{\varepsilon}{2(|L|+1)}. Then ∣anbn−LM∣≤∣an−L∣ B+∣L∣ ∣bn−M∣<ε2+ε2=ε.|a_nb_n-LM|\le|a_n-L|\,B+|L|\,|b_n-M|<\tfrac\varepsilon2+\tfrac\varepsilon2=\varepsilon.

Theorem 1.3Squeeze theorem

If an≤cn≤bna_n\le c_n\le b_n for all large nn, and an→La_n\to L, bn→Lb_n\to L, then cn→Lc_n\to L.

Proof

Given ε>0\varepsilon>0, pick NN so that for n>Nn>N, L−ε<anL-\varepsilon<a_n and bn<L+εb_n<L+\varepsilon. Then L−ε<an≤cn≤bn<L+εL-\varepsilon<a_n\le c_n\le b_n<L+\varepsilon, i.e. ∣cn−L∣<ε|c_n-L|<\varepsilon.

Common mistake

The quantifiers do not commute. "For every ε\varepsilon there is NN" and "there is NN such that for every ε\varepsilon" are different sentences: the second demands that ana_n equal LL from some term on. Also, whether a limit exists has nothing to do with whether ana_n ever equals LL; nn+1\frac n{n+1} never equals 11.

Application: a fundamental limit

Application

lim⁡x→0sin⁡xx=1.\lim_{x\to0}\frac{\sin x}{x}=1.

For 0<x<π20<x<\tfrac\pi2 compare three areas in the unit circle: the triangle 12sin⁡x\tfrac12\sin x, the sector 12x\tfrac12x, the larger triangle 12tan⁡x\tfrac12\tan x. Hence sin⁡x<x<tan⁡x\sin x<x<\tan x, so cos⁡x<sin⁡xx<1\cos x<\dfrac{\sin x}{x}<1. Since cos⁡x→1\cos x\to1, the squeeze theorem finishes the job; for x<0x<0 use that sin⁡xx\dfrac{\sin x}x is even.

This single limit is the entire source of sin⁡′x=cos⁡x\sin'x=\cos x in The derivative.

Remark

A limit is not "the value finally reached" but "the value that can be approached arbitrarily closely". It does not matter that ana_n never equals 11. For the same reason 0.999…=10.999\ldots=1: it is a limit, not a number that is "slightly short".

Exercises

01
Compute lim⁡x→0sin⁡3xx\displaystyle\lim_{x\to 0}\frac{\sin 3x}{x}.
02
Let f(x)=2x+1f(x)=2x+1. Which δ\delta guarantees ∣f(x)−3∣<ε|f(x)-3|<\varepsilon whenever 0<∣x−1∣<δ0<|x-1|<\delta?