Uniform Convergence — Mathematics Knowledge System

Overview

A sequence of functions (fₙ) converges uniformly to f on a set D if the maximum gap between fₙ and f over the entire set D shrinks to zero — a single N controls the approximation everywhere in D simultaneously, unlike pointwise convergence where N may depend on the point. Uniform convergence is the stronger, more useful notion: it is exactly the condition needed to guarantee that limits of continuous functions are continuous, that limits and integrals can be interchanged, and (under mild extra hypotheses) that limits and derivatives can be interchanged. The standard tool for proving uniform convergence of series of functions is the Weierstrass M-test.

Intuition

Picture the graphs of fₙ as a band of width ε drawn around the limit function f. Uniform convergence means that eventually (past some N) the entire graph of fₙ, over the whole domain D at once, fits inside that band — not just at isolated points, but everywhere simultaneously. Pointwise convergence only guarantees that at each individual x, the values fₙ(x) eventually settle near f(x), but the 'eventually' (the required N) can get worse and worse as x varies, so the graphs can still wiggle wildly outside any fixed band. Uniform convergence forbids that: the whole graph gets trapped in the shrinking band together.

Formal Definition

Definition

A sequence of functions fₙ: D → ℝ converges uniformly to f: D → ℝ if:

\forall \varepsilon > 0,\ \exists N \in \mathbb{N} \text{ such that } \forall n \ge N,\ \forall x \in D,\ |f_n(x) - f(x)| < \varepsilon

N depends only on ε, not on x — contrast with pointwise convergence where N may depend on x

Definition of uniform convergence

\sup_{x \in D} |f_n(x) - f(x)| \to 0 \text{ as } n \to \infty

Equivalent supremum-norm formulation

|f_n(x)| \le M_n \ \forall x \in D,\ \sum_{n=1}^{\infty} M_n < \infty \implies \sum_{n=1}^{\infty} f_n \text{ converges uniformly on } D

Weierstrass M-test

Worked Examples

Compute the supremum of |fₙ(x) - 0| over x ∈ [0,1]; it is attained at x=1.
$\sup_{x\in[0,1]} \left|\frac{x}{n}\right| = \frac{1}{n}$
This supremum, 1/n, tends to 0 independent of x, which is exactly the uniform convergence criterion.
$\frac{1}{n} \to 0$

Answer: fₙ → 0 uniformly on [0,1], since sup|fₙ(x)-0| = 1/n → 0.

Practice Problems

Difficulty 5/10

Use the Weierstrass M-test to show ∑ sin(nx)/n² converges uniformly on ℝ.

Difficulty 4/10

If fₙ → f uniformly on [a,b] and each fₙ is continuous, what can be concluded about f?

f must be differentiablef is continuousf is a polynomialNothing can be concluded

Difficulty 7/10

Prove that if fₙ → f uniformly on [a,b] and each fₙ is continuous, then f is continuous.

Quiz

The key difference between pointwise and uniform convergence of (fₙ) to f is:

Uniform convergence requires each fₙ to be continuousIn uniform convergence, N depends only on ε, not on xThey are the same notionUniform convergence only applies to power series

The Weierstrass M-test proves uniform convergence of ∑fₙ by:

Showing each fₙ is bounded by a constant Mₙ with ∑Mₙ convergentShowing fₙ is monotoneShowing fₙ(x) → 0 for each fixed xRequiring the domain to be compact

Summary

fₙ → f uniformly on D if ∀ε>0 ∃N such that ∀n≥N and ∀x∈D, |fₙ(x)-f(x)|<ε — N depends only on ε.
Uniform convergence (unlike pointwise) preserves continuity: a uniform limit of continuous functions is continuous.
The Weierstrass M-test — bounding |fₙ(x)|≤Mₙ with ∑Mₙ convergent — is the standard tool for proving uniform convergence of function series.

References

WebsiteWikipedia — Uniform convergence