Introduction To Real Analysis Spring 2014 Lecture Notes

3y ago
20 Views
2 Downloads
519.17 KB
91 Pages
Last View : 1m ago
Last Download : 3m ago
Upload by : Javier Atchley
Transcription

Introduction to Real AnalysisSpring 2014 Lecture NotesVern I. PaulsenApril 22, 2014

2

Contents1 Sequences and Series of Functions1.1 Behavior of Riemann Integrals with Limits . . . . . . . . .1.2 Uniform Convergence and Continuity . . . . . . . . . . . . .1.3 Uniform Convergence and Derivatives . . . . . . . . . . . .1.4 Series of Functions . . . . . . . . . . . . . . . . . . . . . . .1.5 An Increasing Function with a Dense Set of Discontinuities1.6 A Space Filling Curve . . . . . . . . . . . . . . . . . . . . .1.7 Power Series . . . . . . . . . . . . . . . . . . . . . . . . . . .1.8 Operations on Power Series . . . . . . . . . . . . . . . . . .1.9 Taylor Series . . . . . . . . . . . . . . . . . . . . . . . . . .1.10 Polynomial Approximation . . . . . . . . . . . . . . . . . .1.11 The Stone-Weierstrass Theorem . . . . . . . . . . . . . . . .1.12 Fourier Series . . . . . . . . . . . . . . . . . . . . . . . . . .1.13 Orthonormal Sets of Functions . . . . . . . . . . . . . . . .1.14 Fourier Series, Continued . . . . . . . . . . . . . . . . . . .1.15 Equicontinuity and the Arzela-Ascoli Theorem . . . . . . .5810131518222428343740434549532 Multivariable Differential Calculus2.1 The Total Derivative . . . . . . . . . . . . . . . . . . . .2.2 Differentiability and Continuity . . . . . . . . . . . . . .2.3 The Chain Rule . . . . . . . . . . . . . . . . . . . . . . .2.4 Multivariable Mean Value Theorem . . . . . . . . . . . .2.5 Continuously Differentiable Functions . . . . . . . . . .2.6 The Inverse Function Theorem . . . . . . . . . . . . . .2.7 The Multi-Variable Newton and Quasi-Newton Methods2.8 The Implicit Function Theorem . . . . . . . . . . . . . .2.9 Local Extrema and the Second Derivative Test . . . . .2.10 Taylor Series in Several Variables . . . . . . . . . . . . .57606465676971767884883.

4CONTENTS

Chapter 1Sequences and Series ofFunctionsIn this chapter we introduce different notions of convergence for sequenceand series of functions and then examine how integrals and derivatives behave upon taking limits of functions in these various senses. We then applythese results to power series and Fourier series.Definition 1.1. Given a set X, a metric space (Y, ρ), functions fn : X Y, n N and f : X Y, we say that the sequence of functions {fn }converges pointwise to f provided that for each x X, the sequenceof points {fn (x)} converges to the point f (x) in the metric of Y. That is,ptwprovided that limn ρ(fn (x), f (x)) 0. When this occurs we write, fn f.Note that the statement that {fn } converges pointwise to f is equivalentto the requirement that for each 0 and x X, there is a Nx so thatwhen n Nx we have that ρ(fn (x), f (x)) . That is, since pointwiseconvergence only requires convergence at each point in X, the value that wetake for N could depend on the individual point x as well as on . When thevalue for N can be picked depending only on and independent of the pointx, then we call the convergence uniform. The precise definition follows.Definition 1.2. Given a set X, a metric space (Y, ρ), functions fn : X Y,n N and f : X Y, we say that the sequence of functions {fn } convergesuniformly to f provided that for each 0, there is N, so that whenn N, then for every x X, we have ρ(fn (x), f (x)) . When this occursuwe write, fn f.Note that uniform convergence always implies pointwise convergence,since it is the stronger condition that N is independent of the point x.5

6CHAPTER 1. SEQUENCES AND SERIES OF FUNCTIONSJust as pointwise convergence is the requirement that limn ρ(fn (x), f (x)) 0, uniform convergence is equivalent to the requirement that the sequence ofnumbers sn sup{ρ(fn (x), f (x)) : x X} converges to 0. That is, providedthatlim[sup{ρ(fn (x), f (x)) : x X}] 0.nWe prove this below.Proposition 1.3. Let X be a set, let (Y, ρ) a metric space, let fn : X Y,n N and f : X Y be functions and setsn sup{ρ(fn (x), f (x)) : x X}.u f if and only if limn sn 0.Then fn u f. Let 0 be given. By the definition ofProof. First assume that fn uniform convergence, there is a N so that when n N, for every x X, wehave ρ(fn (x), f (x)) /2. But this implies that for n N, we havesn sup{ρ(fn (x), f (x)) : x X} /2 .Thus, for n N we have that sn 0 and since was arbitrary, thisproves that limn sn 0.Conversely, assume that limn sn 0. Then given 0, there is aN so that n N implies that 0 sn whihc implies that for everyn N and for every x X, we have ρ(fn (x), f (x)) . This proves thatufn f.Note that for both of these definitions, we did not need for X to be ametric space, although in many of the interesting examples, we will alsohave X a metric space.ptwuAlso note that if fn f, then fn f.Example 1.4. Let X Y ([0, 1] be endowed with the usual metric, let0 0 x 1fn (x) xn and let f (x) . Then it is easy to see that1 x 1ptwfn f. To decide if the convergence is also uniform, we computesn sup{ρ(fn (x), f (x)) : 0 x 1} sup{ xn f (x) : 0 x 1} sup{xn : 0 x 1} 1.Since, limn sup{ρ(fn (x), f (x)) : 0 x 1} 1 6 0, we conclude that {fn }does not converge uniformly to f.

7Thus although uniform convergence implies pointwise convergence, wehave that pointwise convergence does not imply uniform convergence. Forthis reason we say that uniform convergence is a stronger convergence thanpointwise convergence.In this example, each of the functions fn is continuous, but f is clearlynot continuous. Thus, this example shows that the pointwise limit of continuous functions need not be a continuous function. Later we will see thatuniform limits of continuous functions are again continuous.Example 1.5. This is a slight modification of the first example. Let X [0, B], Y [0, 1] with 0 B 1, let fn (x) xn and let f (x) 0. Nowsn sup{ fn (x) f (x) : x X} sup{xn : 0 x B} B n .u f.Since, limn B n 0, we have that fn Example 1.6. Let X Y R with the usual metric, let fn (x) ptwxnand letf (x) 0. Then fn f but {fn } does not converge to f uniformly.Example 1.7. Let X Y [ π, π] with the usual metric, let fn (x) sin(nx)and let f (x) 0. Since sup{ fn (x) f (x) : π x π} n1 wenuhave that fn f, but fn0 (0) 1, while f 0 (0) 0.Thus, even uniform convergence of functions does not guarantee convergence of their derivatives.Problem 1.8. Let X Y [0, 1] with the usual metric, let fn : X Y bedefined by fn (x) x1/n and let(0 when x 0f (x) .1 when x 6 0ptwProve that fn f and that {fn } does not converge to f uniformly.Problem 1.9. Let X R be compact, let fn : X R be defined byufn (x) nx and let f (x) 0 be the 0 function. Prove that fn f.Problem 1.10. Let f : R R be continuous at 0. Set gn (x) f ( nx ) andlet g be the constant function that is equal to f (0).ptw1. Prove that gn g as functions on R.2. Give an example of a function f such that the convergence is not uniform as functions on R.u3. Prove that if X R is any compact subset of R, then gn g asfunctions on X.

8CHAPTER 1. SEQUENCES AND SERIES OF FUNCTIONS1.1Behavior of Riemann Integrals with LimitsWe now look at how Riemann integration behaves under pointwise and uniform convergence.Example 1.11. Let X Y [0, 1] with the usual metric. Recall that therationals are countable and let {rn }n N be an enumeration of the rationalnumbers in [0, 1]. We set((1 x rk , 1 k n1 x rationalfn (x) and f (x) .0 otherwise0 x irrationalptwIt is easily checked that fn f, but for every n, sup{ fn (x) f (x) : 0 x 1} 1 and so the sequence does not converge uniformly Rto f. Now verify1that each function fn is Riemann integrable on [0, 1] with 0 fn (x)dx 0,but f is not Riemann integrable.Thus, we see that if {fn } is a sequence of Riemann integrable fuctionsthat converges pointwise to a function f, then f might not even be Riemannintegrable! In this case there is no chance that the limit of the integrals isthe integral of the limit.The next example shows that even when the limit function is Riemannintegrable, pointwise convergence is not enough to guarantee that the limitof the integrals is the integral of the limit.Example 1.12. Let X Y [0, 1], set 2 2n xfn (x) 2n 2n2 x 010 x 2n112n x n1n x 1ptwand let f (x) 0. ThenR 1 are Riemann inteR 1 fn f, all of these functionsgrable on [0, 1], but 0 fn (x)dx 1/2 for all n, while 0 f (x)dx 0.These last two examples show that the formula,Z bZ blimfn (x)dx lim fn (x)dx,naanis not valid when the limit of the functions is meant in the pointwise sense.We now prove that all of these problems “go away” when one considersuniform convergence instead.

1.1. BEHAVIOR OF RIEMANN INTEGRALS WITH LIMITS9Lemma 1.13. Let α : [a, b] R be an increasing function and let f, g :[a, b] R be two bounded functions. If δ sup{ f (x) g(x) : a x b},then for any partition P {x0 , ., xn } of [a, b] e have that U (f, P, α) U (g, P, α) δ(α(b) α(a)) and L(f, P, α) L(g, P, α) δ(α(b) α(a)).Proof. For each x, we have that g(x) δ f (x) g(x) δ. Hence, for eachsubinterval of the partition we have that mi (g) δ inf{g(x) : xi 1 x xi } δ inf{f (x) : xi 1 x xi } mi (f ) and Mi (f ) sup{f (x) : xi 1 x xi } sup{g(x) : xi 1P x xi } δ Mi (g) δ. PThus, U (f, P, α) ni 1 Mi (f )(α(xi ) α(xi 1 )) ni 1 (Mi (g) δ)(α(xi ) α(xi 1 )) U (g, P, α) δ(α(b) α(a)).The proof of the other inequality is similar.Theorem 1.14. Let α : [a, b] R be an increasing function on [a, b] andlet {fn } be a sequence of functions that are Riemann-Stieltjes integrable on[a, b] with respect to α and converge uniformly to a function f on [a, b]. Thenf is Riemann-Stieltjes integrable on [a, b] with respect to α andZlimnbZfn dα abf dα.aProof. We first prove that f satisfies the Riemann-Stieltjes integrability criterion on [a, b]. The case that α(a) α(b) is trivial, so we assume thatα(b) α(a) 0. Given 0, set δ 4(α(b) α(a))and choose an integer N so that forn N we have that sup{ f (x) fn (x) : a x b} δ.Since fN is Riemann-Stieltjes integrable, we may choose a partition P,so that U (fN , P, α) L(fN , P, α) 2 . Applying the lemma, we have thatU (f, P, α) L(f, P, α) [U (fN , P, α) δ(α(b) α(a))] [L(fN , P, α) δ(α(b) α(a))] [U (fN , P, α) L(fN , P, α)] 2δ(α(b) α(a)) .2 2Thus, f satisfies the Riemann-Stieltjes integrability criterion.Also, for any n N, applying the lemma again, we have thatZbf dα inf{U (f, P, α) : P} aZinf{U (fn , P, α) δ(α(b) α(a)) : P} ab fn dα ,4

10CHAPTER 1. SEQUENCES AND SERIES OF FUNCTIONSwhileZ bf dα sup{L(f, P, α) : P} aZsup{L(fn , P, α) δ(α(b) α(a)) : P} ab fn dα .4These two inequalities show that for n N, we have thatZ bZ b fn dα .f dα 4aaSince was arbitrary, we have thatZ bZ blimfn dα f dα.naaProblem 1.15. Prove that the functions {fn } in Example 1.7 do convergepointwise to f, prove that each fn is Riemann integrable with Riemann integral equal to 0 and prove that f is not Riemann integrable.Problem 1.16. Prove that the functions {fn } of Example 1.8 do convergepointwise to f and prove that each fn is Riemann integrable with integralequal to 1/2.1.2Uniform Convergence and ContinuityWe have already seen that pointwise limits of continuous functions need notbe continuous. In this section we will show that uniform limits preservecontinuity. Some of these results have been seen in a different form inChapter I.4.Theorem 1.17. Let (X, d) and (Y, ρ) be metric spaces, let fn : X Y, n N be a sequence of functions from X to Y that converge uniformly to afunction f : X Y and let x0 X. If fn is continuous at x0 for all n N,then f is continuous at x0 .Proof. Given 0, we may pick N so that for n N, we have thatsup{ρ(fn (x), f (x)) : x X} /3. Fix any n N, and using the fact thatfn is continuous at x0 , we may pick δ 0, so that d(x, x0 ) δ implies thatρ(fn (x), fn (x0 )) /3.

1.2. UNIFORM CONVERGENCE AND CONTINUITY11Hence, for d(x, x0 ) δ, by applying the triangle inequality twice, wehave thatρ(f (x), f (x0 )) ρ(f (x), fn (x)) ρ(fn (x), f (x0 )) ρ(f (x), fn (x)) ρ(fn (x), fn (x0 )) ρ(fn (x0 ), f (x0 )) /3 /3 /3,and we conclude that f is continuous at x0 .Corollary 1.18. Let (X, d) and (Y, ρ) be metric spaces, let fn : X Y, n N be a sequence of functions from X to Y that converge uniformly to afunction f : X Y. If fn is continuous for all n N, then f is continuous.We now consider the set of all continuous functions between two metricspaces and show that when the domain space is compact, then this set canbe endowed with a metric.Lemma 1.19. Let (X, d) and (Y, ρ) be metric spaces and let f, g : X Y,be continuous functions. Then the function h : X R defined by h(x) ρ(f (x), g(x)) is continuous.Proof. Fix a point x0 X, and we will show that h is continuous at x0 . Given 0, since f and g are continuous at x0 , there exists δ1 0 and δ2 0,so that d(x, x0 ) δ1 implies that ρ(f (x), f (x0 )) /2, while d(x, x0 ) δ2implies that ρ(g(x), g(x0 )) /2. Let δ min{δ1 , δ2 }, then for d(x, x0 ) δ,and using the reverse triangle inequality we have that h(x) h(x0 ) ρ(f (x), g(x)) ρ(f (x0 ), g(x0 ) ρ(f (x), g(x)) ρ(f (x0 ), g(x)) ρ(f (x0 ), g(x)) ρ(f (x0 ), g(x0 )) ρ(f (x), f (x0 )) ρ(g(x), g(x0 )) /2 /2.Since 0 was arbitrary, this proves that h is continuous at x0 .Definition 1.20. Given two metric spaces (X, d) and (Y, ρ), we let C(X; Y )denote the set of all continuous functions from X to Y. Given f, g C(X; Y )we setγ(f, g) sup{ρ(f (x), g(x)) : x X}.When this supremum is unbounded, we set γ(f, g) .Theorem 1.21. Let (X, d) and (Y, ρ) be metric spaces with X compact.Then1. γ defines a metric on C(X; Y ),

12CHAPTER 1. SEQUENCES AND SERIES OF FUNCTIONS2. a sequence {fn } C(X; Y ) converges to f C(X; Y ) in the metric γu f,if and only if fn 3. if (Y, ρ) is complete, then (C(X; Y ), γ) is also a complete metric space.Proof. Given f, g C(X; Y ), by the above lemma the function x ρ(f (x), g(x))is a continuous function from the compact metric space X to R. Hence, itis bounded and so γ(f, g) 0 is a finite real number. Note that γ(f, g) 0if and only if ρ(f (x), g(x)) 0 for every x X which is if and only iff (x) g(x) for every x X.Clearly, γ(f, g) γ(g, f ). So all that remains to show that γ is a metricis to verify the triangle inequality. To this end let f, g, h C(X; Y ). Thenγ(f, g) sup{ρ(f (x), g(x)) : x X} sup{ρ(f (x), h(x)) ρ(h(x), g(x)) : x X} γ(f, h) γ(h, g).Thus, γ is a metric and 1) is proven.Next we prove the second statement. To see this we refer back to Proposition 1.3. Note that the sn of that proposition is sn ρ(fn , f ). Thus, {fn }converges to f in the metric ρ iff limn ρ(fn , f ) 0 iff limn sn 0. ByuProposition 1.3, this last statement is equivalent to requiring that fn f.To prove the third statement, we let {fn } C(X; Y ) be a sequence thatis Cauchy in the metric γ, and we must prove that there exists a functionf C(X; Y ), so that {fn } converges to f in the metric γ.Since for each fixed x X, we have that ρ(fn (x), fm (x)) γ(fn , fm ),we see that the sequence of points in Y, given by {fn (x)} is also Cauchy.Since (Y, ρ) is complete, there is a point that this sequence converges toand we set f (x) limn fn (x). Since x X, was an arbitrary point, we seethat we can define a function, f : X Y, by setting for each point x X,f (x) limn fn (x).If we can prove that the sequence {fn } converges uniformly to f, thenby the above theorem, f will be a continuous function from X to Y and by2) we will have that {fn } converges to f in the metric γ, so our proof willbe complete.Given 0, since our original sequence of functions is Cauchy, we maypick N, so that for any n, m N, we have that γ(fn , fm ) /2. Now fixx0 X, and n N, then we have thatρ(f (x0 ), fn (x0 )) lim ρ(fm (x0 ), fn (x0 )) /2.mSince x0 was arbitrary, we have thatsup{ρ(f (x), fn (x)) : x X} /2 ,

1.3. UNIFORM CONVERGENCE AND DERIVATIVES13for every n N. This proves that the convergence is uniform. Thus, f C(X; Y ) and we see that this last inequality also shows that γ(f, fn ) forn N. Thus the sequence {fn } converges to the continuous function f inthe metric γ and our proof is complete.When Y R with the usual metric, then we simplify notation by settingC(X) C(X; R). We can now see that Theorem I.4.7 is a special case ofthe above theorem.When Y Rk with the usual Euclidean metric, then we can think of afunction in f C(X; Rk ) as a vector-valued function f (x) (f1 (x), ., fk (x))where each fi : X R. Using Theorem I.3.18, we see that f is continuousif and only if each fi C(X).Problem 1.22. Let α : [a, b] R be an increasing function and let R([a, b], α)denote the set of functions on [a,b] that are Riemann-Stieltjes integrable withrespect to α. Given f, g R([a, b], α) define γ(f, g) sup{ f (x) g(x) : a x b}. Prove that γ defines a metric on R([a, b], α) and that (R([a, b], α), γ)is a complete metric space.Problem 1.23. Let f n (f1,n , ., fk,n ) C(X; Rk ) be a sequence of functions. Prove that f n converges uniformly to g (g1 , ., gk ) if and only if foreach i, 1 i k, we have that fi,n converges uniformly to gi .Problem 1.24. Let fn : [0, 1] R be defined by fn (x) nx.1 n2 x2Useptwstandard results from calculus to prove that fn 0,R where 0 denotes the1function that is identically equal to 0 and that limn 0 fn (x)dx 0. Proveuor disprove that fn 0.1.3Uniform Convergence and DerivativesIn this section we look at one key theorem about the behaviour of derivativesunder the taking of uniform limits. Given a function f : (a, b) R we willsay that f is differentiable on (a,b) provided that it is differentiable ateach point x, a x b.Theorem 1.25. Let {fn } be a sequence of differentiable functions on (a, b).ptwuIf fn f and fn0 g on (a, b) then f is differentiable on (a, b), f 0 g,uand fn f.

14CHAPTER 1. SEQUENCES AND SERIES OF FUNCTIONSProof. Fix c, a c b and define(h(x) f (x) f (c),x cg(c),x 6 c.x cIf we can show that h is continuous at c, then that will show that f 0 (c) existsand is equal to g(c). If we let(fn (x) fn (c), x 6 cx c,hn (x) 0fn (c),x cthen since fn is differentiable, hn is continuous at c. We will prove that h iscontinuous at c by showing that the sequence {hn } converges uniformly toh.Given 0, we may choose N1 so that for n N1 , we have thatsup{ fn0 (x) g(x) : a x b} /3. Then for any m, n N1 , and any x0 (x) f 0 (x) f 0 (x) g(x) g(x) f 0 (x) 2 /3.we will have that fmnmnThus, applying the Mean Value Theorem, for any m, n N1 and x 6 c we will have a point x1 between x and c so that hm (x) hn (x) m (c) fn (c)) (fm (x) fn (x)) (f (fm fn )0 (x1 ) 2 /3. Thus, for x 6 c, wex chave that h(x) hn (x) limm hm (x) hn (x) 2 /3 .On the other hand, at the point c, we have that h(c) g(c) limn fn0 (c) limn hn (c). So we may choose N2 so that for n N2 , we have that h(c) hn (c) . Setting N max{N1 , N2 }, we have that for n N, and anya x b, h(x) hn (x) . This proves that the sequence {hn } convergesuniformly to h, which completes the proof that f 0 g.uTo see that fn f, given any δ 0, we may choose N1 so that forn N1 , hn (x) h(x) δ for all x, a x b. Substituting in the definitionsof these functions we see that (fn (x) fn (c)) (f (x) f (c)) δ x c ,and hence, fn (x) f (x) δ x c fn (c) f (c) .Now given 0, choose δ so that δ max{ b c , c a } /2 and takeptwthe corresponding N1 . Also, since fn f, we may choose N2 , so that for

Introduction to Real Analysis Spring 2014 Lecture Notes Vern I. Paulsen April 22, 2014

Related Documents:

work/products (Beading, Candles, Carving, Food Products, Soap, Weaving, etc.) ⃝I understand that if my work contains Indigenous visual representation that it is a reflection of the Indigenous culture of my native region. ⃝To the best of my knowledge, my work/products fall within Craft Council standards and expectations with respect to

1) Explain the term ‘Spring Boot’. It is a Spring module that offers Rapid Application Development to Spring framework. Spring module is used to create an application based on Spring framework which requires to configure few Spring files. 2) Mention some advantages of Spring Boot Here are som

asics of real-time PCR 1 1.1 Introduction 2 1.2 Overview of real-time PCR 3 1.3 Overview of real-time PCR components 4 1.4 Real-time PCR analysis technology 6 1.5 Real-time PCR fluorescence detection systems 10 1.6 Melting curve analysis 14 1.7 Passive reference dyes 15 1.8 Contamination prevention 16 1.9 Multiplex real-time PCR 16 1.10 Internal controls and reference genes 18

Real-Time Analysis 1EF77_3e Rohde & Schwarz Implementation of Real -Time Spectrum Analysis 3 1 Real-Time Analysis 1.1 What “Real-Time” Stands for in R&S Real-Time Analyzers The measurement speed available in today's spectrum analyzers is the result of a long

SX85/SX105 2008-2015 SX125 2004-2006 Shock Fork spring Shock spring Fork spring spring 43,2 63 Standard spring 38 59 Standard spring -425 3,4-220 35-505 4,2-250 72 Rider weight Rider weight 30-35 kg 2,8 AT REQ. 45-55 kg AT REQ. 63 35-40 kg 3,0 30 55-65 kg 3,8 66 40-45 kg 3,2 30 65-75 kg 4,0 69

Spring Volume 22 Number 3 Summer Volume 22 Number 3 Convention Volume 23 Number 1 1988 Winter Volume 23 Number 2 Spring Volume 23 Number 3 Summer . Spring Summer Fall 2015 Winter Spring Summer Fall 2016 Winter Spring Summer Fall 2017 Winter Spring Summer Fall 2018 Winter Spring Summer Fall . Author: Joan Thomas

13 Fri Commencement at 7:00 p.m. SPRING SEMESTER 2020 Jan 6 Mon Registration ends for all Spring terms (Spring, Spring 1, and Spring 2) 6 Mon Spring and Spring 1: Classes begin 13 Mon Application for Program Completion Opens -- May Completers 29 We

with which the spring pulls upward on the mass is given by Hooke’s law4 F ky (6) where k is the spring constant and y is the stretch in the spring when a force F is applied to the spring. The spring constant k is a measure of the sti ness of the spring. The spring constant can be determin