Math 320, Real Analysis I

Solutions to Homework 8 Problems

Exercise 6.2.7. Assume that (fn ) converges uniformly to f on A and that each fn is uniformly continuous on A. Prove that f is uniformly continuous on A. Proof. Let (fn ) be a sequence of functions fn : A R that are each uniformly continuous on A and suppose (fn ) converges uniformly to f on A. Let > 0 be arbitrary. Then there exists a natural number N N such that for all n N , |fn (x) f (x)| < 3 for all x A by the uniform convergence of (fn ) to f on A. In particular, |fN (x) f (x)| < 3 for all x A.
Now, as fN is uniformly continous on A, there exists > 0 such that |fN (x) fN (y)| < 3 whenever x, y A satisfy |x y| < . Then, for this , suppose x, y A satisfy |x y| < , and consider

|f (x) f (y)| = | f (x) [fN (x) fN (x)] [fN (y) fN (y)] f (y) | = | [f (x) fN (x)] + [fN (x) fN (y)] + [fN (y) f (y)] | | f (x) fN (x) | + | fN (x) fN (y) | + | fN (y) f (y) | < + + = . 3 3 3 Therefore, f is uniformly continuous on A.

Exercise 6.2.11. Assume (fn ) and (gn ) are uniformly convergent sequences of functions. (a) Show that (fn + gn ) is a uniformly convergent sequence of functions. Proof. Let > 0 be arbitrary. Then /2 > 0, so there exists K N such that k K implies ||fk f ||A < 2 since (fn ) is uniformly convergent to f on A. Similarly, there exists M N such that m M implies ||gm g||A < 2 . Set N = max{K, M }. Then, for n N , we have ||(fn + gn ) (f + g)||A = ||(fn f ) + (gn g)||A ||fn f ||A + ||gn g||A < Thus (fn + gn ) is uniformly convergent to f + g on A. (b) Give an example to show that the product (fn gn ) may not converge uniformly. Example: Let A = R and consider the sequences (fn ) and (gn ), where fn (x) = x and gn (x) = 1 n + = . 2 2

for each n N and x A. Now (fn ) converges uniformly to f (x) = x on A because it is a constant sequence of functions. Also, (gn ) converges uniformly to g(x) = 0 on A since each gn is constant so the convergence of (gn ) obviously does not depend on x. x However, (fn gn ) = n converges to the zero function, but it does not converge uniformly on A = R as we have seen in class (for any > 0 and n N, we can nd x = n + 1 R such that x/n > ). (c) Prove that if there exists an M > 0 such that |fn | M and |gn | M for all n N, then (fn gn ) does converge uniformly.

Math 320, Real Analysis I

Solutions to Homework 8 Problems

Proof. Suppose (fn ) f and (gn ) g uniformly on A. Assume that there exists an M > 0 such that ||fn ||A M and ||gn ||A M for all n N. Then, by the Order Limit Theorem, ||f ||A M and ||g||A M as well. Let > 0 be arbitrary. As M > 0, we have 2M > 0 also, so there exists N1 , N2 N such that ||fn f ||A < 2M for all n N1 and ||gn g||A < 2M for all n N2 . Take N = max{N1 , N2 } and consider, for n N , ||fn gn f g||A = ||fn gn fn g + fn g f g||A ||fn gn fn g||A + ||fn g f g||A = ||fn ||A ||gn g||A + ||fn f ||A ||g||A < [M ] + [M ] = . 2M 2M Therefore, (fn gn ) f g uniformly on A. Exercise 6.2.13. (Cantor Function). Review the construction of the Cantor set C [0, 1] from Section 3.1. This exercise makes use of results and notation from this discussion. (a) Dene f0 (x) = x for all x [0, 1]. Now let (3/2)x f1 (x) = 1/2 (3/2)x 1/2

for 0 x 1/3 for 1/3 < x < 2/3 for 2/3 x 1.

Sketch f0 and f1 over [0, 1] and observe that f1 is continuous, increasing, and constant on the middle third (1/3, 2/3) = [0, 1]\C1 . Solution: Heres a sketch of the rst two functions in the sequence (fn ) whose limit is called the Cantor function. The picture says it all, where the blue curve is f0 , the green one is f1 (and the yellow one is f2 from part (b) below). 1

0 0 1

Math 320, Real Analysis I

Solutions to Homework 8 Problems

(b) Construct f2 by imitating this process of attening out the middle third of each nonconstant segment of f1 . Specically, let (1/2)f1 (3x) for 0 x 1/3 f2 (x) = f1 (x) for 1/3 < x < 2/3 (1/2)f1 (3x 2) + 1/2 for 2/3 x 1.

If we continue this process, show that the resulting sequence (fn ) converges uniformly on [0, 1]. Proof. Let > 0 be arbitrary. We will use the Cauchy Criterion for Uniform Convergence, since we dont really know the limit function, f . Now, using mathematical induction, we will show that ||fk+1 fk || 21 for all k 0. We rst note that k ||fk+1 fk ||[0,1] = ||fk+1 fk ||[0,1/3k ] . Now, when k = 0, the assertion is obvious, so our base case is established. Now assume it is true for k = n and consider the case of k = n + 1. We have ||fn+2 fn+1 ||[0,1/3n+1 ] = sup{|fn+2 (x) fn+1 (x)| : 0 x 1/3n+1 } = sup{|[1/2fn+1 (3x)] [1/2fn (3x)]| : 0 x 1/3n+1 } 1 sup{|fn+1 (y) fn (y)| : 0 y 1/3n } = 2 1 1 1 1 = ||fn+1 fn ||[0,1/3n ] = n+1 , n 2 2 2 2
1 so our inductive step is complete. Since converges (being geometric with ratio 2k r = 1/2), by the Cauchy Criterion for Series, there is an N N such that for all m n N we have | m 21 | < . Hence, for m > n N consider k=n k m1 m1

||fm fn ||
k=n

||fk+1 fk ||
k=n

1 < . 2k

Therefore, (fn ) converges uniformly on [0, 1]. (c) Let f = lim fn . Prove that f is a continuous, increasing function on [0, 1] with f (0) = 0 and f (1) = 1 that satises f (x) = 0 for all x in the open set [0, 1]\C. [Note: Recall that the length of the Cantor set C is 0. Somehow, f manages to increase from 0 to 1 while remaining constant on a set of length 1.] Proof. Clearly each fn is continuous on [0, 1], so f = lim fn is also continuous by Theorem 6.2.6. Moreover, as f0 is increasing and fk increasing implies fk+1 is too, by induction each fn is an increasing function on [0, 1]. Hence, if x < y in [0, 1], then fn (x) fn (y), so fn (y)fn (x) 0 for all n. Therefore, by the Order Limit Theorem, we conclude that f (y) f (x) = lim[fn (y) fn (x)] 0 as well, so f (x) f (y), and we conclude that f is also increasing. As f = lim fn , it is obvious that f (0) = lim fn (0) = lim 0 = 0 and f (1) = lim fn (1) = lim 1 = 1. Finally, if x [0, 1]\C, then x is in an open interval removed at some stage, say n, so fm is constant on this neighborhood of x for all m n, so that f is also constant on this neighborhood. Hence f (x) = limyx f (y)f (x) = limyx 0 = 0, yx so f (x) = 0 on the set [0, 1]\C as claimed.