Uniform Convergence and Its Consequences

Uniform convergence is the right notion for analysis. It fixes everything pointwise convergence broke: the limit of continuous functions is continuous, the limit of integrals is the integral of the limit, and (with one extra hypothesis) the limit of derivatives is the derivative of the limit. The price for these clean theorems is a stronger hypothesis, the same $N$ must work for ALL $x$ simultaneously. Once you internalise the geometric picture (the entire graph of $f\_n$ trapped in an $\\epsilon$-tube around the graph of $f$), uniform convergence becomes intuitive, and the failure modes of pointwise convergence become easy to diagnose.

The definition

A sequence $\\{f\_n\\}$ converges uniformly to $f$ on $S$ if for every $\\epsilon>0$ there exists $N$ (depending only on $\\epsilon$, NOT on $x$) such that for all $n>N$ and ALL $x\\in S$, $|f\_n(x)-f(x)|<\\epsilon$. The single most useful equivalent formulation is the sup-norm criterion: $f\_n\\to f$ uniformly on $S$ iff $\\sup\_{x\\in S}|f\_n(x)-f(x)|\\to 0$ as $n\\to\\infty$.

What uniform convergence buys you

Three landmark theorems hold under uniform convergence: (i) if each $f\_n$ is continuous and $f\_n\\to f$ uniformly on a set, then $f$ is continuous, the $\\epsilon\\text{-}\\delta$ proof is a clean triple inequality. (ii) If each $f\_n$ is Riemann integrable on \[a,b\] and $f\_n\\to f$ uniformly, then $f$ is integrable and $\\int\_a^b f\_n\\to\\int\_a^b f$, the limit slides INSIDE the integral. (iii) If each $f\_n'$ is continuous, $f\_n'\\to g$ uniformly, and $f\_n$ converges at one point, then $f=\\lim f\_n$ is differentiable and $f'=g$.

Example contrasting pointwise vs uniform

For $f\_n(x)=x/n$ on \[0,1\]: \\sup\_{\[0,1\]}|x/n|=1/n\\to 0, so convergence is UNIFORM. For $f\_n(x)=x/n$ on $\\mathbb{R}$: $\\sup\_{\\mathbb{R}}|x/n|=+\\infty$, so convergence is NOT uniform, only pointwise. The example illustrates the dependence on the domain: uniform convergence is a global property, and changing the domain can change the verdict.

Plot $f\_n(x)=x^n$ on \[0,1\] for $n=2, 5, 10, 50$. The graphs hug the $x$-axis on most of \[0,1\] but jump steeply to 1 near $x=1$. The sup-norm $\\sup|f\_n(x)-f(x)|$ stays near $1/2$ for every $n$ (peak located at $x\_n=2^{-1/n}$), so the convergence is NOT uniform on \[0,1\]. But on \[0,1/2\]: $\\sup x^n=(1/2)^n\\to 0$, so convergence IS uniform there. The grapher visualises the gap shrinking on \[0,1/2\] and never shrinking on \[0,1\].

The Weierstrass M-test

The Weierstrass M-test is the standard tool for uniform convergence of series: if $|f\_n(x)|\\leq M\_n$ for all $x\\in S$ and $\\sum M\_n$ converges, then $\\sum f\_n$ converges uniformly (and absolutely) on $S$. Example: $\\sum\_n \\sin(nx)/n^2$ on $\\mathbb{R}$ has $|\\sin(nx)/n^2|\\leq 1/n^2$ and $\\sum 1/n^2=\\pi^2/6$ converges, so the series converges uniformly, immediately implying the sum is a continuous function of $x$.

• Series approximation & Taylor / Fourier series: a Taylor series converges uniformly on compact sets inside its radius of convergence, that is why you can differentiate or integrate it term-by-term. The same idea makes Fourier series usable for solving PDEs (heat equation, wave equation) by separation of variables.
• Numerical computation & error guarantees: when a numerical method approximates a function uniformly, you can quote a SINGLE error bound valid everywhere in the domain. Pointwise convergence would force you to quote a different error at every input, useless for guarantees.
• Stone-Weierstrass theorem & modern analysis: the Stone-Weierstrass theorem says every continuous function on a compact set can be uniformly approximated by polynomials. This underlies neural-network universal-approximation theorems, polynomial regression error bounds, and the theory of orthogonal polynomials (Legendre, Chebyshev, Hermite).

Pause and think: Why does uniform convergence preserve continuity but pointwise convergence does not? Sketch a triple-inequality argument: $|f(x)-f(x\_0)|\\leq|f(x)-f\_N(x)|+|f\_N(x)-f\_N(x\_0)|+|f\_N(x\_0)-f(x\_0)|$. Which term needs uniformity?

Try it

• Predict first: does $f\_n(x)=x^2/n$ converge uniformly on \[0,5\]? On $\\mathbb{R}$? Compute \\sup\_{\[0,5\]}|x^2/n| and $\\sup\_{\\mathbb{R}}|x^2/n|$ to decide.
• Show by the M-test that \\sum\_{n=1}^\\infty \\cos(nx)/n^3 converges uniformly on $\\mathbb{R}$. Conclude that the sum is a continuous function.
• Construct a sequence $f\_n\\to f$ uniformly with each $f\_n'$ existing but $f\_n'$ NOT converging to $f'$ uniformly (uniform convergence does NOT in general imply uniform convergence of derivatives). Hint: try $f\_n(x)=\\sin(nx)/\\sqrt{n}$.
• True or false: if $f\_n\\to f$ uniformly on \[a,b\] and each $f\_n$ is Riemann integrable, then $\\int\_a^b f\_n\\to\\int\_a^b f$. Justify briefly using the $\\epsilon(b-a)$ bound.

The series-summer above is ideal for visualising the M-test: pick a series like $\\sum \\sin(nx)/n^2$ and watch partial sums $s\_N(x)$ get within $\\sum\_{n>N}1/n^2$ of the full sum uniformly in $x$. The tail bound is what the M-test exploits.

A trap to watch for

Uniform convergence does NOT automatically give uniform convergence of derivatives. The example $f\_n(x)=\\sin(nx)/\\sqrt n$ shows $f\_n\\to 0$ uniformly (since $|f\_n|\\leq 1/\\sqrt n$), but $f\_n'(x)=\\sqrt n\\cos(nx)$ has $|f\_n'(0)|=\\sqrt n\\to\\infty$. To swap $\\lim$ and $d/dx$ you need the SEPARATE hypothesis that $f\_n'$ converges uniformly (and $f\_n$ converges at one point).

What you now know

You can apply the sup-norm criterion, distinguish uniform from pointwise convergence by example, use the Weierstrass M-test, and quote the three landmark uniform-convergence theorems (continuity, integration, differentiation). This concludes Garrity ch. 2 on real analysis, the next chapter generalises everything to several variables, where pointwise vs uniform vs L^p convergence becomes even richer.

Mark section complete →

References

• Garrity, T. (2002). All the Mathematics You Missed. Cambridge University Press, ch. 2.
• Rudin, W. (1976). Principles of Mathematical Analysis (3rd ed.). McGraw-Hill, ch. 7.
• Abbott, S. (2015). Understanding Analysis (2nd ed.). Springer, ch. 6.
• Apostol, T. M. (1974). Mathematical Analysis (2nd ed.). Addison-Wesley, ch. 9.
• Bartle, R. G., Sherbert, D. R. (2011). Introduction to Real Analysis (4th ed.). Wiley, ch. 8.