Uniform Continuity
What You’ll Learn
Section titled “What You’ll Learn”In this lesson you’ll learn the difference between continuity and uniform continuity, why the distinction is about quantifier order, the theorem that continuity on a compact set is automatically uniform, and how Lipschitz conditions fit in.
The Concept
Section titled “The Concept”The definitions side by side
Section titled “The definitions side by side”Continuity on a set :
Uniform continuity on :
The symbols are nearly identical. The order of the quantifiers is the entire difference.
In ordinary continuity, comes before , so may depend on the point. In uniform continuity, comes first, so one must serve every point at once.
Uniform continuity implies continuity. The converse is where the interest is.
Where uniformity fails
Section titled “Where uniformity fails”Take on . It is continuous at every point of its domain. But for a fixed , the required shrinks as the point approaches 0, because the graph steepens without bound. There is no smallest positive that works everywhere.
Formally: for any candidate , you can find two points closer than whose outputs differ by more than . Near 0 the function changes so fast that any fixed input window produces an arbitrarily large output change.
on fails for the same reason at the other end. Take and . Then , but
So has no workable . Unbounded slope over an unbounded domain is the obstruction, and squaring is a perfectly nice function otherwise.
The compactness theorem
Section titled “The compactness theorem”If is continuous on a compact set , then is uniformly continuous on .
For this means: continuous on a closed bounded interval implies uniformly continuous there.
Proof. Let . For each , continuity gives with whenever .
Cover by the intervals . By compactness, finitely many suffice, centred at . Set
positive because it is a minimum of finitely many positive numbers.
Now take any with . The point lies in some , and then . So both and are within of , giving
∎
The whole proof is the finiteness trick. Infinitely many have an infimum that may be 0; finitely many have a positive minimum. Compactness is what makes the collection finite. This is the argument previewed two lessons ago, now cashed in.
Lipschitz continuity
Section titled “Lipschitz continuity”is Lipschitz on with constant if
Lipschitz implies uniformly continuous: take , which depends only on .
The chain of strength:
Both implications are strict. on is uniformly continuous (continuous on a compact set) but not Lipschitz, because its slope blows up at 0. And on is continuous but not uniformly continuous.
A useful sufficient condition: if is bounded by on an interval, then is Lipschitz with constant , by the mean value theorem. That is usually the easiest way to establish uniform continuity in practice.
Why it matters
Section titled “Why it matters”Uniform continuity is exactly what you need to make an approximation valid across a whole domain rather than point by point. Two places it is indispensable:
- Riemann integrability. Proving every continuous function on is integrable requires making the oscillation on every subinterval small at once, with a single mesh size. That is uniform continuity.
- Extending functions and swapping limits. Uniform continuity lets a function defined on a dense subset extend continuously to the whole space, which is how many constructions in analysis get off the ground.
Worked Examples
Section titled “Worked Examples”Example 1: Show is uniformly continuous on .
Solution. Given , take . For any with ,
∎
depends only on . Every linear function is Lipschitz with , hence uniformly continuous on all of .
Example 2: Show is uniformly continuous on but not on .
Solution. On . since . Take . ✓ (Lipschitz with .)
On . Take , . Then but
So with , no works. Not uniformly continuous on . ∎
Note the same function is uniformly continuous on every bounded interval and fails globally. Uniform continuity is a property of the function together with its domain.
Example 3: Show is not uniformly continuous on .
Solution. Let and take any . Choose with and set
Then , while
So no works. Not uniformly continuous. ∎
The construction pattern is worth remembering: to disprove uniformity, produce two sequences with and bounded away from 0.
Example 4: is uniformly continuous but not Lipschitz on .
Solution. Uniformly continuous. Continuous on the compact , so the theorem applies. ✓
Not Lipschitz. Suppose for all . Take :
which is unbounded as . No finite exists. ∎
The middle implication is strict, and this is the standard example.
Example 5: A bounded derivative gives Lipschitz.
Show is uniformly continuous on .
Solution. , so by the mean value theorem, for any there is with
Lipschitz with , hence uniformly continuous on with . ∎
Contrast , whose derivative is unbounded on . A bounded derivative is the practical test.
Example 6: Continuous on an unbounded domain, and still uniform.
Is uniformly continuous on ?
Solution. Yes. Its derivative is , which is bounded on (it tends to 0 at both ends and is continuous, so it attains a finite maximum modulus).
Bounded derivative gives Lipschitz gives uniform continuity. ✓
So compactness is sufficient, not necessary. Plenty of functions on unbounded domains are uniformly continuous; they just have to flatten out rather than steepen.
Example 7: Quantifier order made concrete.
For on and , compare the needed at and at .
Solution. Near 0: needs , so is fine.
Near 5: , so we need .
Different points need very different . Uniform continuity does not deny that; it only requires that some single works for all, and here does. Uniformity fails only when the required has infimum 0, which cannot happen on a compact set.
Real-World Applications
Section titled “Real-World Applications”Numerical integration and step size. Choosing one step size for a whole interval assumes a uniform error bound, which requires uniform continuity of the integrand (or of a derivative). Adaptive quadrature exists precisely because the required step varies when uniformity is weak, refining where the function changes fast.
ODE solvers and existence theory. The Picard-Lindelöf theorem requires the right-hand side to be Lipschitz in the state variable. Without it, solutions can fail to be unique - with has more than one solution, and failing Lipschitz at 0 is exactly why.
Machine learning robustness. The Lipschitz constant of a network bounds how much the output can move when the input is perturbed, so it directly bounds vulnerability to adversarial examples. Spectral normalization is a technique for controlling it deliberately.
Signal sampling. Reconstructing a signal from samples with a uniform error guarantee needs uniform continuity or a bandwidth limit. A signal with unbounded rate of change cannot be reconstructed uniformly from any fixed sample rate.
Control system gain. A Lipschitz constant is a worst-case gain: the largest output change per unit input change. Stability margins are computed from exactly this quantity.
Floating-point error propagation. Whether a fixed input precision guarantees a fixed output precision across the whole input range is a uniform continuity question. Functions that steepen, like division near zero, lose precision catastrophically, which is why numerical code special-cases them.
Retrying will remove your ✅ checkmark until you pass again.