Unit 7, lesson 104

Pointwise and Uniform Convergence

The difference between functions converging at each point and converging with one error bound everywhere, the M-test for series, and when limits pass through integrals and derivatives.

  • Theory part 207
  • Practice part 208
  • Power Series

Picture the graphs of xx, x2x^2, x3x^3, x4x^4 on [0,1][0, 1]. Each one sags lower than the last, yet every graph still reaches up to height 11 at the right end. At each single point the heights settle down, but the graphs as a whole never get uniformly close to their limit. That gap between “at each point” and “everywhere at once” decides whether limits of functions keep continuity and whether you may swap a limit with an integral.

Key terms

Sequences and series of functions

Definition A sequence of functions on a set D⊆RD \subseteq \mathbb{R} is a list f1,f2,f3,…f_1, f_2, f_3, \ldots where each fnf_n is a real function defined on DD. A series of functions ∑n=1∞fn\sum_{n=1}^{\infty} f_n on DD is the sequence of its partial sums

SN(x)=∑n=1Nfn(x),x∈D.S_N(x) = \sum_{n=1}^{N} f_n(x), \qquad x \in D.

Every convergence question about a series of functions is a question about the sequence (SN)(S_N).

In plain words Instead of a list of numbers you have a list of graphs. Fixing xx turns it back into an ordinary sequence of numbers.

Example On D=[0,1]D = [0, 1] let fn(x)=xnf_n(x) = x^n. At x=12x = \frac{1}{2} the values are 12,14,18,…\frac{1}{2}, \frac{1}{4}, \frac{1}{8}, \ldots, and at x=1x = 1 they are 1,1,1,…1, 1, 1, \ldots. A power series ∑cnxn\sum c_n x^n is a series of functions with fn(x)=cnxnf_n(x) = c_n x^n.

Pointwise convergence

Definition The sequence (fn)(f_n) converges pointwise on DD to a function ff if lim⁡n→∞fn(x)=f(x)\lim_{n \to \infty} f_n(x) = f(x) for every x∈Dx \in D. In detail, for every x∈Dx \in D and every ε>0\varepsilon > 0 there is an NN, which may depend on both ε\varepsilon and xx, such that

n≥N  ⟹  ∣fn(x)−f(x)∣<ε.n \ge N \implies \lvert f_n(x) - f(x) \rvert < \varepsilon.

A series ∑fn\sum f_n converges pointwise on DD when its partial sums do.

In plain words Check each point on its own. At every xx the numbers fn(x)f_n(x) must settle down, but different points may settle at very different speeds.

Example For fn(x)=xnf_n(x) = x^n on [0,1][0, 1] the pointwise limit is

f(x)={0,0≤x<1,1,x=1.f(x) = \begin{cases} 0, & 0 \le x < 1, \\ 1, & x = 1. \end{cases}

Every fnf_n is continuous, yet the limit ff jumps at x=1x = 1. Pointwise limits can lose continuity.

Uniform convergence

Definition The sequence (fn)(f_n) converges uniformly on DD to ff if for every ε>0\varepsilon > 0 there is an NN, depending only on ε\varepsilon, such that

n≥N  ⟹  ∣fn(x)−f(x)∣<εfor every x∈D.n \ge N \implies \lvert f_n(x) - f(x) \rvert < \varepsilon \quad \text{for every } x \in D.

Uniform convergence implies pointwise convergence, but not conversely. If every fnf_n is continuous on DD and fn→ff_n \to f uniformly on DD, then ff is continuous on DD.

In plain words One NN has to work for every point at once. Past that NN, the whole graph of fnf_n stays inside a band of width ε\varepsilon around the graph of ff.

Example The functions xnx^n do not converge uniformly on [0,1][0, 1], since their continuous graphs would then have a continuous limit. On the smaller interval [0,12][0, \frac{1}{2}] they do converge uniformly to 00, because ∣xn−0∣≤(12)n\lvert x^n - 0 \rvert \le \left(\frac{1}{2}\right)^n there, and this bound is below any ε>0\varepsilon > 0 once nn is large.

Uniform error bounds

Definition For functions on DD put

dn=sup⁡x∈D∣fn(x)−f(x)∣.d_n = \sup_{x \in D} \lvert f_n(x) - f(x) \rvert.

Then fn→ff_n \to f uniformly on DD if and only if dn→0d_n \to 0. In particular, if there are numbers en→0e_n \to 0 with ∣fn(x)−f(x)∣≤en\lvert f_n(x) - f(x) \rvert \le e_n for all x∈Dx \in D and all nn, the convergence is uniform.

In plain words Find the worst error over the whole set for each nn. Uniform convergence means that worst error goes to 00.

Example On [0,1)[0, 1) the worst error of xnx^n against the limit 00 is sup⁡0≤x<1xn=1\sup_{0 \le x < 1} x^n = 1 for every nn, so the convergence is not uniform there either. By contrast fn(x)=sin⁡(nx)nf_n(x) = \frac{\sin(nx)}{n} satisfies

∣fn(x)−0∣≤1nfor every real x,\lvert f_n(x) - 0 \rvert \le \frac{1}{n} \quad \text{for every real } x,

so fn→0f_n \to 0 uniformly on R\mathbb{R}.

Weierstrass M-test

Definition Let fnf_n be functions on DD. Suppose there are constants Mn≥0M_n \ge 0 with

∣fn(x)∣≤Mnfor all x∈D and all n,∑n=1∞Mn<∞.\lvert f_n(x) \rvert \le M_n \quad \text{for all } x \in D \text{ and all } n, \qquad \sum_{n=1}^{\infty} M_n < \infty.

Then ∑fn(x)\sum f_n(x) converges absolutely for every x∈Dx \in D, and the series ∑fn\sum f_n converges uniformly on DD.

In plain words If each term is trapped under a number that does not depend on xx, and those numbers form a convergent series, the series of functions converges uniformly.

Example Consider the series

∑n=1∞sin⁡(nx)n2\sum_{n=1}^{\infty} \frac{\sin(nx)}{n^2}

on R\mathbb{R} and take Mn=1n2M_n = \frac{1}{n^2}. Since ∑1n2\sum \frac{1}{n^2} converges, the series converges uniformly on all of R\mathbb{R}. Its terms are continuous, so its sum is a continuous function.

Exchanging limits and integrals

Definition Let each fnf_n be continuous on [a,b][a, b] and let fn→ff_n \to f uniformly on [a,b][a, b]. Then ff is continuous on [a,b][a, b] and

lim⁡n→∞∫abfn(x) dx=∫abf(x) dx.\lim_{n \to \infty} \int_a^b f_n(x) \, dx = \int_a^b f(x) \, dx.

For series, if each fnf_n is continuous on [a,b][a, b] and ∑fn\sum f_n converges uniformly on [a,b][a, b], then

∫ab∑n=1∞fn(x) dx=∑n=1∞∫abfn(x) dx.\int_a^b \sum_{n=1}^{\infty} f_n(x) \, dx = \sum_{n=1}^{\infty} \int_a^b f_n(x) \, dx.

Pointwise convergence alone is not enough.

In plain words With uniform convergence the area under fnf_n approaches the area under ff. Without it, area can hide in a thin spike that slides away.

Example On [0,1][0, 1] let fn(x)=nxe−nx2f_n(x) = n x e^{-n x^2}. For each fixed x>0x > 0 the exponential wins and fn(x)→0f_n(x) \to 0, and fn(0)=0f_n(0) = 0, so the pointwise limit is f=0f = 0. But

∫01nxe−nx2 dx=1−e−n2→12≠0=∫01f(x) dx.\int_0^1 n x e^{-n x^2} \, dx = \frac{1 - e^{-n}}{2} \to \frac{1}{2} \neq 0 = \int_0^1 f(x) \, dx.

The convergence is not uniform, since fn(1n)=n e−1f_n\left(\frac{1}{\sqrt{n}}\right) = \sqrt{n} \, e^{-1} grows without bound.

Derivatives need more hypotheses

Definition Uniform convergence of fnf_n does not imply convergence of fn′f_n'. The standard result is this. Let each fnf_n be continuously differentiable on [a,b][a, b], let (fn(x0))(f_n(x_0)) converge for at least one x0∈[a,b]x_0 \in [a, b], and let (fn′)(f_n') converge uniformly on [a,b][a, b]. Then (fn)(f_n) converges uniformly on [a,b][a, b] to a differentiable function ff, and

f′(x)=lim⁡n→∞fn′(x)for all x∈[a,b].f'(x) = \lim_{n \to \infty} f_n'(x) \quad \text{for all } x \in [a, b].

For series the condition is that the series of derivatives ∑fn′\sum f_n' converges uniformly.

In plain words A graph can be uniformly close to a flat line while wiggling steeply. To differentiate the limit you need control of the derivatives themselves.

Example The functions fn(x)=sin⁡(nx)nf_n(x) = \frac{\sin(nx)}{n} converge uniformly to 00 on R\mathbb{R}. Their derivatives fn′(x)=cos⁡(nx)f_n'(x) = \cos(nx) give fn′(0)=1f_n'(0) = 1 for every nn, not 00, and at x=πx = \pi they give (−1)n(-1)^n, which does not converge at all.

Check yourself

  1. Show that fn(x)=x1+nxf_n(x) = \frac{x}{1 + nx} converges uniformly to 00 on [0,∞)[0, \infty).
Show the answer

For x>0x > 0 we have

x1+nx<xnx=1n,\frac{x}{1 + nx} < \frac{x}{nx} = \frac{1}{n},

and fn(0)=0f_n(0) = 0. So ∣fn(x)∣≤1n\lvert f_n(x) \rvert \le \frac{1}{n} for all x≥0x \ge 0, a bound that goes to 00 and does not depend on xx.

  1. Does ∑n=1∞xnn2\sum_{n=1}^{\infty} \frac{x^n}{n^2} converge uniformly on [−1,1][-1, 1]?
Show the answer

Yes. For ∣x∣≤1\lvert x \rvert \le 1 we have

∣xnn2∣≤1n2,\left\lvert \frac{x^n}{n^2} \right\rvert \le \frac{1}{n^2},

and ∑1n2\sum \frac{1}{n^2} converges, so the M-test applies.

  1. Let fn(x)=xnnf_n(x) = \frac{x^n}{n} on [0,1][0, 1]. Does fnf_n converge uniformly? Do the derivatives converge uniformly?
Show the answer

Yes for the functions. On [0,1][0, 1] we have ∣fn(x)∣≤1n\lvert f_n(x) \rvert \le \frac{1}{n}, so fn→0f_n \to 0 uniformly. No for the derivatives. They are fn′(x)=xn−1f_n'(x) = x^{n-1}, which converge pointwise to a limit that is 00 for x<1x < 1 and 11 at x=1x = 1. That limit is discontinuous while each fn′f_n' is continuous, so the convergence is not uniform. Indeed lim⁡fn′(1)=1\lim f_n'(1) = 1, while the limit function 00 has derivative 00 at x=1x = 1.

How this lesson connects

It also uses function sequences.