🧮 Brain Teaser

The Equicontinuous Sequence That Must Converge

Let {fn}\{f_n\} be a sequence of functions on [0,1][0,1] that is equicontinuous and pointwise bounded (i.e., sup⁡n∣fn(x)∣<∞\sup_n |f_n(x)| < \infty for each x∈[0,1]x \in [0,1]).

Suppose that fn(x)→f(x)f_n(x) \to f(x) for every xx in a dense subset D⊆[0,1]D \subseteq [0,1].

Prove that fn→ff_n \to f uniformly on [0,1][0,1].

equicontinuityuniform convergenceArzela-Ascolicompactnessdense subset

Answer: The Equicontinuous Sequence That Must Converge

Key Idea / Intuition

Equicontinuity is the key: it lets us "spread" convergence from a dense set to the whole interval without losing control. Since [0,1][0,1] is compact and the family is equicontinuous, a dense set of convergence points is actually enough — every other point is sandwiched between nearby dense points where we already know convergence holds, and the equicontinuity gap is small.


Formal Proof / Solution

Step 1: ff is well-defined and fn→ff_n \to f pointwise on all of [0,1][0,1].

Fix any x∈[0,1]x \in [0,1]. Given ε>0\varepsilon > 0, by equicontinuity, there exists δ>0\delta > 0 such that for all nn and all yy with ∣x−y∣<δ|x - y| < \delta: ∣fn(x)−fn(y)∣<ε.|f_n(x) - f_n(y)| < \varepsilon.

Since DD is dense, pick d∈Dd \in D with ∣x−d∣<δ|x - d| < \delta. Then: ∣fn(x)−fm(x)∣≤∣fn(x)−fn(d)∣+∣fn(d)−fm(d)∣+∣fm(d)−fm(x)∣<2ε+∣fn(d)−fm(d)∣.|f_n(x) - f_m(x)| \leq |f_n(x) - f_n(d)| + |f_n(d) - f_m(d)| + |f_m(d) - f_m(x)| < 2\varepsilon + |f_n(d) - f_m(d)|.

Since fn(d)→f(d)f_n(d) \to f(d), the sequence (fn(d))(f_n(d)) is Cauchy, so for large n,mn, m: ∣fn(x)−fm(x)∣<3ε.|f_n(x) - f_m(x)| < 3\varepsilon.

Hence (fn(x))(f_n(x)) is Cauchy, so fn(x)→f(x)f_n(x) \to f(x) for every x∈[0,1]x \in [0,1], and ff is well-defined.

Step 2: Uniform convergence.

Let ε>0\varepsilon > 0. By equicontinuity, there exists δ>0\delta > 0 such that for all nn and all x,y∈[0,1]x, y \in [0,1] with ∣x−y∣<δ|x - y| < \delta: ∣fn(x)−fn(y)∣<ε.|f_n(x) - f_n(y)| < \varepsilon.

Taking n→∞n \to \infty, by pointwise convergence we also get: ∣f(x)−f(y)∣≤εfor ∣x−y∣<δ.|f(x) - f(y)| \leq \varepsilon \quad \text{for } |x-y| < \delta.

Now cover [0,1][0,1] by finitely many balls B(xk,δ)B(x_k, \delta), k=1,…,Kk = 1, \ldots, K (by compactness). For each center xkx_k, since fn(xk)→f(xk)f_n(x_k) \to f(x_k), there exists NkN_k such that for n≥Nkn \geq N_k: ∣fn(xk)−f(xk)∣<ε.|f_n(x_k) - f(x_k)| < \varepsilon.

Let N=max⁡kNkN = \max_k N_k. For any x∈[0,1]x \in [0,1], pick xkx_k with ∣x−xk∣<δ|x - x_k| < \delta. Then for n≥Nn \geq N: ∣fn(x)−f(x)∣≤∣fn(x)−fn(xk)∣+∣fn(xk)−f(xk)∣+∣f(xk)−f(x)∣<ε+ε+ε=3ε.|f_n(x) - f(x)| \leq |f_n(x) - f_n(x_k)| + |f_n(x_k) - f(x_k)| + |f(x_k) - f(x)| < \varepsilon + \varepsilon + \varepsilon = 3\varepsilon.

Since ε>0\varepsilon > 0 and NN are independent of xx, we conclude fn→ff_n \to f uniformly on [0,1][0,1]. ■\blacksquare

Remark: This is essentially the proof of the Arzelà–Ascoli theorem from the inside out — the theorem guarantees subsequential limits; this problem shows that once pointwise limits on a dense set exist, the whole sequence converges uniformly.

Source: Rudin, Principles of Mathematical Analysis, Ch. 7; classical real analysis folklore

Type: analysisSource: Rudin, Principles of Mathematical Analysis, Ch. 7; classical real analysis folkloreEdit on GitHub ↗