Scribd Logo
Upload

Welcome to Scribd!

  • Rudin CH 7 PDF

    Uploaded by

    Fanny Soria Felipe
    5 views21 pages

    Original Title

    rudin ch 7.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    5 views21 pages

    Rudin CH 7 PDF

    Uploaded by

    Fanny Soria Felipe

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 21
    2A {976 supp. WATH Solutions Manual to Walter Rudin’s Principles of Mathematical Analysis Roger Cooke, University of Vermont Chapter 7 Sequences and Series of Functions Exercise 7.1 Prove that every uniformly convergent sequence of bounded func- tions is uniformly bounded. Solution. Let {fn(x)}%2.4 be a uniformly convergent sequence of bounded func- tions, say |fa(z)| < Mn for all z and all n. Since the sequence converges uniformly, it is a uniformly Cauchy sequence. Hence there exists NV such that \fre(2)— fan(a)| <1 for all m,n > N. In particular if m > N, we have |fn(z)| < Viv (2)|+lfm(®) —fnr(2)| S$ My +1, and therefore if M = 1+max(Mi,..., My) we have |fn(x)| 0. There exist Ny and Np such that |fn(z) ~ f(2)| < § for all « ifn > Ny and Ign (2) ~ g(2)| < § for all x ifn > No. Let N = max(N;,.No). Then for n > N we have, for all 2, (fa + 9n)(2) = (F +.9)(2)I < [fn @) - F(2)| + lon (2) - 9(2)| 0, choose Ny and No such that |fn(z)—f(z)| < fg for all x and all n > Ny and |gn(z) — g(z)| < 36 for all z and n > Np. 109 110 CHAPTER 7. SEQUENCES AND SERIES OF FUNCTIONS Again let N = max(1N;, No). We then have, for all z and all n > N, \fu(z)9n(2) — S(z)9(z)| < |fale)gn(z) — fa(z)g(2)| + +1falz)9(e) - f(2)9(x)] S$ Mlgn(#) - 9(z)| + Mifa(x) - F(2)| é € < Mag t+May ze Exercise 7.3 Construct sequences {fn}, {gn} which converge uniformly on some set B, but such that { fngn} does not converge uniformly on E (of course, {Fngn} must converge on E). Solution. Let f(z) = z for all 2 and all n, and let gn(z) = 2 for all x and all n. Then f(z) converges uniformly to z, and gn (2) converges uniformly to 0. Therefore fn()gn (2) converges to 0, but not uniformly. In fact for every n there is an , namely ¢ =n, such that fn(z)ga(z) = 1. Hence, no matter how large n is taken, the inequality |f,(x)gn(z)| <1 will never hold for all Exercise 7.4 Consider For what values of x does the series converge absolutely? On what intervals does it converge uniformly? On what intervals does it fail to converge uniformly? Is f continuous wherever the series converges? Is f bounded? Solution. The series converges for all x except 0 and z = =}, n = 1,2,.... For x = 0 all the terms of the series are defined, but the terms do not tend to 0. For z = 5} the nth term is not defined. For all other values of the series converges. By Theorem 7.10 (the Weierstrass M-test) the series converges uniformly on the interval (6,00) if § > 0, since on that interval Lente ~ 126 Likewise, the series converges uniformly on (-c0, —6] except at the points 2 = —3, since for n > \/? we have 1 2 lee on? ‘The series does not converge uniformly on any interval having 0 as an end- point. This is easy to see in the case when 0 is the left-hand endpoint. For each a of the terms of the series is a bounded function on (0,00). If the series converged uniformly, the limit would be bounded by Problem 1 above, But we have AB)2¥ neil at n 2 Likewise the series cannot be a uniformly Cauchy series (i.e., the sequence of partial sums cannot be a uniformly Cauchy sequence) on any interval (~6,0), since, no matter how large n is taken, there is a point « in this interval, namely 2 = phy, at which the nth term has the value 2. Hence, if Sy denotes the sum of the first n terms, then |S, (z) ~ Sn-x(2)| = ‘The uniform convergence shows that the limiting function f(x) is continu ous wherever it is defined on (—00,6] U [6,+00). Since é is arbitrary, f(z) is continuous wherever it is defined. The argument given above shows that f(r) is not bounded. Exercise 7.5 Let Show that {fn} converges to a continuous function, but not uniformly. Use the series 5> fy to show that absolute convergence, even for all x does not imply uniform convergence. Solution. The limit of fa(z) is zero. If x < 0 or e > 1, then fn(z) = 0 for all n, and so this assertion is obvious, If 0 <2 < 1, then f(z) = 0 for all n > 3, and so once again the assertion is obvious. The convergence is not uniform, since, no matter how large n is taken, there is a point z, namely z= sr for which f(x) = 1. ‘The series fa(z) converges to 0 for z < 0 and x > 1, and to sin? 2 for 0 <2 <1. Since the terms are nonnegative, the series obviously converges absolutely. Since the sum is not continuous at 0, the series does not converge uniformly on any interval containing 0. Exercise 7.6 Prove that the series = att tn yo we converges uniformly in every bounded interval, but does not converge absolutely for any value of x. 12 CHAPTER 7. SEQUENCES AND SERIES OF FUNCTIONS Solution. The series is the sum of two series The first of these converges both uniformly and absolutely on any bounded interval (a, ] by the M-test (with My = 4, where M = max((al,|b/)). The setond is independent of x and converges, hence it converges uniformly in 2. By Exercise 2 above, the sum of the two series converges uniformly. The series does not converge absolutely since the absolute value of each term is at least 2 for any z. Exercise 7.7 For n = 1,2,3,... 1+nz2" eC ————L the equation F'(2) = Jim. f(a) is correct if x #0, but false if x = 0, Solution. The Schwara inequality, which implies that Vial) < ala = abe for z #0, shows that f,(z) tends uniformly to 0. Now fi (2) = a which tends to 0 if «#0, though f%(0) = 1 for all n. Exercise 7.8 If 0 (<0), T(z) 1 (e>0), if {tn} is a sequence of distinct points of (a,b), and if X len| converges, prove that the series fle) = Sento nat (asx 0. Choose N; so large that |fm(x)— f(z) < § for all m > M, ‘Then, since / is continuous at x, choose § > 0 so small that |f(y) — f(2)| < § if |y —2| < 6. Finally, choose No so large that |r, —2| <6 ifn > Nz. Then if n> max(Nj,.N2) we have Jn(@n) — (2) $ |fa(@n) — f(@n)| + |f@n) - £(2)| n+1. Thus fa(2) tends to zero, since f(x) = Oifn > |x, but f_(2) does not converge uniformly, since f,(n-+ 4) = 1 Then for any convergent sequence, say tn + 2, let N > max([x|, [21], [2al,-.-» |nls--.). We then have fn (tn) = 0 for alln > N, and 80 f(a) > f(x) This condition does guarantee uniform convergence on any compact set, however. For if {fn(z)} is not a uniformly Cauchy sequence, then for some £o > 0 there is a sequence of integers ny < my < +++ and @ sequence of points 21,22,... such that [Fnon—1(te) ~ Foe (te)| 2 €0 for k = 1,2,.... Since K is compact, some subsequence of {2,} converges, say t, > © as — 00, Now define yn = x for alln # mo,, n # No.1, and let Ynay, 1 = Unox = Tk-» 80 that so that y, + z. Then the sequence {en} = (fn(Un)} is not a Cauchy sequence, since |2nsa, — Znae,—al = Exercise 7-10 Let (x) x 0, and this will show that fq(z) is discontinu- ao Be : Since all the terms of the series for fy are nonnegative, it suffices to show that the limit of the first term is positive, To that end, let § = 34. If “g ql a -6 - from which it follows ous at r= 1 that f4(=) 2 g95- Therefore the lower left-hand limit of f(z) at # = Bis at 4 q 2 Since, by the M-test with M, = an this series converges uniformly and each of its terms is Riemann-integrable, it follows from Theorem 7.16 that the sum of the series is Riemann-integrable. Exercise 7.11 Suppose {fa}; {gn} are defined on E and (a) fp has uniformly bounded partial sums; (8) 9, = 0 uniformly on B; (c) g(x) = g2(x) 2 ga(a) 2 --- for every 2 € E. Prove that > faga converges uniformly on E. Hint: Compare with Theorem 3.42. Solution. Following the hint, we let Sv(z) n 2X, fale)an(z) and F(z) YX, fale) (Fo(2) = 0), so that |Fy(z)| < B for all z. Then if N > M, we have N |Sw(0)-Su(e)| = | 3) (Fale) - Fo-a(e)on(a)| adits = |Fv(e)ow(2) — Facln)anesa(@) + + > Falelon() — gn4a(0)| nants yea < B{lov(2)] +lameale) + Do ln) ~ gnarl} = Bilgw(#)| + lgnesa(@)| + gaeza() - gv(2)], and this last expression can be made uniformly small by choosing M sufficiently large by hypothesis (6). Hypothesis (c) was used in moving the stmmation sign outside the absolute value, Exercise 7.12 Suppose g and fy (n = 1,2,3,...) are defined on (0,00), are Riemann-integrable on [t,T] whenever 0 < t < T < 00, |fnl $9, fn > f uniformly on every compact subset of (0,00), and fF oeyae <0. Prove that. o lim, i Sol) de i fla)de. ene 0 (See Exercises 7 and 8 of Chap. 6 for the relevant definitions.) This is a rather weak form of Lebesgue’s dominated convergence theorem (Theorem 11.32). Even in the context of the Riemann integral, uniform con- vergence can be replaced by pointwise convergence if it is assumed that f € R. (See the articles by F. Cunningham in Math. Mag., vol. 40, 1967, pp. 179-186, and by H. Kestelman in Amer. Math. Monthly, vol. 77, 1970, pp. 182-187.) Solution. We shall prove that f Jn(z) de converges for each n, that the limit 5 lim | fa(x) dx exists, that quantities are equal. J (x) de converges and that these last two 116 CHAPTER 7. SEQUENCES AND SERIES OF FUNCTIONS Since we obviously have |/(2)| < g(z) also, it follows that for any interval {r3] C (0,00) we have | [ tateyan < ff saya [sere s [ote)ae, | sate stedael <2 [" otedac. Now let ¢ > 0. Choose a and b with 0 e > b we have , . [ aayar = [olayac~ f° oteyae ve c3 3 = fF serae— fi oa) b ' 4 [ ol) dx -f o(2) de ° + ee Then for any d > e > b > r and any n we certainly have | [tscae— f° satael =| f° score ‘i Thus by the Cauchy criterion Jim / j,(2)de exists. A similar argument A s [ oear 0 we can choose c and d so that the first and’last terms on the right are less than § (for all n, in the case of the first term). Then, since fa(z) + f(z) uniformly on ¢,d, we can choose no so large that the middle term is less than § if n > no. Exercise 7.13 Assume that {fn} is a sequence of monotonically increasing functions on R! with 0 < f,(2) <1 for all x and all n. (a) Prove that there is a function f and a sequence {ng} such that F(e) = jim fC) for every x € R!. (The existence of such a pointwise convergent subsequence is usually called Helly’s selection theorem.) (0) If, moreover f is continuous, prove that f,, — f uniformly on Rt Hint: (i) Some subsequence {fn,} converges at all rational points r, say to J (r). (ii) Define f (2) for any x € R! to be sup f(r), the sup being taken over all 1 <2. (ii) Show that fn,(2) > f(z) at every x at which f is continuous. (This where monotonicity is strongly used.) (iv) A subsequence of {f,,} converges at every point of discontinuity of f since there are at most countably many such points. This proves (a). To prove (), modify your proof of (iii) appropriately. Solution. (a) Following the hint, we enumerate the rational numbers (or any countable dense set) as {rn} and use the well-known diagonal procedure to get first a subsequence that converges at r1, then a further subsequence that converges at rz, ete. The sequence formed by taking the nth term of the nth subsequence is itself a subsequence and converges at each rn. (Note that we have not used the fact that 0 < f,(«) < 1 for all x and n, only the much weaker fact that for each x there is an M(x) such that |f,(x)| < M(x) for all z and n.) Let the function f(z) be defined as f(rx) = lima, fa,(re) and (x) = sup{f(re) : re < 7} for all other 2. The second definition could be taken as the general one if we wished, since it is consistent with the definition already given at the points x = T.. Since each of the functions is nondecreasing, it is clear that the function f(z) is nondecreasing. By its definition it is continuous from the left. Suppose f(z) is continuous at ro. Let <> 0 be given. Choose rational numbers r and s with ip, t= or t=. We then have $(0) — § SS) — F< Sault) S fas(B0) S fas(8) < SU) + $$ H(00) + 5- Hence |f(z0) — fn,(t0)| < € if i > tp, which proves the convergence at points of continuity. One more application of the diagonal procedure now allows us to assure that some subsequence converges at every point (since the set of of discontinuities of a nondecreasing function is countable). We can then modify the definition of f(x) at these points. 8 CHAPTER 7. SEQUENCES AND SERIES OF FUNCTIONS The claim that the convergence is uniform if the limit is continuous is not true. Let: Te aay HF each a, vet Inlu) ~ Fly) > y > n, so that the convergence is not uniform. Here the functions f(x) are not continuous, but they could easily be made so without violating the conditions of the problem. To get uniform convergence we must assume in addition that f(x) — 1 as 2 — co and f(z) + 0 as x + oo. Let us grant these relations and assume that f(z) is continuous at all points x. To simplify the notation we shall write fe instead of fay. Given © > 0, choose an interval [2,0] such that f(z) < if It is clear that lim fx(2) = 2 1- 5 if >. Then, since f(z) is uniformly continuous on {a,8], let a = to < ty <+-+ < tq =b be such that f(ti) — f(ti-1) < $. Choose kk so large that |fi(ts) — f(ts)| < § for all ¢=1,...,n and all 1 > k.Then for all y>b=t, we have 13 fy) 2 fits) >1- = and 12s) >1-$>1-4. Hence certainly \fily) - Ff) <1 (1- F) k and all y > b. A similar argument shows that f; converges uniformly to f on (~00,a]. The argument that fi converges uniformly to f on [t;~1, ts] is identical to that given above. Exercise 7.14 Let f be a continuous real function on R? with the following properties: 0 < f(t) < 1, f(t+2) = f(t) for every t, and 0 (O

    You might also like