You drop a stone from a bridge. How fast is it falling exactly one second later? A
speedometer would need to measure a speed at a single instant, but speed is distance divided
by time, and in a single instant the stone covers no distance in no time.
What we can compute are average speeds. Near the Earth’s surface the stone has fallen about
s(t)=5t2 metres after t seconds. Over the time interval from 1 to 1+h seconds it
falls s(1+h)−s(1) metres, so its average speed is
(For h<0 this is the average over the interval from 1+h to 1.) We cannot put h=0:
that gives 00. But we can make h small.
Figure 1:Graph of the average speed h5(1+h)2−5 for −1≤h≤1, with a hole at
h=0, where the formula is undefined, and a point on the graph that a slider for h moves.
A table lists the values for h=±0.1,±0.01,±0.001: 10.5, 10.05, 10.005 and
9.995, 9.95, 9.5. They approach 10 from both sides.
Try this: move h towards 0 from both sides. Which number do the average speeds
approach? What happens when you try to put h=0 in the formula?
The average speeds approach 10, so the stone’s speed at t=1 should be 10 metres per
second. This page makes “approach” precise. That matters, because tables and pictures can
mislead. The sine function appears in the next figure and the paragraph after it, the worked
example on sin(1/x), the common mistake “Checking one ε, or a few points”, and the
exercise on sin(π/x) (its statement, hints and solution). They use only the facts about it
in the box below.
Figure 2:Graph of y=sin(π/x) for −1≤x≤1, x=0. It stays between -1 and 1.
Near x=0 it rises to height 1 and falls back through 0 again and again, faster and
faster, too fast to draw: the plotted curve joins finitely many computed points, so close to 0 it is a jumble of lines that misses most of the swings, with
even a short flat piece at height 0, an artefact of the drawing. A table lists the values at
x=0.1,0.01,0.001, where the exact values are sin(10π)=sin(100π)=sin(1000π)=0 (the
computer shows tiny numbers such as −1.2×10−15 instead, because it rounds
π), and at x=0.08,0.016,0.0032, where the values are
sin(12.5π)=sin(62.5π)=sin(312.5π)=1.
Try this: cover the last three rows of the table. What limit at 0 do the first three
suggest? Now look at the last three. Does the graph near 0 settle near one height?
Both halves of the table are correct, and they suggest different answers. A table checks
finitely many points, and a graph is drawn through finitely many points, so neither can tell
us what happens at every point near 0. We need a definition that speaks about all of
them. With it, we will show that the average speeds really do approach 10
(Example 2) and that sin(π/x) approaches no number at all
(Exercise 9).
Informally, limx→af(x)=L means that f(x) is as close to L as we like for all
x close enough to a, but not equal to a. “As close as we like” is a tolerance, which we
call ε, and “close enough” is a distance, which we call δ.
In words. Whatever tolerance ε someone demands around L, you can answer with a
window of half-width δ around a such that every x in that window, other than a
itself, has f(x) within the tolerance. Think of it as a game. A challenger names an
ε>0; you reply with a δ>0; you win the round if every x in your window passes.
The limit is L when you can win every round. Three points to notice:
δ is chosen after ε, so it may depend on ε (and on a), but it is one
number for the whole window: it may not depend on x.
The window leaves out x=a. The value f(a), and whether it exists, plays no part.
If a δ wins a round, so does every smaller δ>0: a smaller window has fewer
points to check. Since f is defined on an open interval around a (except at a), a
small enough window lies inside that interval, so the requirement that f be defined in the
window only rules out windows that are too wide.
Example.limx→ax=a for every real a. Given ε>0, take
δ=ε. If 0<∣x−a∣<δ, then ∣f(x)−a∣=∣x−a∣<ε.
Non-example.limx→1x is not 1.5. Take ε=0.25. Whatever δ>0
is offered, the window contains the point x=1+d with d=21min(δ,0.25),
and for it ∣f(x)−1.5∣=∣d−0.5∣=0.5−d≥0.375, which is not less than
0.25. So no δ wins the round ε=0.25, and 1.5 is not the limit. One round
that cannot be won is enough.
The game is easiest to understand by playing it. In the figure, the claim is
limx→2x2=4.
Figure 3:Graph of y=x2 for 1≤x≤3, with a horizontal band of half-width ε around
y=4 (translucent, dashed edges) and a vertical window 0<∣x−2∣<δ
(translucent, solid edges; the dotted line x=2 itself is left out). A slider sets ε
from 0.05 to 1.5 in steps of 0.05, starting at 0.5. For each ε the widget states
the largest δ it found on each side of 2, and how many points it checked, and then
the smaller of the two as the largest δ it found for both sides. For ε=0.5 it
reports 0.129171 on the left and 0.12132 on the right; the exact values are
2−3.5≈0.129171 and 4.5−2≈0.121320. A second slider sets
your own δ, from 0.001 to 1 in steps of 0.001, and a button sets it to the largest
value on that slider that is at most the δ the widget found. Points of the graph inside
the window but outside the band are marked with crosses, and a sentence says whether your
δ passed the widget’s check at the points it tested, or names a point where it fails.
Try this: play the ε–δ game.
Select the ε slider and press ← eight times, to ε=0.1. Read the largest
δ the widget found on the left of 2 and on the right. (It reports 0.0251582 on
the left and 0.0248456 on the right.)
You must answer with oneδ. Which of the two numbers can you use, and why not the
other?
Press Set δ to the largest on the slider (δ=0.024), then select the δ
slider and press → once (δ=0.025). Where does the widget see your δ fail?
Try ε=0.05 and ε=1. What happens to the δ the widget finds as ε
shrinks?
Why the smaller one. The window 0<∣x−2∣<δ reaches the same distance
δ on both sides of 2, so one δ has to work on the left and on the right at
once. For ε=0.1, a δ larger than 4.1−2≈0.024846 (the widget
found 0.0248456) lets in points just to the right of 4.1, where x2 is already
outside the band (at x=2.025, x2=4.100625); the left side would tolerate up to
2−3.9≈0.025158, but that does not help. So the δ for both sides is
the smaller of the two, here the right side’s, because x2 grows faster to the right of 2
than it falls to the left. As ε shrinks, the band narrows and so does the
window.
The widget’s numbers are observations: it checks finitely many points, so it cannot prove that
its δ works for every x in the window, or that a δ exists for every ε.
Exercise Exercise 5 finds the exact largest δ for
ε=0.1, and the rigorous track proves, in Example 6, that
δ=min(1,ε/5) works for every ε>0. That δ is smaller than the
largest one (for ε=0.1 it is 0.02): a proof only needs someδ that works.
Could a function have two different limits at the same point? The game suggests not: if
f(x) is within any tolerance of L for all x close enough to a, it cannot also be
within every tolerance of a different number M, because L and M are a fixed distance
apart.
We argue by contradiction: if L=M, we take a tolerance of half their distance and find one
x whose value f(x) would have to be within that tolerance of both, which the triangle
inequality forbids.
Suppose L=M, and let ε=21∣L−M∣, which is positive. Since
limx→af(x)=L, there is a δ1>0 such that f is defined and
∣f(x)−L∣<ε for every x with 0<∣x−a∣<δ1. Since
limx→af(x)=M, there is a δ2>0 such that f is defined and
∣f(x)−M∣<ε for every x with 0<∣x−a∣<δ2.
Let δ=min(δ1,δ2) and x=a+2δ. Then
0<∣x−a∣=2δ<δ, so x lies in both windows: f(x) is defined,
and ∣f(x)−L∣<ε and ∣f(x)−M∣<ε. The first of these says also that
∣L−f(x)∣<ε, because ∣L−f(x)∣=∣f(x)−L∣ by
property 2 of the absolute value. By
part (b) of the triangle inequality,
∣u−v∣≤∣u−w∣+∣w−v∣, with u=L, v=M and w=f(x),
that is, ∣L−M∣<∣L−M∣, which is impossible. So L=M.
Because of Theorem 1, we may speak of the limit of f(x) as x→a,
when there is one. If there is none, we say that the limit does not exist. The proof used
the requirement in Definition 1 that f be defined at every point of the window; the
rigorous track shows that if the definition dropped its requirements on the domain of f,
uniqueness would fail.
Each proof has the same shape. We start from ∣f(x)−L∣ and rewrite it in terms of
∣x−a∣ (the scratch work); this tells us which δ to choose; then we check that
this δ works.
To show that a number L is not the limit, one round of the game that cannot be won is
enough: one ε>0 such that every window 0<∣x−a∣<δ, however small,
contains a point x with ∣f(x)−L∣≥ε (or where f is undefined). To show that
the limit does not exist, we must do this for every real number L. The next three examples
show the three typical ways this happens: a jump, oscillation, and unbounded values. Each proof
uses the same tool: two points of one window whose values are too far apart to be close to the
same number L.
Goal. Given ε>0, find δ>0 such that 0<∣x−2∣<δ implies
∣∣x2−4∣∣<ε. The function x2 is defined for every x.
Scratch work.∣∣x2−4∣∣=∣x−2∣∣x+2∣. The first factor is the one
that δ controls. The second, ∣x+2∣, changes with x, so we first bound it on a
fixed window.
Why the 1? It caps the window, and that is what makes ∣x+2∣<5 true. Without it,
δ=5ε fails for large ε: for ε=100 it gives δ=20, and
x=21 is in the window but ∣∣212−4∣∣=437>100. Any fixed cap would do; a cap of
21 gives ∣x+2∣<4.5 and δ=min(21,4.5ε).
Check. For ε=0.5: δ=min(1,0.1)=0.1, below the largest δ that the
ε–δ figure reports for both sides, 0.12132. ✓ The point
x=2.09 gives ∣∣2.092−4∣∣=0.3681<0.5. ✓
Here domf is the domain of f. The order matters.
“∃δ>0∀ε>0” would ask for one window that works for every
tolerance at once. For f(x)=x at a=0, with L=0, that is false: for each
δ>0, the tolerance ε=2δ fails at the point x=43δ
of the window, where ∣f(x)−0∣=43δ≥2δ.
To negate, each ∀ becomes ∃ and each ∃ becomes ∀, the
implication P⟹Q becomes “P and not Q”, and, by De Morgan’s law,
“not (A and B)” becomes “(not A) or (not B)”. So L is not the limit when
This is the pattern of the three non-existence examples: one ε, and for each δ a
point x that fails.
Why “0<∣x−a∣”?
The condition 0<∣x−a∣ removes x=a from every window. Without it, the
definition would demand ∣f(a)−L∣<ε for every ε>0, that is, f(a)=L, and
it would not apply at all where f(a) is undefined. Both are exactly the cases we need
limits for: the average speed h5(1+h)2−5 is undefined at h=0. The
definition is built to describe how f behaves neara, which is information that f(a)
cannot give.
Why f must be defined near a
Definition 1 asks for f to be defined on an open interval around a (except
possibly at a), and, in its domain clause, for f to be defined at every point of the
window. The proof of Theorem 1 rests on that clause of the definition: it picks
a point x=a+2δ in the window and uses f(x).
Suppose the definition dropped both requirements, the open interval and the domain clause,
and only asked that “x∈domf and 0<∣x−a∣<δ imply
∣f(x)−L∣<ε”. Take f(x)=x and a=−1. For δ≤1 no x in the
domain [0,∞) satisfies 0<∣x+1∣<δ, so the condition holds for everyL, and every real number would be “the limit” of x at -1. Uniqueness fails, so
that version of the definition needs a further hypothesis.
Many analysis books use such a domain-relative definition, with the hypothesis that every
window around a contains points of the domain other than a (a is a limit point of the
domain). It agrees with ours whenever f is defined on an open interval around a (except
possibly at a), and it also allows endpoints: it gives limx→0x=0, where
our definition does not apply, because x is undefined to the left of 0.
The δ may depend on ε and a, never on x. To prove a limit, rewrite
∣f(x)−L∣ in terms of ∣x−a∣, choose δ, then check it; for a quadratic,
cap the window first, as in δ=min(1,5ε).
As x approaches 0, the values seem to approach 21: those from the right increase
towards it and those from the left decrease towards it. At x=±0.001 they agree to two
decimal places, 0.50. So we estimate the limit as 0.50. This is an
estimate, not a proof: a table checks only finitely many points
(Why this matters).
∣f(x)−7∣=∣5x−5∣=5∣x−1∣, so ∣f(x)−7∣<0.01 exactly when
∣x−1∣<0.002. Hence every δ≤0.002 works. A larger δ does not: its
window contains x=1.002, where ∣f(x)−7∣=0.01, which is not less than 0.01.
The largest δ is 0.002=5001.
For x=0, x2>0, so multiplying by the positive number 10000x2 shows
that x21>10000 exactly when x2<100001. Now x2=∣x∣2, by
property 5 of the absolute value, and
100001=(1001)2. Both ∣x∣ and 1001 are
non-negative, so by the order part of the square-root remark, which is
also property 6 of the absolute value, this holds exactly
when ∣x∣<1001.
So δ=1001 works. A larger δ does not: its window contains
x=1001, where f(x)=10000, which is not greater than 10000.
The same argument works for any bound in place of 10000, which is why no number L can be
the limit (Example 5).
By part (a) of the proposition on distance inequalities, applied to
x2 with a=4 and δ=0.1, ∣∣x2−4∣∣<0.1 means 3.9<x2<4.1. For
x>0, this means 3.9<x<4.1, by the order part of
the square-root remark: for s,t≥0, s<t exactly when
s2<t2, and here (3.9)2=3.9 and (4.1)2=4.1. Every window below
lies in x>0.
(a) For x>2 the condition x>3.9 holds automatically (3.9<2, by the
same order part, since 3.9<4=22), so we need x<4.1 for every x in
(2,2+δ). That holds exactly when 2+δ≤4.1. The largest δ
is 4.1−2≈0.0248457.
(b) For x<2 the condition x<4.1 holds automatically (2<4.1, since
22=4<4.1), so we need x>3.9 for every x in (2−δ,2), that is,
2−δ≥3.9. The largest δ is 2−3.9≈0.0251582.
(c) The window works on both sides exactly when δ is at most both numbers, so the largest
is the smaller one. To compare them without a calculator: 4.1−2<2−3.9
means 4.1+3.9<4. We compare squares, using the order part of
the square-root remark for non-negative numbers. First,
(4.13.9)2=4.1⋅3.9=15.99<16=42, so
4.13.9<4. Then
so 4.1+3.9<4. So the right side’s value 4.1−2 is the smaller
one, and it is the answer to (c).
The widget reports 0.0248456 and 0.0251582: here, these are the exact values rounded down to
six significant digits. Its method promises less: the δ it reports passed at every point
it checked and lies below every point where it saw the check fail, and it may be smaller than
the exact value by about 10-5 of that value.
In the answer, the square roots are written with whole numbers under the root:
4.1=10410, because 10410≥0 and
(10410)2=100410=4.1, and the square root is unique
(the square-root remark). In the same way,
3.9=10390.
so ∣v(h)−20∣=5∣h∣. Given ε>0, let δ=5ε: if
0<∣h∣<δ, then ∣v(h)−20∣=5∣h∣<ε. So
limh→0v(h)=20 m/s.
(b) ∣v(h)−20∣<0.1 exactly when 5∣h∣<0.1, that is, ∣h∣<0.02. So
δ=0.02 s =501 s works, and no larger δ does: at h=0.02 the
difference is exactly 0.1 m/s.
For x<0, ∣∣H(x)−21∣∣=∣∣0−21∣∣=21, and for x>0,
∣∣H(x)−21∣∣=∣∣1−21∣∣=21. So at every x=0 the distance from
H(x) to 21 is exactly 21.
If ε>21, every δ>0 works, because 21<ε at every point of
every window.
If 0<ε≤21, no δ works: every window contains, for example,
x=2δ, where the distance is 21≥ε.
So the set is (21,∞). The claim fails: the definition needs a δ for everyε>0, and already ε=21 has none. So 21 is not the limit. (No other
number is either: the argument of Example 3 works for H with the values 0 and
1 and ε=21.)
It is false. We show that 0 is not the limit by finding one ε that no δ can
answer: ε=21.
For an integer n≥1 let xn=4n+12. Then xnπ=2πn+2π, so sin(xnπ)=1. (The last three rows of the table are
xn for n=6,31,156.)
Let δ>0. By the Archimedean property, there is an
integer n≥1 with n>2δ1. Then 4n+1>4n>δ2, so
0<xn=4n+12<δ: the point xn is in the window. There
∣sin(π/xn)−0∣=1≥21. So every window contains a point that fails, no
δ works for ε=21, and limx→0sin(π/x)=0.
In fact the limit does not exist at all. The points n1 give
sin(nπ)=0 and the points xn give 1, and both kinds lie in every window, so the
argument of Example 4 applies with these points.
Found an error on this page? Report it (the form opens with this page filled in).
Every page of the Limits chapter plays the ε–δ game of this page: the limit laws are proved
with it, once, so that later limits can be computed without it.