Uniform vs Pointwise Convergence: A Case Study

April 9, 2026 · Luciano Muratore

It is well-known that a sequence of functions can converge to a limit in more than one sense. The question is: how strong is that convergence?

This is not a trivial distinction. Pointwise convergence asks whether, for each fixed point, the sequence eventually gets close to the limit. Uniform convergence asks for something stronger: can we find a single threshold that works simultaneously for all points?

To make this concrete, let us work through a specific example.

The Sequence

For each nNn \in \mathbb{N}, define fn:[0,1]Rf_n : [0, 1] \to \mathbb{R} by

fn(x)={1,x[1n,2n],0,otherwise.f_n(x) = \begin{cases} 1, & x \in \left[\frac{1}{n}, \frac{2}{n}\right], \\ 0, & \text{otherwise.} \end{cases}

Each fnf_n is bounded and its support is precisely the interval [1n,2n]\left[\frac{1}{n}, \frac{2}{n}\right], a window that slides toward 00 as nn \to \infty.

Pointwise Convergence

Recall the definition: a sequence (fn)(f_n) converges pointwise to ff on AA if

xA:limnfn(x)=f(x).\forall x \in A : \lim_{n \to \infty} f_n(x) = f(x).

The limit is taken with respect to nn for each fixed xx — the point is frozen, and we ask whether the sequence eventually settles there.

For our sequence, fix x[0,1]x \in [0,1].

If x=0x = 0, then x[1n,2n]x \notin \left[\frac{1}{n}, \frac{2}{n}\right] for any nn, so fn(0)=0f_n(0) = 0 for all nn.

If x>0x > 0, choose NNN \in \mathbb{N} such that N>2xN > \frac{2}{x}. Then for all nNn \geq N,

2n<x    x[1n,2n]    fn(x)=0.\frac{2}{n} < x \implies x \notin \left[\frac{1}{n}, \frac{2}{n}\right] \implies f_n(x) = 0.

So limnfn(x)=0\lim_{n \to \infty} f_n(x) = 0 for every x[0,1]x \in [0, 1], and we conclude fnpointwise0f_n \xrightarrow{\text{pointwise}} 0 on [0,1][0,1].

Failure of Uniform Convergence

Uniform convergence imposes a global bound: (fn)(f_n) converges uniformly to ff on AA if

ε>0, NN:nN, xA, fn(x)f(x)<ε,\forall \varepsilon > 0,\ \exists N \in \mathbb{N} : \forall n \geq N,\ \forall x \in A,\ |f_n(x) - f(x)| < \varepsilon,

or equivalently, supxAfn(x)f(x)0\sup_{x \in A} |f_n(x) - f(x)| \to 0.

With f0f \equiv 0, let us compute this supremum. Since fn(x)=1f_n(x) = 1 for every x[1n,2n]x \in \left[\frac{1}{n}, \frac{2}{n}\right], we have

supx[0,1]fn(x)0=1n.\sup_{x \in [0,1]} |f_n(x) - 0| = 1 \quad \forall n.

This supremum never goes to 00, so fnuniformly0f_n \xrightarrow{\text{uniformly}} \hspace{-2.6em}\setminus\hspace{1.6em} 0 on [0,1][0, 1].

Why Compactness Restores Uniform Convergence

The failure above traces back to a single culprit: the point 00. The supports [1n,2n]\left[\frac{1}{n}, \frac{2}{n}\right] accumulate at 00 as nn \to \infty, so no single NN can push the bump away from points near 00.

Now, what if we restrict to a compact subset K(0,1]K \subset (0, 1]? Since KK is closed and bounded and 0K0 \notin K, there exists a>0a > 0 such that K[a,1]K \subset [a, 1]. In other words, KK stays bounded away from the problematic accumulation point:

dist(K,0)=infxKx=a>0.\text{dist}(K, 0) = \inf_{x \in K} x = a > 0.

This is the key. Since supp(fn)=[1n,2n]\text{supp}(f_n) = \left[\frac{1}{n}, \frac{2}{n}\right], choose N>2aN > \frac{2}{a}. Then for all nNn \geq N,

supp(fn)K=    fn(x)=0xK.\text{supp}(f_n) \cap K = \emptyset \implies f_n(x) = 0 \quad \forall x \in K.

Therefore supxKfn(x)0=0\sup_{x \in K} |f_n(x) - 0| = 0, and fnuniformly0f_n \xrightarrow{\text{uniformly}} 0 on KK.

I want to make a pause here. The compactness of KK is not the direct reason for uniform convergence — it is the positive distance from 00 that does the work. Compactness in (0,1](0,1] guarantees that such a distance exists. If we had taken a non-compact set like (0,1](0, 1] itself, the infimum of xx over the set would be 00, and the argument would collapse.

The moral: uniform convergence is a global property, and it can fail precisely where the limit function is approached in a non-uniform manner. Compactness, when it excludes accumulation points of the supports, is the geometric condition that restores uniformity.