Calculus I · Getting Arbitrarily Close
What continuity guarantees: two theorems you’ll use everywhere
Continuity does more than keep graphs tidy — it forces a continuous function to behave in two powerful ways, and the entire back half of this book leans on both. Neither is obvious, and both turn out to rest on the same deep fact about the real numbers.
The Intermediate Value Theorem: you can’t cross without touching
Intermediate Value Theorem (IVT). If is continuous on , then for every value between and , there is at least one point in with .
The picture is exactly the “no lifting the pen” idea. To get from height to height , a continuous graph must sweep through every height in between — it cannot teleport over a value. So every intermediate height is hit somewhere. (Figure 2.4: a continuous curve from to , a horizontal line at height , and the crossing point where the theorem promises a solution.)
Its most useful form is root-finding. Suppose is continuous and changes sign on — say and . Then is a value between and , so the IVT guarantees a with : a root. This lets you prove a solution exists without ever solving the equation. For instance, has and — so it has a root between and , even though no formula will ever produce it.
This also pays back a debt. In Chapter 1, and again in Chapter 5, we claimed the number exists because — the slope of as it crosses the axis — slides from below (at ) to above (at ), so it “must equal somewhere in between.” That “must equal somewhere” was an Intermediate Value Theorem argument all along, taken on faith at the time. Now it is a theorem, and the loan is repaid.
The IVT doesn’t say where the root is — but it suggests how to hunt it. Check the midpoint of : the sign change must survive in one of the two halves or , so keep that half and repeat, halving the interval around the root every step. This is the bisection method — slow, but utterly reliable: it cannot fail or fly off. In Chapter 9 it becomes the safety net beneath Newton’s method, which is fast but fragile; real root-finders combine the two.
The Extreme Value Theorem: a peak that is actually reached
Extreme Value Theorem (EVT). If is continuous on a closed interval , then attains a maximum and a minimum on — there are points where it reaches its highest and lowest values.
Intuition: a continuous function on a closed interval cannot run off to infinity (that would require a jump), and it cannot merely approach its highest value without reaching it — there is no gap for the peak to slip into. So the high point and low point are genuinely attained, not just approached. (Figure 2.5: a continuous curve on with its actual maximum and minimum points marked.)
Both words in the hypothesis are load-bearing, and watching them fail is the fastest way to understand them: - Drop closed: on the open interval , has no maximum and no minimum — the values creep toward and but never reach them, because those endpoints aren’t included. - Drop continuity: on , define for and . The values climb toward but the function never takes the value (it drops to at the end), so there is no maximum — the discontinuity let the peak escape.
This is exactly the theorem Chapter 6 will open with: Rolle’s proof begins “by the Extreme Value Theorem, attains a maximum and a minimum,” and the Mean Value Theorem — the engine of the whole back half — follows from there. It is also what guarantees, in Chapter 8, that a global maximum on a closed interval exists to be found before you go looking for it.
The hidden foundation: no gaps
Why are these true? Both fail for the rational numbers and hold only for the reals — and the reason is the one you met in Chapter 1: the real number line has no gaps (completeness). On a number line full of holes, a continuous-looking function could slip between two values without ever equaling the one in the middle (no IVT), or climb toward a peak that simply isn’t there (no EVT). The no-gaps property is doing the real work — the very same property that guaranteed exists as the limit of a climbing sequence. The fully rigorous proofs belong to a more advanced course, but the engine driving them is completeness, which you already own.
◆ Layer 2 — Proving the IVT by bisection (and why completeness is the secret)
Here is the IVT’s proof for the root-finding case (), and it is the bisection algorithm made rigorous. Look at the midpoint . If we’re done. Otherwise is either positive or negative, so the sign change persists across exactly one of , — keep that half and call it . Repeat forever, producing nested intervals , each half the width of the last, each still straddling a sign change. The left endpoints climb but stay bounded above (by ), so by the Monotone Convergence principle of Chapter 1 they converge to a limit — and this is the only step that uses completeness; on the rationals the might pile up against a hole and there’d be no . The interval widths shrink to , so the right endpoints converge to the same . Since is continuous and each while each , taking limits forces and — so . The root exists, and bisection is exactly the process that finds it. (The EVT’s proof runs on the same completeness fuel but is more delicate — first showing a continuous function on is bounded, then that it attains its bound — and is the natural next step in a real analysis course.)
◆ Layer 2 — What “arbitrarily close” really means: the – definition
This is the grown-up version of Chapter 1’s – game, and it is the definition the entire subject rests on. Same two players, one change: the skeptic now challenges the output, and you answer by controlling the input.
Definition. means: for every output tolerance , there exists an input closeness such that whenever , we have .
The skeptic says “keep the output within of .” You reply “then keep the input within of , and I guarantee it.” If you can win for every the skeptic throws, the limit is .
Stare at the “” on the left. That “” says is allowed to be near but never equal to — we deliberately exclude the point itself. That single symbol is the loophole made formal: it is exactly why the function can have a hole at (as does) and still have a perfectly good limit there. The definition was built from the start to look only at the neighborhood, never the point.
And notice continuity in this language: is continuous at precisely when “input within forces output within ” — which is the robustness promise from the last section, now exact. Small input change, small output change, with the skeptic allowed to define “small.”
◆ Proof:
Let be given. We need a so that forces . Work backward from the goal: We want this below , i.e. . So choose . Then whenever , we get . Won for every .
The pattern is the same three-move dance as the sequence proofs: let be given → solve the output inequality back into an input inequality → name and verify. Linear functions give a clean ; curved ones (problem 26) take one extra step.
◆ The squeeze theorem, and the limit that becomes a slope
The squeeze theorem from Chapter 1 lifts to functions word for word:
Squeeze Theorem. If for all near , and and , then .
Its headline application is the limit this whole chapter has been pointing at. (This box uses , , , the unit circle, and angles in radians — the precalculus trigonometry you bring with you. We’ll prove the derivatives of and in Chapter 4, and this limit is exactly the tool that makes those proofs work.)
Claim: Substituting gives , so there is real work to do.
Take and compare three nested regions in the unit circle — a thin triangle inside a circular wedge inside a larger triangle. Their areas give the classic chain This is the step that requires radians: the wedge’s arc length equals only in radian measure. (In degrees, an ugly factor of appears and the limit is no longer — which is the honest reason mathematicians abandon degrees for calculus.) Divide all three by (positive), then flip the fractions: As , , so is pinned between something heading to and itself. Squeeze, and . (For nothing changes — swapping leaves both and the bounds alone.)
Why this is the most important limit in the book: notice it is a limit, and its answer, , is the slope of the sine curve as it leaves the origin. In Chapter 3 we will define “slope of a curve” as exactly this kind of limit — so you have, right now and ahead of schedule, computed that the graph of sets off at a perfect . (Figure 2.7: near , a smooth curve sailing through height with a single open hole exactly at .)