Exercise 6.2.13

Recall that the Bolzano-Weierstrass Theorem (Theorem 2.5.5) states that every bounded sequence of real numbers has a convergent subsequence. An analogous statement for bounded sequences of functions is not true in general, but under stronger hypotheses several different conclusions are possible. One avenue is to assume the common domain for all of the functions in the sequence is countable. (Another is explored in the next two exercises.) Let A = { x 1 , x 2 , x 3 , } be a countable set. For each n N , let f n be defined on A and assume there exists an M > 0 such that | f n ( x ) | M for all n N and x A . Follow these steps to show that there exists a subsequence of ( f n ) that converges pointwise on A .

(a)
Why does the sequence of real numbers f n ( x 1 ) necessarily contain a convergent subsequence ( f n k ) ? To indicate that the subsequence of functions ( f n k ) is generated by considering the values of the functions at x 1 , we will use the notation f n N = f 1 , k .
(b)
Now, explain why the sequence f 1 , k ( x 2 ) contains a convergent subsequence.
(c)
Carefully construct a nested family of subsequences ( f m , k ) , and show how this can be used to produce a single subsequence of ( f n ) that converges at every point of A .

Answers

(a)
Since f n is bounded, ( f n ( x 1 ) ) is a bounded sequence, so by Bolzano-Weierstrauss ( f n ( x 1 ) ) has a convergent subsequence which uses f n k .
(b)
Same reason as (a)
(c)
Let f 2 , k represent the subsequence of functions generated in part (b), and keep in mind that this subsequence of functions continues to converge pointwise at x 1 . We can then repeat this process, finding a subsequence of functions while considering f 2 , k ( x 3 ) , and repeat for every element in A .

If A were finite, we could simply take the last sequence and we would be done. But since A is countably infinite, there is no last element; we need to be a bit more careful. Instead of picking a particular subsequence, define a new subsequence of functions ( g n ) , with g n = f n , n (where f a , b is the b ’th element of the sequence of functions f a , k ). For any fixed q , the sequence g n ( x q ) is guarenteed to converge, since after q elements the sequence consists solely of elements from f q , k which converges at x q .

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