Exercise 7.17

Exercise 17: Define the notions of uniform convergence and equicontinuity for mappings into any metric space. Show that Theorems 7.9 and 7.12 are valid for mappings into any metric space, that Theorems 7.8 and 7.11 are valid for mappings into any complete metric space, and that Theorems 7.10, 7.16, 7.17, 7.24, and 7.25 hold for vector-valued functions, that is, for mappings into any R k .

Answers

The extensions of the definitions, and the statements and proofs of Theorems 7.8 through 7.11, are trivial, so I will simply copy them from the text, italicizing the changes.

Definition 7.7 We say that a sequence of mappings { f n } , n = 1 , 2 , 3 , , into a metric space F converges uniformly on E to a function f if for every 𝜀 > 0 there is an integer N such that n N implies

( 13 ) d ( f n ( x ) , f ( x ) ) 𝜀

for all x E .

Definition 7.22 A family F of mappings f defined on a set E in a metric space X with values in a metric space Y is said to be equicontinuous on E if for every 𝜀 > 0 there exists a δ > 0 such that

d Y ( f ( x ) , f ( y ) ) < 𝜀

whenever d X ( x , y ) δ , x E , y E , and f F .

Theorem 7.8 The sequence of mappings { f n } into a complete metric space F , defined on E , converges uniformly on E if and only if for every 𝜀 > 0 there exists an integer N such that m N , n N , x E implies d ( f n ( x ) , f m ( x ) ) 𝜀 .

Proof: Suppose { f n } converges uniformly on E , and let f be the limit function. There there is an integer N such that n E implies d ( f n ( x ) , f ( x ) ) 𝜀 2 so that

d ( f n ( x ) , f m ( x ) ) d ( f n ( x ) , f ( x ) ) + d ( f ( x ) , f m ( x ) ) 𝜀

if n N , m M , x E .

Conversely, suppose the Cauchy condition holds. Since F is a complete metric space, the sequence { f n ( x ) } converges, for every x , to a limit which we may call f ( x ) . Thus the sequence { f n } converges on E , to f . We have to prove that the convergence is uniform.

Let 𝜀 > 0 be given, and choose N such that (13) holds. Fix n , and let m in (13). Since f m ( x ) f ( x ) as m , this gives d ( f n ( x ) , f ( x ) ) 𝜀 for every n N and every x E , which completes the proof.

Theorem 7.9 Suppose { f n } is a sequence of mappings from E into a metric space F such that lim f n ( x ) = f ( x ) for x E . Put

M n = sup x E d ( f n ( x ) , f ( x ) ) .

Then f n f uniformly on E if and only if M n 0 as n .

Proof: Since this is an immediate consequence of Definition 7.7, we omit the details of the proof.

Theorem 7.10 Suppose { f n } is a sequence of vector-valued functions with values in R k defined on E , and suppose

| | f n ( x ) | | M n ( x E , n = 1 , 2 , 3 , ) .

Then f n converges uniformly on E if M n converges.

Proof: If M n converges, then, for arbitrary 𝜀 > 0 ,

| | i = n m f i ( x ) | | i = n m M i 𝜀 ( x E ) ,

provided m and n are large enough. Uniform convergence now follows from Theorem 7.8.

Theorem 7.11 Suppose { f n } , a sequence of mappings with values in a complete metric space F , converges uniformly on a set E in a metric space. Let x be a limit point of E , and suppose that

lim t x f n ( t ) = A n ( n = 1 , 2 , 3 , ) .

Then { A n } converges and

( 16 ) lim t x f ( t ) = lim n A n .

Proof: Let 𝜀 > 0 be given. By the uniform convergence of { f n } , there exists N such that n N , m N , t E imply

( 18 ) d ( f n ( t ) , f m ( t ) ) 𝜀 .

Letting t x in (18), we obtain

d ( A n , A m ) 𝜀

for n N , m M , so that { A n } is a Cauchy sequence and therefore converges, say to A .

Next,

( 19 ) d ( f ( t ) , A ) d ( f ( t ) , f n ( t ) ) + d ( f n ( t ) , A n ) + d ( A n , A ) .

We first choose n such that

( 20 ) d ( f ( t ) , f n ( t ) ) 𝜀 3

for all t E (this is possible by the uniform convergence), and such that

( 21 ) d ( A n , A ) 𝜀 3 .

Then, for this n we choose a neighborhood V of x such that

( 22 ) d ( f n ( t ) A n ) 𝜀 3 ,

if t V E , t x .

Substituting the inequalities (20) to (22) into (19), we see that d ( f ( t ) , A ) 𝜀 , provided t V E , t x . This is equivalent to (16).

Theorem 7.12 If { f n } is a sequence of continuous mappings on E into a metric space F , and if f n f uniformly on E , then f is continuous on E .

Proof: (In the text, Theorem 7.12 is an immediately corollary of Theorem 7.11. Here, that would require that F be complete, which is not necessarily the case. So the following proof is entirely new.)

By Theorem 4.8, to show that f is continuous, it suffices to show that f 1 ( V ) is open for any open set V F . If x f 1 ( V ) , we need to find a neighborhood N x of x which is contained in f 1 ( V ) , for then f 1 ( V ) would be the union of the open neighborhoods N x , x f 1 ( V ) , and so be open.

Let 𝜀 > 0 be small enough so that the neighborhood M y of y = f ( x ) of radius 𝜀 is contained in V . Let n be large enough so that d ( f n ( z ) , f ( z ) ) 𝜀 3 for all z E , which is possible by the assumption of uniform convergence. Let δ > 0 such that d ( f n ( z ) , f n ( x ) ) < 𝜀 3 for all z in the neighborhood N x of x of radius δ , which is possible since f n is continuous. Then, for all z N x ,

d ( f ( z ) , f ( x ) ) d ( f ( z ) , f n ( z ) ) + d ( f n ( z ) , f n ( x ) ) + d ( f n ( x ) , f ( x ) ) 𝜀 .

That is, f ( z ) M y V , or z f 1 ( V ) , so that N x f 1 ( V ) .

The remaining Theorems, for mappings into R k , are largely corollaries of their scalar counterparts in the text.

Theorem 7.16 Let α be monotonically increasing on [ a , b ] . Suppose f n = ( f n 1 , , f nk ) R ( α ) on [ a , b ] , for n = 1 , 2 , 3 , , and suppose f n f = ( f 1 , , f k ) uniformly on [ a , b ] . Then f R ( α ) on [ a , b ] , and

a b f = lim n a b f n .

Theorem 7.17 Suppose { f n = ( f n 1 , , f nk ) } is a sequence of vector-valued functions, differentiable on [ a , b ] and such that { f ( x 0 ) } converges for some point x 0 on [ a , b ] . If { f n } converges uniformly on [ a , b ] , to a function f = ( f 1 , , f k ) , and

f ( x ) = lim n f n ( x ) ( a x b ) .

Proofs: If x = ( x 1 , , x k ) R k , then | x i | | | x | | i k | x i | . Hence f n convergences uniformly if and only if the component functions f n 1 , , f nk converge uniformly. And since the integers or derivatives, and integrability or differentiability, of vector-valued functions are defined by component, the vector-valued versions of the Theorems 7.16 and 7.17 are immediate corollaries of the scalar versions in the text.

Theorem 7.24 If K is a compact metric space, if f n = ( f n 1 , , f nk ) C ( K ) for n = 1 , 2 , 3 , , and if { f n } converges uniformly on K , then { f n } is equicontinuous on K .

Proof: If x = ( x 1 , , x k ) R k , then | x i | | | x | | i | x i | . Hence { f n } is equicontinuous if and only if each of the { f ni } , i = 1 , , k are equicontinuous. Hence the vector-valued version of Theorem 7.24 is an immediate corollary of the scalar version in the text.

Theorem 7.25 If K is compact, if f n = ( f n 1 , , f nk ) is pointwise bounded and equicontinuous on K , then

  • { f n } is uniformly bounded on K ,
  • { f n } contains a uniformly convergent subsequence.

Proof: Since each of the sequences { f ni } , i = 1 , , k , is pointwise bounded and equicontinuous on K , by the scalar version of Theorem 7.25 in the text each of them is uniformly bounded on K , so { f n } is uniformly bounded on K . Also, { f n 1 } contains a uniformly convergent subsequence, { f n j 1 } . Since the subsequence { f n j 2 } is also pointwise bounded and equicontinuous on K , it also has a uniformly convergent subsequence such that the corresponding subsequence of { f n j 1 } also converges uniformly. Continuing in this manner, after k steps we have a subsequence { f n j } whose component functions all converge uniformly, so { f n j } also converges uniformly.

User profile picture
2023-08-07 00:00
Comments