Exercise 6.3.7

Use the Mean Value Theorem to supply a proof for Theorem 6.3.2. To get started, observe that the triangle inequality implies that, for any x [ a , b ] and m , n N ,

| f n ( x ) f m ( x ) | | ( f n ( x ) f m ( x ) ) ( f n ( x 0 ) f m ( x 0 ) ) | + | f n ( x 0 ) f m ( x 0 ) | .

Answers

Take any 𝜖 > 0 ; we want to show that there is some N so that for n , m > N , | f n ( x ) f m ( x ) | < 𝜖 (to use the Cauchy Criterion for Uniform Convergence).

Let h n , m ( x ) = f n ( x ) f m ( x ) , and note that h n , m converges uniformly to 0 as n , m go to infinity (as a consequence of ( f n ) converging uniformly). More formally, for any 𝜖 1 > 0 we have some N 1 for which if n , m > N 1 then | h n , m ( x ) | < 𝜖 1 x [ a , b ] .

By the Mean Value Theorem,

h n , m ( x ) h n , m ( x 0 ) x x 0 = h n , m ( x 1 )

for some x 1 [ a , b ] , and therefore if n , m > N 1 we have

| ( f n ( x ) f m ( x ) ) ( f n ( x 0 ) f m ( x 0 ) ) | = | x x 0 | | h n , m ( x 1 ) | ( b a ) 𝜖 1

This addresses the first term in the question hint.

Second, since ( f n ( x 0 ) ) converges as n and is thus a Cauchy sequence, we have that for any 𝜖 2 there is an N 2 so that when n , m > N 2 , | f n ( x 0 ) f m ( x 0 ) | < 𝜖 2 . This addresses the second term.

Setting 𝜖 1 = 𝜖 2 ( b a ) , 𝜖 2 = 𝜖 2 , and N = max { N 1 , N 2 } completes the proof.

User profile picture
2022-01-27 00:00
Comments