Uniform convergence of sequence of functions

Consider a sequence of functions {fn(x)} on interval I:

f1(x),f2(x),f3(x),.

This is an indexed collection of functions on I. We can consider different types of convergence of such a sequence of functions: fn(x)f(x). If the convergence is ``uniform,'' then some properties of the functions fn(x), such as continuity, integrability, and differentiability, are inherited to the limiting function f(x).




Given a sequence of functions {fn(x)} on I, we can define a sequence of real numbers {fn(a)} for each aI. If the sequence {fn(a)} converges for each aI, we can define its limit as f(a) thereby defining a function f(x) on I. In this case, we say the sequence of functions {fn(x)} converges to the function f(x) and write

limnfn(x)=f(x).

We refer to this type of convergence as point-wise convergence

Remark. In a logical form, the point-wise convergence is denoted as

aI ε>0 NN nN (nN|f(a)fn(a)|<ε).

Note in particular that the value of N may depend on a in this expression. □

On the contrary, we say the sequence of functions {fn(x)} uniformly converges to the function f(x) if the following holds:

ε>0 NN aI nN (nN|f(a)fn(a)|<ε).

Note the difference of the position of the quantifier aI. In this expression, the value of N does not depend on a (but does depend on ε)  That's why this is called "uniform" convergence. This corresponds to the condition (*) in the proof of the Theorem (Continuous power series).

See also: Calculus of power series

Thus, we have the following theorem.

Theorem (Uniform convergence and continuity)

Suppose that the sequence {fn(x)} of functions on interval I uniformly converges to the function f(x) on I. If each fn(x) is continuous on I, then so is f(x).

Proof. Exercise. (See Step 2 of the proof of the Theorem (Continuous power series) in Calculus of power series.) ■

Example. For each nN, let us define the function fn(x) on R as follows:

fn(x)={0(x0),nx(0<x<1n),1(x1n).

The sequence of function {fn(x)} converges to the following function f(x):

f(x)={0(x0),1(x>0).

For each n, fn(x) is a continuous function. However, f(x) is not continuous. In fact, limnfn(x)=f(x) is point-wise convergence, not uniform convergence. □

Exercise. (Try to) show directly that the sequence {fn(x)} in the above example does not converge uniformly to f(x). □

Theorem (Uniform convergence and definite integral)

Suppose that the sequence {fn(x)} of functions on a bounded interval I uniformly converges to the function f(x) on I. For each aI, let Fn(x)=axfn(t)dt and F(x)=axf(t)dt. Then the sequence of functions {Fn(x)} uniformly converges to F(x) on I.

Proof. Suppose I[α,β]. For any ε>0, we can find a natural number N such that, for all nN and for any xI, |f(x)fn(x)|<εβα (uniform convergence). Then, for any xI, we have

|F(x)Fn(x)|ax|f(t)fn(t)|dt<ε|xa|βαε.

This means that {Fn(x)} uniformly converges to F(x) on I. ■

Theorem (Uniform convergence and derivative)

Let {fn(x)} be a sequence of C1 functions that converges to f(x) on I (point-wise). Suppose that the sequence of derivatives {fn(x)} uniformly converges to the function g(x) on I. Then, f(x) is also of class C1 and f(x)=g(x).

Proof. On the one hand, by the above Theorem (Uniform convergence and definite integral), axfn(t)dt uniformly converges to axg(t)dt on I where aI is arbitrary. On the other hand,

axfn(t)dt=fn(x)fn(a)f(x)f(a)

as n. Thus, the convergence of {fn(x)} to f(x) is uniform and

f(x)f(a)=axg(t)dt.

By differentiating both sides with respect to x, we have f(x)=g(x). ■


Comments

Popular posts from this blog

Birth process

Branching processes: Mean and variance

Informal introduction to formal logic