Knowing that individual limits exist is only the beginning. In practice you build complex functions from simpler ones using addition, multiplication, division, and so on. The theorems here guarantee that limits respect all of these operations, so you can compute limits piece by piece rather than returning to ε–δ each time.
Throughout this checkpoint, f and g are real-valued functions defined on a set D near a (though not necessarily at a), with limx→af(x)=L and limx→ag(x)=M.
Arithmetic of limits
Theorem. Under the hypotheses above:
- x→alim(f±g)(x)=L±M
- x→alim(f⋅g)(x)=L⋅M
- x→alimg(x)f(x)=ML, provided M=0
- x→alim(c⋅f)(x)=c⋅L for any constant c∈R
Proof of (1). Given ε>0, choose δ1 so that ∣f(x)−L∣<ε/2 for 0<∣x−a∣<δ1, and δ2 so that ∣g(x)−M∣<ε/2 for 0<∣x−a∣<δ2. Then for 0<∣x−a∣<min(δ1,δ2):
∣(f±g)(x)−(L±M)∣≤∣f(x)−L∣+∣g(x)−M∣<2ε+2ε=ε.□
Proof of (2). Write
f(x)g(x)−LM=f(x)(g(x)−M)+M(f(x)−L).
For x sufficiently close to a, f is bounded: ∣f(x)∣≤∣L∣+1. Since g(x)→M and f(x)→L, both terms tend to zero. □
The quotient rule (3) follows from (2) and the separate fact that 1/g(x)→1/M when M=0, which is proved by a standard ε–δ argument using the bound ∣g(x)∣>∣M∣/2 near a.
The squeeze theorem
When you cannot compute a limit directly, trapping the function between two simpler bounds often works.
Theorem (Squeeze / Sandwich theorem). Suppose h(x)≤f(x)≤k(x) for all x∈D near a (with x=a), and
x→alimh(x)=x→alimk(x)=L.
Then limx→af(x)=L.
Proof. Given ε>0, choose δ small enough so that ∣h(x)−L∣<ε and ∣k(x)−L∣<ε both hold for 0<∣x−a∣<δ. Then
L−ε<h(x)≤f(x)≤k(x)<L+ε,
so ∣f(x)−L∣<ε. □
Example. For any function b satisfying ∣b(x)∣≤1,
x→0limx⋅b(x)=0,
because −∣x∣≤x⋅b(x)≤∣x∣ and limx→0∣x∣=0.
This is how limx→0xsin(1/x)=0 is established: sin(1/x) oscillates wildly near 0 but is always bounded by 1, so the factor of x forces the product to 0.
Order preservation
Theorem. If f(x)≤g(x) for all x∈D near a (with x=a), then L≤M.
Proof. Suppose for contradiction that L>M. Set ε=(L−M)/2>0. For x close enough to a, f(x)>L−ε=(L+M)/2 and g(x)<M+ε=(L+M)/2, giving f(x)>g(x) — a contradiction. □
Note that strict inequality f(x)<g(x) does not guarantee strict inequality L<M in the limit. For example, f(x)=0<x2=g(x) for x=0, yet both tend to 0 as x→0.
Local sign preservation
Theorem. If L>0, then f(x)>0 for all x sufficiently close to a with x=a. Symmetrically, if L<0 then f(x)<0 near a.
Proof. Take ε=L/2>0. Choose δ so that ∣f(x)−L∣<L/2 for 0<∣x−a∣<δ. Then f(x)>L−L/2=L/2>0. □
This theorem is used repeatedly when reasoning about sign changes and in the proof that the quotient of continuous functions is continuous wherever the denominator is nonzero.
Summary
- Limit arithmetic: limits respect +, −, ×, ÷ (when the denominator limit is nonzero), and scalar multiplication.
- Squeeze theorem: if h≤f≤k near a and h,k share a common limit L, then f→L as well.
- Order preservation: f(x)≤g(x) near a implies limf≤limg; strict inequality at points does not imply strict inequality at the limit.
- Local sign preservation: a positive limit implies the function is positive in some deleted neighborhood of a.