Thus f is continuous at x 0. Matthew Straughn Math 402 Homework 6
|
|
- Julia Richardson
- 5 years ago
- Views:
Transcription
1 Matthew Straughn Math 402 Homework 6 Homework 6 (p. 452) , , , (p. 455) * (p. 458) (p. 460) (p. 472) * Lemma 1. If (f (n) ) converges uniformly to some function f, then the sequence (of f (n) s) is uniformly Cauchy. Proof. Since f (n) f uniformly, we know that given ɛ 1 > 0 there exists N 1 > 0 such that d Y (f (n) (x), f(x)) < ɛ 1 for all n > N 1 and x X. So we also have d Y (f (m) (x), f(x)) < ɛ 1 for all m > N 1 and x X. So given ɛ > 0 take ɛ 1 /2 and N = N 1. Then we get that for all n, m > N and x X. d Y (f (n) (x), f (m) (x)) d Y (f (n) (x), f(x)) + d Y (f(x), f (m) (x)) < ɛ Hence (f (n) ) is uniformly Cauchy. Exercise Prove Proposition Proposition Suppose (f (n) ) is a sequence of functions from one metric space (X, d X ) to another (Y, d Y ), and suppose that this sequence converges uniformly to another function f : X Y. Let x 0 be a point in X. If the functions f (n) are continuous at x 0 for each n, then the limiting function f is also continuous at x 0. Proof. Since f (n) converges uniformly to f, we know that given ɛ > 0 there exists N > 0 such that d Y (f (n) (x), f(x)) < ɛ for all n > N and x X. Since f (n) is continuous at x 0 X we know that given ɛ > 0 there exists δ > 0 such that if d X (x, x 0 ) < δ then d Y (f (n) (x), f (n) (x 0 )) < ɛ So given ɛ > 0 take ɛ /3, ɛ /3 and δ = δ. If d X (x, x 0 ) < δ = δ, then d Y (f(x), f(x 0 )) d Y (f(x), f (n) (x)) + d Y (f (n) (x), f (n) (x 0 )) + d Y (f (n) (x 0 ), f(x 0 )) < ɛ/3 + ɛ/3 + ɛ/3 (by uniform convergence and continuity) Thus f is continuous at x 0. 1
2 Exercise Prove Proposition Proposition Let (X, d X ) and (Y, d Y ) be metric spaces, with Y complete, and let E be a subset of X. Let (f (n) ) be a sequence of functions from E to Y, and suppose that this sequence converges uniformly in E to some function f : E Y. Let x 0 X be an adherent point of E, and suppose that for each n the limit lim x x0 ;x E f (n) (x) exists. Then the limit lim x x0 ;x E f(x) also exists, and is equal to the limit of the sequence (lim x x0 ;x E f (n) (x)) ; in other words we have the interchange of limits lim n lim f (n) (x) = lim lim f (n) (x). x x 0 ;x E x x 0 ;x E n Proof. Suppose f (n) converges uniformly to f. That is, given ɛ 1 > 0 there exists N 1 > 0 such that d Y (f (n) (x), f(x)) < ɛ 1 for all n > N 1 and x X. Let x n x 0. And so suppose for each n that lim k f (n) (x k ) = L n. So we also have given ɛ 2 > 0 there exists N 2 > 0 such that d Y (f (n) (x k ), L n ) < ɛ 2 for all n > N 2 and x X. Now let us show that (L n ) is a Cauchy sequence. Given ɛ > 0 take ɛ 1 2 /4 and N = min(n 1, N 2 ). Then d Y (L n, L m ) d Y (L n, f (n) (x k )) + d Y (f (n) (x k ), f(x k )) + d Y (f(x k ), f (m) (x k )) + d Y (f (m) (x k ), L m ) < ɛ/4 + ɛ/4 + ɛ/4 + ɛ/4 So (L n ) is a Cauchy sequence, and since Y is complete we know that this sequence converges to, say, L 0. That is, given ɛ 3 > 0 there exists N 3 > 0 such that d Y (L n, L 0 ) < ɛ for all n > N 3. Now we will show that lim f(x k) = L 0 = lim lim f (n) (x k ) k n k Given ɛ > 0 take ɛ /3 and N = min(n 1, N 2, N 3 ). Then we get that As desired. d Y (f(x k ), L 0 ) d Y (f(x k ), f (n) (x k )) + d Y (f (n) (x k ), L n ) + d Y (L n, L 0 ) < ɛ/3 + ɛ/3 + ɛ/3 Exercise Compare Proposition with Example Can you now explain why the interchange of limits in Example led to a false statement, whereas the interchange of limits in Proposition is justified? Solution. You cannot change the limits in Example because the sequence of functions f (n) = x n does not converge uniformly on [0, 1], and hence does not contradict Proposition
3 Exercise Prove Proposition Proposition : Let (f (n) ) be a sequence of continuous functions from one metric space (X, d X ) to another (Y, d Y ), and suppose that this sequence converges uniformly to another function f : X Y. Let x (n) be a sequence of points in X which converge to some limit x. Then f (n) (x (n) ) converges to f(x). Proof. Let x (n) be a sequence that converges to x. By the continuity of the f (n) s we have that f (n) (x (m) ) f (n) (x) as m. That is, given ɛ 1 > 0 there exists N 1 > 0 such that d Y (f (n) (x (m) ), f (n) (x)) < ɛ 1 for all m > N 1. But since f (n) f uniformly we know given ɛ 2 > 0 there exists N 2 > 0 such that d Y (f (n) (x), f(x)) < ɛ 2 for all n > N 2 and x X. Given ɛ > 0 take ɛ 1 2 /3 and N = max{n 1, N 2 }. Then we have that d Y (f (n) (x (m) ), f (n) (x)) < ɛ/3 and d Y (f (n) (x), f(x)) < ɛ/3 for all m, n > N and x X. In particular we have that d Y (f (n) (x (m) ), f (n) (x (n) )) < ɛ/3. But by the triangle inequality we have: d Y (f (n) (x (n) ), f(x)) d Y (f (n) (x (n) ), f (n) (x (m) )) + d Y (f (n) (x (m) ), f (n) (x)) Thus f (n) (x (n) ) converges to f(x). + d Y (f (n) (x), f(x)) < ɛ for all n > N and x X. Exercise Give an example to show that Proposition fails if the phrase converges uniformly is replaced by converges pointwise. Solution. Take our good friend f (n) = x n where f (n) : ( 1, 1) R and converges pointwise to the zero function (f(x) = 0 for all x). And take a sequence in ( 1, 1) that converges to 1. Then the theorem states that f (n) (x (n) ) converges to f(1) = 0, but if we take the sequence x (n) = 1 1 n we get that f (n) (x (n) ) = (1 1 n )n e 1 0. Exercise Prove Proposition Proposition Let (f (n) ) be a sequence of functions from one metric space (X, d X ) to another (Y, d Y ), and suppose that this sequence converges uniformly to another function f : X Y. If the functions f (n) are bounded on X for each n, then the limiting function f is also bounded on X. Proof. Suppose that (f (n) ) is a Convergent sequence, to say f. Then from Lemma 1 we have that (f (n) ) is also uniformly Cauchy. That is, given ɛ > 0 there exists N > 0 such that d Y (f (n) (x), f(x)) < ɛ for all n > N and x X. And also that d Y (f (n) (x), f (m) (x)) < ɛ for all n, m > N and x X. Also suppose that for each n that f (n) is bounded. That is, there is some ball B (Y,dY )(y n, R n ) such that f (n) (x) B (Y,dY )(y n, R n ) for all x X. That is, d Y (f (n) (x), y n ) < R n for all x X. 3
4 But, d Y (f (m) (x), y n ) d Y (f (m) (x), f (n) (x)) + d Y (f (n) (x), y n ) < ɛ + R n Thus, f (m) (x) B (Y,dY )(y n, R n + ɛ) for all m > N and x X. Hence there exists N > 0 (same N as above) such that f (n) (x) B (Y,dY )(y n, R n + ɛ) for all n > N and x X. But, d Y (f(x), y n ) d Y (f(x), f (n) (x)) + d Y (f (n) (x), y n ) < ɛ + R n + ɛ = R n + 2ɛ So f(x) B (Y,dY )(y n, R n + 2ɛ) for all x X. Therefore f(x) is bounded on X. Exercise Give an example to show that Proposition fails if the phrase converges uniformly is replaced by converges pointwise. Solution. Consider the same example as in Exercise (c). That is, g (N) = N xn. Each of these is a finite sum and hence bounded. However, this sequence converges pointwise to g(x) = x 1 x which is not bounded on ( 1, 1). Exercise Let (X, d) be a metric space, and for every positive integer n, let f (n) : X R and g (n) : X R be functions. Suppose that (f (n) ) converges uniformly to another function f : X R, and that (g (n) ) converges uniformly to another function g : X R. Suppose also that the functions (f (n) ) and (g (n) ) are uniformly bounded. Prove that the functions f (n) g (n) : X R converge uniformly to fg : X R. Proof. Suppose that (f (n) ) converges uniformly to another function f : X R, and that (g (n) ) converges uniformly to another function g : X R That is, given ɛ > 0 there exists N > 0 such that f (n) (x) f(x) < ɛ and g (n) (x) g(x) < ɛ for all n > N and x X. Also suppose that the functions (f (n) ) and (g (n) ) are uniformly bounded. That is, there exists M > 0 such that f (n) (x) M and g (n) (x) M for all n 1 and x X. And hence from the previous exercise we know that f(x), g(x) M for all x X. (Note that I am being lazy and using the same M as above. This is not necessarily true, but we can take the max between the two M s and just call that M). Given ɛ > 0 take ɛ /M and choose N = N. Thus we have that f (n) (x) f(x) < ɛ = ɛ/m and g (n) (x) g(x) < ɛ /M for all n > N and x X. But, f (n) g (n) (x) fg(x) = f (n) g (n) (x) fg(x) + f (n) g(x) f (n) g(x) Thus f (n) g (n) fg uniformly. = f (n) (x)(g (n) (x) g(x)) + g(x)(f (n) (x) f(x)) f (n) (x) g (n) (x) g(x) + g(x) f (n) (x) f(x) M ɛ M + M ɛ M 4
5 Exercise Prove Theorem Theorem Let (X, d) be a metric space, and let (f (n) ) be a sequence of bounded real-valued continuous functions on X such that the series f (n) is convergent. Then the series f (n) converges uniformly to some function f on X, and that function f is also continuous. Proof. Let us show that N i=1 f (i) is a Cauchy sequence in C(X R). Since f (n) is convergent, we know that lim n f (n) = 0. That is, given ɛ > 0 there exists N > 0 such that f (n) < ɛ for all n > N. So, f (n) = sup{f (n) (x) : x X} < ɛ for all n > N. Given ɛ > 0 take ɛ = ɛ and N = N. Then n m n f (i) i=1 m f (i) = i=1 n i=m+1 f (i) n m sup{f (n) (x) : x X} ɛ < n m n m Note that we assumed n > m, but the same argument gives us the case n < m, and n = m is obvious. Thus, N i=1 f (i) is a Cauchy sequence in C(X R) (I did not state this earlier, but a finite sum of continuous and bounded functions is also continuous and bounded, so each term is in C(X R)). And now using Theorem we have that f (n) converges uniformly to some function f on X, and that function f is also continuous. Exercise Use Theorem to prove Corollary Theorem Let [a, b] be an interval, and for each integer n 1, let f (n) : [a, b] R be a Riemann-integrable function. Suppose f (n) converges uniformly on [a, b] to a function f : [a, b] R. Then f is also Riemann integrable, and lim n f (n) = Corollary Let [a, b] be an interval, and let (f (n) ) be a sequence of Riemann integrable functions on [a, b] such that the series f (n) is uniformly convergent. Then we have f (n) = f (n). f. 5
6 Proof. Let g (N) = N f (n). So we know that g (N) is Riemann integrable since each f (n) is Riemann integrable. Also g (N) f (n) = g, when N, and convergence is uniformy by assumption. Then from Theorem we have that So we have But, Thus, g = g = g = lim g (N) N N = lim f (n) N [ = lim f (1) + f (2) + + N = f (1) + f (2) + = f (n). f (n). f (n) f (n) = f (n). f (N) ] 6
Hence, (f(x) f(x 0 )) 2 + (g(x) g(x 0 )) 2 < ɛ
Matthew Straughn Math 402 Homework 5 Homework 5 (p. 429) 13.3.5, 13.3.6 (p. 432) 13.4.1, 13.4.2, 13.4.7*, 13.4.9 (p. 448-449) 14.2.1, 14.2.2 Exercise 13.3.5. Let (X, d X ) be a metric space, and let f
More informationMATH 140B - HW 5 SOLUTIONS
MATH 140B - HW 5 SOLUTIONS Problem 1 (WR Ch 7 #8). If I (x) = { 0 (x 0), 1 (x > 0), if {x n } is a sequence of distinct points of (a,b), and if c n converges, prove that the series f (x) = c n I (x x n
More informationMath 328 Course Notes
Math 328 Course Notes Ian Robertson March 3, 2006 3 Properties of C[0, 1]: Sup-norm and Completeness In this chapter we are going to examine the vector space of all continuous functions defined on the
More informationNotions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy
Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.
More informationMath 104: Homework 7 solutions
Math 04: Homework 7 solutions. (a) The derivative of f () = is f () = 2 which is unbounded as 0. Since f () is continuous on [0, ], it is uniformly continous on this interval by Theorem 9.2. Hence for
More informationconverges as well if x < 1. 1 x n x n 1 1 = 2 a nx n
Solve the following 6 problems. 1. Prove that if series n=1 a nx n converges for all x such that x < 1, then the series n=1 a n xn 1 x converges as well if x < 1. n For x < 1, x n 0 as n, so there exists
More informationMath 140A - Fall Final Exam
Math 140A - Fall 2014 - Final Exam Problem 1. Let {a n } n 1 be an increasing sequence of real numbers. (i) If {a n } has a bounded subsequence, show that {a n } is itself bounded. (ii) If {a n } has a
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More informationIntroductory Analysis I Fall 2014 Homework #9 Due: Wednesday, November 19
Introductory Analysis I Fall 204 Homework #9 Due: Wednesday, November 9 Here is an easy one, to serve as warmup Assume M is a compact metric space and N is a metric space Assume that f n : M N for each
More informationSummer Jump-Start Program for Analysis, 2012 Song-Ying Li
Summer Jump-Start Program for Analysis, 01 Song-Ying Li 1 Lecture 6: Uniformly continuity and sequence of functions 1.1 Uniform Continuity Definition 1.1 Let (X, d 1 ) and (Y, d ) are metric spaces and
More informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More informationHomework 11. Solutions
Homework 11. Solutions Problem 2.3.2. Let f n : R R be 1/n times the characteristic function of the interval (0, n). Show that f n 0 uniformly and f n µ L = 1. Why isn t it a counterexample to the Lebesgue
More informationFunctional Analysis HW #3
Functional Analysis HW #3 Sangchul Lee October 26, 2015 1 Solutions Exercise 2.1. Let D = { f C([0, 1]) : f C([0, 1])} and define f d = f + f. Show that D is a Banach algebra and that the Gelfand transform
More informationThe Heine-Borel and Arzela-Ascoli Theorems
The Heine-Borel and Arzela-Ascoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine- Borel theorem and the Arzela-Ascoli theorem. We prove them
More information1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N
Applied Analysis prelim July 15, 216, with solutions Solve 4 of the problems 1-5 and 2 of the problems 6-8. We will only grade the first 4 problems attempted from1-5 and the first 2 attempted from problems
More information4.6 Montel's Theorem. Robert Oeckl CA NOTES 7 17/11/2009 1
Robert Oeckl CA NOTES 7 17/11/2009 1 4.6 Montel's Theorem Let X be a topological space. We denote by C(X) the set of complex valued continuous functions on X. Denition 4.26. A topological space is called
More information1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),
Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer
More informationPrinciples of Real Analysis I Fall VII. Sequences of Functions
21-355 Principles of Real Analysis I Fall 2004 VII. Sequences of Functions In Section II, we studied sequences of real numbers. It is very useful to consider extensions of this concept. More generally,
More information9 Sequences of Functions
9 Sequences of Functions 9.1 Pointwise convergence and uniform convergence Let D R d, and let f n : D R be functions (n N). We may think of the functions f 1, f 2, f 3,... as forming a sequence of functions.
More informationAdvanced Calculus I Chapter 2 & 3 Homework Solutions October 30, Prove that f has a limit at 2 and x + 2 find it. f(x) = 2x2 + 3x 2 x + 2
Advanced Calculus I Chapter 2 & 3 Homework Solutions October 30, 2009 2. Define f : ( 2, 0) R by f(x) = 2x2 + 3x 2. Prove that f has a limit at 2 and x + 2 find it. Note that when x 2 we have f(x) = 2x2
More informationDefining the Integral
Defining the Integral In these notes we provide a careful definition of the Lebesgue integral and we prove each of the three main convergence theorems. For the duration of these notes, let (, M, µ) be
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 4.3.5, 4.3.7, 4.3.8, 4.3.9,
More informationMath 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1
Math 8B Solutions Charles Martin March 6, Homework Problems. Let (X i, d i ), i n, be finitely many metric spaces. Construct a metric on the product space X = X X n. Proof. Denote points in X as x = (x,
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationMcGill University Math 354: Honors Analysis 3
Practice problems McGill University Math 354: Honors Analysis 3 not for credit Problem 1. Determine whether the family of F = {f n } functions f n (x) = x n is uniformly equicontinuous. 1st Solution: The
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More information8 Further theory of function limits and continuity
8 Further theory of function limits and continuity 8.1 Algebra of limits and sandwich theorem for real-valued function limits The following results give versions of the algebra of limits and sandwich theorem
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. Determine whether the following statements are true or false. Justify your answer (i.e., prove the claim, derive a contradiction or give a counter-example). (a) (10
More informationMATH 426, TOPOLOGY. p 1.
MATH 426, TOPOLOGY THE p-norms In this document we assume an extended real line, where is an element greater than all real numbers; the interval notation [1, ] will be used to mean [1, ) { }. 1. THE p
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More informationCharacterisation of Accumulation Points. Convergence in Metric Spaces. Characterisation of Closed Sets. Characterisation of Closed Sets
Convergence in Metric Spaces Functional Analysis Lecture 3: Convergence and Continuity in Metric Spaces Bengt Ove Turesson September 4, 2016 Suppose that (X, d) is a metric space. A sequence (x n ) X is
More informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More informationMath 220A Fall 2007 Homework #7. Will Garner A
Math A Fall 7 Homework #7 Will Garner Pg 74 #13: Find the power series expansion of about ero and determine its radius of convergence Consider f( ) = and let ak f ( ) = k! k = k be its power series expansion
More informationAnalysis III Theorems, Propositions & Lemmas... Oh My!
Analysis III Theorems, Propositions & Lemmas... Oh My! Rob Gibson October 25, 2010 Proposition 1. If x = (x 1, x 2,...), y = (y 1, y 2,...), then is a distance. ( d(x, y) = x k y k p Proposition 2. In
More informationContinuous Functions on Metric Spaces
Continuous Functions on Metric Spaces Math 201A, Fall 2016 1 Continuous functions Definition 1. Let (X, d X ) and (Y, d Y ) be metric spaces. A function f : X Y is continuous at a X if for every ɛ > 0
More informationL p Functions. Given a measure space (X, µ) and a real number p [1, ), recall that the L p -norm of a measurable function f : X R is defined by
L p Functions Given a measure space (, µ) and a real number p [, ), recall that the L p -norm of a measurable function f : R is defined by f p = ( ) /p f p dµ Note that the L p -norm of a function f may
More informationNumerical Sequences and Series
Numerical Sequences and Series Written by Men-Gen Tsai email: b89902089@ntu.edu.tw. Prove that the convergence of {s n } implies convergence of { s n }. Is the converse true? Solution: Since {s n } is
More informationThe Arzelà-Ascoli Theorem
John Nachbar Washington University March 27, 2016 The Arzelà-Ascoli Theorem The Arzelà-Ascoli Theorem gives sufficient conditions for compactness in certain function spaces. Among other things, it helps
More informationLecture 5 - Hausdorff and Gromov-Hausdorff Distance
Lecture 5 - Hausdorff and Gromov-Hausdorff Distance August 1, 2011 1 Definition and Basic Properties Given a metric space X, the set of closed sets of X supports a metric, the Hausdorff metric. If A is
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. (a) (10 points) State the formal definition of a Cauchy sequence of real numbers. A sequence, {a n } n N, of real numbers, is Cauchy if and only if for every ɛ > 0,
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationM17 MAT25-21 HOMEWORK 6
M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
More informationPlaces of Number Fields and Function Fields MATH 681, Spring 2018
Places of Number Fields and Function Fields MATH 681, Spring 2018 From now on we will denote the field Z/pZ for a prime p more compactly by F p. More generally, for q a power of a prime p, F q will denote
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationMATH 202B - Problem Set 5
MATH 202B - Problem Set 5 Walid Krichene (23265217) March 6, 2013 (5.1) Show that there exists a continuous function F : [0, 1] R which is monotonic on no interval of positive length. proof We know there
More informationImmerse Metric Space Homework
Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps
More information3 Measurable Functions
3 Measurable Functions Notation A pair (X, F) where F is a σ-field of subsets of X is a measurable space. If µ is a measure on F then (X, F, µ) is a measure space. If µ(x) < then (X, F, µ) is a probability
More informationINTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES
INTRODUCTION TO REAL ANALYSIS II MATH 433 BLECHER NOTES. As in earlier classnotes. As in earlier classnotes (Fourier series) 3. Fourier series (continued) (NOTE: UNDERGRADS IN THE CLASS ARE NOT RESPONSIBLE
More informationLecture Notes on Metric Spaces
Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],
More information2. Metric Spaces. 2.1 Definitions etc.
2. Metric Spaces 2.1 Definitions etc. The procedure in Section for regarding R as a topological space may be generalized to many other sets in which there is some kind of distance (formally, sets with
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 4 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF pm, Campion Hall 302 Homework 4 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 2.6.3, 2.7.4, 2.7.5, 2.7.2,
More informationMath 172 Problem Set 5 Solutions
Math 172 Problem Set 5 Solutions 2.4 Let E = {(t, x : < x b, x t b}. To prove integrability of g, first observe that b b b f(t b b g(x dx = dt t dx f(t t dtdx. x Next note that f(t/t χ E is a measurable
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationMost Continuous Functions are Nowhere Differentiable
Most Continuous Functions are Nowhere Differentiable Spring 2004 The Space of Continuous Functions Let K = [0, 1] and let C(K) be the set of all continuous functions f : K R. Definition 1 For f C(K) we
More informationHomework 5 Solutions
Homework 5 Solutions ECS 0 (Fall 17) Patrice Koehl koehl@cs.ucdavis.edu ovember 1, 017 Exercise 1 a) Show that the following statement is true: If there exists a real number x such that x 4 +1 = 0, then
More informationDefinition 6.1. A metric space (X, d) is complete if every Cauchy sequence tends to a limit in X.
Chapter 6 Completeness Lecture 18 Recall from Definition 2.22 that a Cauchy sequence in (X, d) is a sequence whose terms get closer and closer together, without any limit being specified. In the Euclidean
More informationMath 209B Homework 2
Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact
More informationMath 341 Summer 2016 Midterm Exam 2 Solutions. 1. Complete the definitions of the following words or phrases:
Math 34 Summer 06 Midterm Exam Solutions. Complete the definitions of the following words or phrases: (a) A sequence (a n ) is called a Cauchy sequence if and only if for every ɛ > 0, there exists and
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationSelected solutions for Homework 9
Math 424 B / 574 B Due Wednesday, Dec 09 Autumn 2015 Selected solutions for Homework 9 This file includes solutions only to those problems we did not have time to cover in class. We need the following
More informationL p Spaces and Convexity
L p Spaces and Convexity These notes largely follow the treatments in Royden, Real Analysis, and Rudin, Real & Complex Analysis. 1. Convex functions Let I R be an interval. For I open, we say a function
More informationMath 61CM - Solutions to homework 6
Math 61CM - Solutions to homework 6 Cédric De Groote November 5 th, 2018 Problem 1: (i) Give an example of a metric space X such that not all Cauchy sequences in X are convergent. (ii) Let X be a metric
More informationReal Analysis. Joe Patten August 12, 2018
Real Analysis Joe Patten August 12, 2018 1 Relations and Functions 1.1 Relations A (binary) relation, R, from set A to set B is a subset of A B. Since R is a subset of A B, it is a set of ordered pairs.
More informationContinuity. Matt Rosenzweig
Continuity Matt Rosenzweig Contents 1 Continuity 1 1.1 Rudin Chapter 4 Exercises........................................ 1 1.1.1 Exercise 1............................................. 1 1.1.2 Exercise
More informationCHAPTER 1. Metric Spaces. 1. Definition and examples
CHAPTER Metric Spaces. Definition and examples Metric spaces generalize and clarify the notion of distance in the real line. The definitions will provide us with a useful tool for more general applications
More informationA lower bound for X is an element z F such that
Math 316, Intro to Analysis Completeness. Definition 1 (Upper bounds). Let F be an ordered field. For a subset X F an upper bound for X is an element y F such that A lower bound for X is an element z F
More informationLEBESGUE INTEGRATION. Introduction
LEBESGUE INTEGATION EYE SJAMAA Supplementary notes Math 414, Spring 25 Introduction The following heuristic argument is at the basis of the denition of the Lebesgue integral. This argument will be imprecise,
More informationMATH 23b, SPRING 2005 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Midterm (part 1) Solutions March 21, 2005
MATH 23b, SPRING 2005 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Midterm (part 1) Solutions March 21, 2005 1. True or False (22 points, 2 each) T or F Every set in R n is either open or closed
More informationLecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University
Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................
More informationExercise 2. Prove that [ 1, 1] is the set of all the limit points of ( 1, 1] = {x R : 1 <
Math 316, Intro to Analysis Limits of functions We are experts at taking limits of sequences as the indexing parameter gets close to infinity. What about limits of functions as the independent variable
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More informationSequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.
Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence
More informationPROBLEMS. (b) (Polarization Identity) Show that in any inner product space
1 Professor Carl Cowen Math 54600 Fall 09 PROBLEMS 1. (Geometry in Inner Product Spaces) (a) (Parallelogram Law) Show that in any inner product space x + y 2 + x y 2 = 2( x 2 + y 2 ). (b) (Polarization
More informationMAT 771 FUNCTIONAL ANALYSIS HOMEWORK 3. (1) Let V be the vector space of all bounded or unbounded sequences of complex numbers.
MAT 771 FUNCTIONAL ANALYSIS HOMEWORK 3 (1) Let V be the vector space of all bounded or unbounded sequences of complex numbers. (a) Define d : V V + {0} by d(x, y) = 1 ξ j η j 2 j 1 + ξ j η j. Show that
More informationMath LM (24543) Lectures 02
Math 32300 LM (24543) Lectures 02 Ethan Akin Office: NAC 6/287 Phone: 650-5136 Email: ethanakin@earthlink.net Spring, 2018 Contents Continuity, Ross Chapter 3 Uniform Continuity and Compactness Connectedness
More informationMath 410 Homework 6 Due Monday, October 26
Math 40 Homework 6 Due Monday, October 26. Let c be any constant and assume that lim s n = s and lim t n = t. Prove that: a) lim c s n = c s We talked about these in class: We want to show that for all
More informationSection 21. The Metric Topology (Continued)
21. The Metric Topology (cont.) 1 Section 21. The Metric Topology (Continued) Note. In this section we give a number of results for metric spaces which are familar from calculus and real analysis. We also
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationSummer Jump-Start Program for Analysis, 2012 Song-Ying Li. 1 Lecture 7: Equicontinuity and Series of functions
Summer Jump-Start Program for Analysis, 0 Song-Ying Li Lecture 7: Equicontinuity and Series of functions. Equicontinuity Definition. Let (X, d) be a metric space, K X and K is a compact subset of X. C(K)
More informationLines, parabolas, distances and inequalities an enrichment class
Lines, parabolas, distances and inequalities an enrichment class Finbarr Holland 1. Lines in the plane A line is a particular kind of subset of the plane R 2 = R R, and can be described as the set of ordered
More informationProblem List MATH 5143 Fall, 2013
Problem List MATH 5143 Fall, 2013 On any problem you may use the result of any previous problem (even if you were not able to do it) and any information given in class up to the moment the problem was
More informationHomework 1 Solutions
MATH 171 Spring 2016 Problem 1 Homework 1 Solutions (If you find any errors, please send an e-mail to farana at stanford dot edu) Presenting your arguments in steps, using only axioms of an ordered field,
More informationSolution of the 8 th Homework
Solution of the 8 th Homework Sangchul Lee December 8, 2014 1 Preinary 1.1 A simple remark on continuity The following is a very simple and trivial observation. But still this saves a lot of words in actual
More informationINTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES
INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES You will be expected to reread and digest these typed notes after class, line by line, trying to follow why the line is true, for example how it
More informationMath 5051 Measure Theory and Functional Analysis I Homework Assignment 3
Math 551 Measure Theory and Functional Analysis I Homework Assignment 3 Prof. Wickerhauser Due Monday, October 12th, 215 Please do Exercises 3*, 4, 5, 6, 8*, 11*, 17, 2, 21, 22, 27*. Exercises marked with
More informationIntroduction to Functional Analysis
Introduction to Functional Analysis Carnegie Mellon University, 21-640, Spring 2014 Acknowledgements These notes are based on the lecture course given by Irene Fonseca but may differ from the exact lecture
More informationMA2223 Tutorial solutions Part 1. Metric spaces
MA2223 Tutorial solutions Part 1. Metric spaces T1 1. Show that the function d(,y) = y defines a metric on R. The given function is symmetric and non-negative with d(,y) = 0 if and only if = y. It remains
More informationCLASS NOTES FOR APRIL 14, 2000
CLASS NOTES FOR APRIL 14, 2000 Announcement: Section 1.2, Questions 3,5 have been deferred from Assignment 1 to Assignment 2. Section 1.4, Question 5 has been dropped entirely. 1. Review of Wednesday class
More informationMath 117: Infinite Sequences
Math 7: Infinite Sequences John Douglas Moore November, 008 The three main theorems in the theory of infinite sequences are the Monotone Convergence Theorem, the Cauchy Sequence Theorem and the Subsequence
More information,... We would like to compare this with the sequence y n = 1 n
Example 2.0 Let (x n ) n= be the sequence given by x n = 2, i.e. n 2, 4, 8, 6,.... We would like to compare this with the sequence = n (which we know converges to zero). We claim that 2 n n, n N. Proof.
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationMath 421, Homework #7 Solutions. We can then us the triangle inequality to find for k N that (x k + y k ) (L + M) = (x k L) + (y k M) x k L + y k M
Math 421, Homework #7 Solutions (1) Let {x k } and {y k } be convergent sequences in R n, and assume that lim k x k = L and that lim k y k = M. Prove directly from definition 9.1 (i.e. don t use Theorem
More informationChapter 5. Measurable Functions
Chapter 5. Measurable Functions 1. Measurable Functions Let X be a nonempty set, and let S be a σ-algebra of subsets of X. Then (X, S) is a measurable space. A subset E of X is said to be measurable if
More informationOverview of normed linear spaces
20 Chapter 2 Overview of normed linear spaces Starting from this chapter, we begin examining linear spaces with at least one extra structure (topology or geometry). We assume linearity; this is a natural
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 7 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 7 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 4.2.1, 4.2.3, 4.2.6, 4.2.8,
More information(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition.
Math 231 Exam Practice Problem Solutions WARNING: This is not a sample test. Problems on the exams may or may not be similar to these problems. These problems are just intended to focus your study of the
More informationMetric Spaces Math 413 Honors Project
Metric Spaces Math 413 Honors Project 1 Metric Spaces Definition 1.1 Let X be a set. A metric on X is a function d : X X R such that for all x, y, z X: i) d(x, y) = d(y, x); ii) d(x, y) = 0 if and only
More information