Analysis Part 1. 1 Chapter Q1(q) 1.2 Q1(r) Book: Measure and Integral by Wheeden and Zygmund
|
|
- Morgan Turner
- 6 years ago
- Views:
Transcription
1 Analysis Part 1 Book: Measure and Integral by Wheeden and Zygmund 1 Chapter Q1(q) Let {T x k } be a sequence of points of T E. Since E is compact, {x k } has a subsequence {x kl } that converges to some x E. By continuity of T, lim T x k l = T x T E. l Thus {T x kl } is a subsequence of {T x k } that converges to T x T E, so T E is compact. 1.2 Q1(r) We are using notation in the book (pg 13), so R Γ = N k=1 f(ξ k)v(i k ), U Γ = N k=1 [sup x I k f(x)]v(i k ), etc. ( = ) Assume A = (R) f(x) dx exists. Given ɛ > 0, there exists δ > 0 I such that A R Γ < ɛ 2 for any Γ and any chosen {ξ k }, provided that Γ < δ. 1
2 By definition of supremum, there exists ξ k I k such that Thus Hence R Γ = > f(ξ k ) > sup f(x) ɛ x I k 2v(I). N f(ξ k )v(i k ) k=1 N N ɛ sup f(x)v(i k ) ( v(i k )) x I k 2v(I) k=1 = U Γ ɛ 2. k=1 U Γ A = U Γ R Γ + R Γ A < ɛ 2 + ɛ 2 = ɛ. Note that inf Γ <δ U Γ = inf Γ U Γ. This is clear once we note that any partition Γ has a refinement Γ with Γ < δ, and that U Γ U Γ for any refinement Γ of Γ. This implies A inf Γ U Γ ɛ. Since ɛ > 0 is arbitrary, we have A inf Γ U Γ. Similarly, we can show A sup Γ L Γ. Since L Γ U Γ, we have sup Γ L Γ inf Γ U Γ. Combined with the previous inequalities, this gives inf Γ U Γ = sup Γ L Γ = A. ( = ) Assume inf Γ U Γ = sup Γ L Γ = A. By definition of inf and sup, there exists a partition P 1 such that U P1 < A + ɛ/4, and a partition P 2 such that L P2 > A ɛ/4. Letting P to be the common refinement of P 1, P 2, we get a partition P such that U P L P < ɛ/2. Denote P = {I k } N k=1. We want to find a δ > 0 such that A R Γ < ɛ whenever Γ < δ. Note that it suffices to show that U Γ L Γ < ɛ instead. 2
3 Choose δ = ɛ 4M I k, where I k denotes the total area of the union of common boundaries of the intervals I k. For instance in dimension n = 1, I k = N 1. Let Γ = {J k } be a partition with Γ < δ. We split the sum according to whether J k I j for some j. U Γ L Γ = J k I j I j for some j (sup (sup f inf I j J k f inf f)v(j k ) + J k J k I j j I j f)v(i j ) + U P L P + 2Mδ I k < ɛ/2 + ɛ/2. The second last inequality J k I j J k I j j 2Mv(J k ) (sup J k f inf J k f)v(j k ) j 2Mv(J k) 2Mδ I k is due to the fact that the intervals J k I j (for all j) are precisely the intervals J k that intersect the boundary of some I j so the total volume J k I j j v(j k) is bounded above by δ I k. 1.3 Q4(a) First we show sup k j ( a k ) = inf k j (a k ) for all j. By definition of inf, inf k j (a k ) a k for all k j. Thus inf k j (a k ) a k. Since sup is the least upper bound, sup k j ( a k ) inf k j (a k ). Similarly, by noting that sup k j ( a k ) a k for all k j, we can show sup k j ( a k ) inf k j (a k ). Taking limits as j, we get lim sup( a k ) = lim sup j k j ( a k ) = lim inf (a j k) = lim inf (a k). k j 3
4 Q4(b) If the right hand side has the form + or ( ) + ( ), the inequality clearly holds. Assume that the expression on the right does not have the form + ( ) or +. gives Q4(c) Then, sup k j (a k +b k ) sup k j (a k )+sup k j (b k ). Taking limits as j lim sup(a k + b k ) lim sup(a k ) + lim sup(b k ). For k j, we have 0 a k sup k j a k < and 0 b k sup k j b k <. Thus, a k b k (sup k j a k )(sup k j b k ) for all k j. It follows that sup k j (a k b k ) (sup k j a k )(sup b k ). k j Note that lim j (sup k j a k ) exists since sup k j a k is a decreasing and bounded sequence. Similarly, lim j (sup k j b k ) exists. Taking limits as j, we get lim sup (a k b k ) (lim sup a k )(lim sup b k ). Q4(d) Consider a k = {0, 1, 0, 1,... }, b k = {1, 0, 1, 0,... }. Then lim sup (a k + b k ) = 1, and lim sup a k +lim sup b k = 1+1 = 2. Also, lim sup (a k b k ) = 0, and (lim sup a k )(lim sup b k ) = (1)(1) = 1. WLOG, suppose {a k } converges to a. Let b = lim sup b k. Using Theorem 1.4, there is a subsequence {b kj } of {b k } that converges to b. Then, a kj + b kj a + b as j. Let ɛ > 0. There exists K 1 such that b k < b + ɛ/2 for K K 1. There exists K 2 such that a k < a + ɛ/2 for k K 2. Thus if K = max{k 1, K 2 }, a k + b k < a + b + ɛ 4
5 for k K. By Theorem 1.4, this means lim sup a k + lim sup b k = a + b = lim sup(a k + b k ). For given ɛ > 0, there exists N N such that for all k N, a ɛ < a k < a + ɛ. For k j N, sup k j (a k + b k ) (a ɛ) sup k j b k. Taking limits as j gives lim sup(a k b k ) (a ɛ) lim sup b k. Since ɛ > 0 is arbitrary and lim sup b k is bounded, lim sup (a k b k ) (lim sup Along with part (c), this gives equality. a k )(lim sup b k ). 1.4 Q15 ( = ) Assume that bounded f is Riemann integrable on I, and A = (R) I f(x) dx. By Exercise 1(r), inf Γ U Γ = sup Γ = A. There exists a partition Γ 1 such that U Γ1 < A + ɛ/2, and a partition Γ 2 such that L Γ2 > A ɛ/2. Let Γ be the common refinement of Γ 1 and Γ 2. Note that U Γ U Γ1 and L Γ L Γ2. Hence 0 U Γ L Γ U Γ1 L Γ2 < A + ɛ/2 (A ɛ/2) = ɛ. ( = ) Assume that 0 U Γ L Γ < ɛ for some partition Γ of I. Then inf Γ U Γ sup L Γ U Γ L Γ < ɛ. Γ Since ɛ > 0 is arbitrary, thus inf Γ U Γ = sup Γ L Γ. By Exercise 1(r), this means that f is integrable. 5
6 1.5 Q16 By uniform convergence of {f k }, there exists N N such that whenever k N, f k (x) f(x) < ɛ 4v(I) for all x I. This also implies that f is bounded. By Exercise 15, for each k there is a partition Γ k = {I j } N k j=1 of I such that 0 U Γk (f k ) L Γk (f k ) < ɛ 2, where U Γk (f k ) := N k j=1 [sup x I j f k (x)]v(i j ), L Γk (f k ) := N k j=1 [inf x I j f k (x)]v(i j ). When k N, N k U Γk (f) L Γk (f) gives j=1 [sup x I j f k (x) + ɛ 4v(I) ]v(i j) = (U Γk (f k ) + ɛ 4 ) (L Γ k (f k ) ɛ 4 ) < ɛ 2 + ɛ 2. N k j=1 Thus by Exercise 15, f is Riemann integrable on I. For k N, and any partition Γ = {I j }, R Γ (f k ) R Γ (f) = < [ inf x I j f k (x) N [f k (ξ j ) f(ξ j )]v(i j ) j=1 N f k (ξ j ) f(ξ j ) v(i j ) j=1 N ɛ ( 4v(I) )v(i j) j=1 = ɛ 4. ɛ 4v(I) ]v(i j) Since f k and f are both Riemann integrable, taking limits as Γ 0 (R) f k (x) dx (R) f(x) dx ɛ I I 4. 6
7 This shows that (R) f I k(x) dx (R) f(x) dx. I 1.6 Q18 F c is open, hence it can be written as a countable union of disjoint open intervals. Write F c = (a i, b i ), where a i < b i. We may assume (a i, b i ) (, ), as that means F =, for which the statement is trivially true. Define f(x), if x F b i x b g(x) = i a i f(a i ) + x a i b i a i f(b i ), if x / F and x (a i, b i ), with a i, b i finite f(b i ), if x (, b i ) f(a i ), if x (a i, ). In short, g = f on F, and is the straight line segment connecting f(a i ) and f(b i ) on (a i, b i ). Thus g is clearly continuous on (, + ). If f(x) M for x F, then our constructed g also satisfies g(x) M for < x < +. 2 Chapter Q (i) Let V [f; a, b] = sup Γ S Γ M. Let x (a, b). Consider the partition Γ = {a, x, b}. Then f(x) f(a) f(x) f(a) + f(b) f(x) = S Γ sup S Γ M. Γ This implies f(a) M f(x) f(a) + M so f is bounded. 7
8 2.1.2 (ii) For any partition Γ = {x 0, x 1,..., x m }, S Γ (cf) = cf(x i ) cf(x i 1 ) = c S Γ (f). Taking sup over all partitions Γ, we get V (cf) = c V (f) <. S Γ (f + g) = f(x i ) + g(x i ) f(x i 1 ) g(x i 1 ) f(x i ) f(x i 1 ) + = S Γ (f) + S Γ (g). g(x i ) g(x i 1 ) Thus, V (f + g) V (f) + V (g) <. By part (i), let f(x) M f, g(x) M g on [a, b]. S Γ (fg) = f(x i )g(x i ) f(x i 1 )g(x i ) + f(x i 1 )g(x i ) f(x i 1 )g(x i 1 ) g(x i ) f(x i ) f(x i 1 ) + M g S Γ (f) + M f S Γ (g). f(x i 1 ) g(x i ) g(x i 1 ) Thus, V (fg) M g V (f) + M f V (g) <. 8
9 Assume there exists ɛ > 0 such that g(x) ɛ for x [a, b]. Note that 1 1. g(x) ɛ S Γ ( f m g ) = f(x i ) g(x i ) f(x i 1) g(x i 1 ) f(x i )g(x i 1 ) f(x i 1 )g(x i ) f(x i 1 )g(x i 1 ) + f(x i 1 )g(x i 1 ) g(x i )g(x i 1 ) 1 ɛ 2 Hence 2.2 Q5 m g(x i 1 ) f(x i ) f(x i 1 ) + 1 ɛ 2 M g ɛ 2 S Γ(f) + M f ɛ 2 S Γ(g). m V ( f g ) M g ɛ V (f) + M f V (g) <. 2 ɛ2 f(x i 1 ) g(x i ) g(x i 1 ) For any x (a, b], f is of bounded variation on (x, b]. By considering Γ = {x, b}, we see that f(b) f(x) M, which implies f(x) f(b) + M. Thus Next, let Γ = {a = x 0, x 1,..., x n = b} be any partition of [a, b]. Then S Γ [a, b] = f(x 1 ) f(a) + n f(x i ) f(x i 1 ) i=2 f(x 1 ) + f(a) + V [x 1, b] f(a) + f(b) + 2M. V [a, b] = sup[a, b] f(a) + f(b) + 2M <. Γ No, it is not necessary that V [f; a, b] M. Consider 0, x = a f(x) = 1, a < x b. 9
10 Note that V [f; a + ɛ, b] = 0 1 for any 0 < ɛ < b a. However 2 V [f; a, b] = 1 > 1. 2 The additional assumption that f is right continuous at a will ensure V [f; a, b] M. By right continuity, for any given γ > 0, there exists δ > 0 such that for all x < a + δ, f(x) f(a) < γ. For any partition Γ = {a = x 0, x 1,..., x n = b} with x 1 < a + δ, S Γ = f(x 1 ) f(a) + n f(x i ) f(x i 1 ) < γ + V [x 1, b] γ + M. i=2 For partitions Γ that do not satisfy x 1 < a+δ, we can always refine it (e.g. by adding the point a + δ/2) so that the refinement Γ satisfies x 1 < a + δ. Then S Γ S Γ γ + M. Thus V [f; a, b] = sup S Γ γ + M. Γ Since γ > 0 is arbitrary, V [f; a, b] M. 10
REAL VARIABLES: PROBLEM SET 1. = x limsup E k
REAL VARIABLES: PROBLEM SET 1 BEN ELDER 1. Problem 1.1a First let s prove that limsup E k consists of those points which belong to infinitely many E k. From equation 1.1: limsup E k = E k For limsup E
More informationh(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote
Real Variables, Fall 4 Problem set 4 Solution suggestions Exercise. Let f be of bounded variation on [a, b]. Show that for each c (a, b), lim x c f(x) and lim x c f(x) exist. Prove that a monotone function
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 informationTHEOREMS, ETC., FOR MATH 515
THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every
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 informationABSTRACT INTEGRATION CHAPTER ONE
CHAPTER ONE ABSTRACT INTEGRATION Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Suggestions and errors are invited and can be mailed
More informationProblem set 1, Real Analysis I, Spring, 2015.
Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n
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 informationLogical Connectives and Quantifiers
Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationMATH5011 Real Analysis I. Exercise 1 Suggested Solution
MATH5011 Real Analysis I Exercise 1 Suggested Solution Notations in the notes are used. (1) Show that every open set in R can be written as a countable union of mutually disjoint open intervals. Hint:
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 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 informationIndeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )
Lebesgue Measure The idea of the Lebesgue integral is to first define a measure on subsets of R. That is, we wish to assign a number m(s to each subset S of R, representing the total length that S takes
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 information2 Lebesgue integration
2 Lebesgue integration 1. Let (, A, µ) be a measure space. We will always assume that µ is complete, otherwise we first take its completion. The example to have in mind is the Lebesgue measure on R n,
More informationChapter 6. Integration. 1. Integrals of Nonnegative Functions. a j µ(e j ) (ca j )µ(e j ) = c X. and ψ =
Chapter 6. Integration 1. Integrals of Nonnegative Functions Let (, S, µ) be a measure space. We denote by L + the set of all measurable functions from to [0, ]. Let φ be a simple function in L +. Suppose
More informationElementary Analysis Math 140D Fall 2007
Elementary Analysis Math 140D Fall 2007 Bernard Russo Contents 1 Friday September 28, 2007 1 1.1 Course information............................ 1 1.2 Outline of the course........................... 1
More information1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.
1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty. Let E be a subset of R. We say that E is bounded above if there exists a real number U such that x U for
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 informationREAL AND COMPLEX ANALYSIS
REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any
More informationSolutions to Problem Set 5 for , Fall 2007
Solutions to Problem Set 5 for 18.101, Fall 2007 1 Exercise 1 Solution For the counterexample, let us consider M = (0, + ) and let us take V = on M. x Let W be the vector field on M that is identically
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 informationMATH NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS
MATH. 4433. NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS TOMASZ PRZEBINDA. Final project, due 0:00 am, /0/208 via e-mail.. State the Fundamental Theorem of Algebra. Recall that a subset K
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 informationLebesgue Integration: A non-rigorous introduction. What is wrong with Riemann integration?
Lebesgue Integration: A non-rigorous introduction What is wrong with Riemann integration? xample. Let f(x) = { 0 for x Q 1 for x / Q. The upper integral is 1, while the lower integral is 0. Yet, the function
More information1 Definition of the Riemann integral
MAT337H1, Introduction to Real Analysis: notes on Riemann integration 1 Definition of the Riemann integral Definition 1.1. Let [a, b] R be a closed interval. A partition P of [a, b] is a finite set of
More informationReal Analysis - Notes and After Notes Fall 2008
Real Analysis - Notes and After Notes Fall 2008 October 29, 2008 1 Introduction into proof August 20, 2008 First we will go through some simple proofs to learn how one writes a rigorous proof. Let start
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationSOLUTIONS TO SOME PROBLEMS
23 FUNCTIONAL ANALYSIS Spring 23 SOLUTIONS TO SOME PROBLEMS Warning:These solutions may contain errors!! PREPARED BY SULEYMAN ULUSOY PROBLEM 1. Prove that a necessary and sufficient condition that the
More informationProblem set 5, Real Analysis I, Spring, otherwise. (a) Verify that f is integrable. Solution: Compute since f is even, 1 x (log 1/ x ) 2 dx 1
Problem set 5, Real Analysis I, Spring, 25. (5) Consider the function on R defined by f(x) { x (log / x ) 2 if x /2, otherwise. (a) Verify that f is integrable. Solution: Compute since f is even, R f /2
More informationChapter 3 Continuous Functions
Continuity is a very important concept in analysis. The tool that we shall use to study continuity will be sequences. There are important results concerning the subsets of the real numbers and the continuity
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 informationReview of measure theory
209: Honors nalysis in R n Review of measure theory 1 Outer measure, measure, measurable sets Definition 1 Let X be a set. nonempty family R of subsets of X is a ring if, B R B R and, B R B R hold. bove,
More informationFIRST YEAR CALCULUS W W L CHEN
FIRST YER CLCULUS W W L CHEN c W W L Chen, 994, 28. This chapter is available free to all individuals, on the understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
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 informationMATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE
MATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE SEBASTIEN VASEY These notes describe the material for November 26, 2018 (while similar content is in Abbott s book, the presentation here is different).
More informationLecture 8. Q = [a 1, b 1 ] [a n, b n ], (3.10) width(q) = sup(b i a i ). (3.12) i. from which we define the lower and upper Riemann sums,
Lecture 8 3.2 iemann Integral of Several Variables Last time we defined the iemann integral for one variable, and today we generalize to many variables. Definition 3.3. A rectangle is a subset of n of
More information+ 2x sin x. f(b i ) f(a i ) < ɛ. i=1. i=1
Appendix To understand weak derivatives and distributional derivatives in the simplest context of functions of a single variable, we describe without proof some results from real analysis (see [7] and
More informationBootcamp. Christoph Thiele. Summer As in the case of separability we have the following two observations: Lemma 1 Finite sets are compact.
Bootcamp Christoph Thiele Summer 212.1 Compactness Definition 1 A metric space is called compact, if every cover of the space has a finite subcover. As in the case of separability we have the following
More informationThe Lebesgue Integral
The Lebesgue Integral Brent Nelson In these notes we give an introduction to the Lebesgue integral, assuming only a knowledge of metric spaces and the iemann integral. For more details see [1, Chapters
More informationRelationship Between Integration and Differentiation
Relationship Between Integration and Differentiation Fundamental Theorem of Calculus Philippe B. Laval KSU Today Philippe B. Laval (KSU) FTC Today 1 / 16 Introduction In the previous sections we defined
More informationAustin Mohr Math 704 Homework 6
Austin Mohr Math 704 Homework 6 Problem 1 Integrability of f on R does not necessarily imply the convergence of f(x) to 0 as x. a. There exists a positive continuous function f on R so that f is integrable
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 informationConvex Analysis and Optimization Chapter 2 Solutions
Convex Analysis and Optimization Chapter 2 Solutions Dimitri P. Bertsekas with Angelia Nedić and Asuman E. Ozdaglar Massachusetts Institute of Technology Athena Scientific, Belmont, Massachusetts http://www.athenasc.com
More informationExercise 1. Let f be a nonnegative measurable function. Show that. where ϕ is taken over all simple functions with ϕ f. k 1.
Real Variables, Fall 2014 Problem set 3 Solution suggestions xercise 1. Let f be a nonnegative measurable function. Show that f = sup ϕ, where ϕ is taken over all simple functions with ϕ f. For each n
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationLebesgue measure and integration
Chapter 4 Lebesgue measure and integration If you look back at what you have learned in your earlier mathematics courses, you will definitely recall a lot about area and volume from the simple formulas
More informationG1CMIN Measure and Integration
G1CMIN Measure and Integration 2003-4 Prof. J.K. Langley May 13, 2004 1 Introduction Books: W. Rudin, Real and Complex Analysis ; H.L. Royden, Real Analysis (QA331). Lecturer: Prof. J.K. Langley (jkl@maths,
More informationTopology Part of the Qualify Exams of Department of Mathematics, Texas A&M University Prepared by Zhang, Zecheng
Topology Part of the Qualify Exams of Department of Mathematics, Texas A&M University Prepared by Zhang, Zecheng Remark 0.1. This is a solution Manuel to the topology questions of the Topology Geometry
More informationExercises from other sources REAL NUMBERS 2,...,
Exercises from other sources REAL NUMBERS 1. Find the supremum and infimum of the following sets: a) {1, b) c) 12, 13, 14, }, { 1 3, 4 9, 13 27, 40 } 81,, { 2, 2 + 2, 2 + 2 + } 2,..., d) {n N : n 2 < 10},
More informationMTH 404: Measure and Integration
MTH 404: Measure and Integration Semester 2, 2012-2013 Dr. Prahlad Vaidyanathan Contents I. Introduction....................................... 3 1. Motivation................................... 3 2. The
More informationMATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals
MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real
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 informationMEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich
MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 9 September 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014.
More information1 Measurable Functions
36-752 Advanced Probability Overview Spring 2018 2. Measurable Functions, Random Variables, and Integration Instructor: Alessandro Rinaldo Associated reading: Sec 1.5 of Ash and Doléans-Dade; Sec 1.3 and
More informationMAT 257, Handout 13: December 5-7, 2011.
MAT 257, Handout 13: December 5-7, 2011. The Change of Variables Theorem. In these notes, I try to make more explicit some parts of Spivak s proof of the Change of Variable Theorem, and to supply most
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 informationIowa State University. Instructor: Alex Roitershtein Summer Homework #5. Solutions
Math 50 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 205 Homework #5 Solutions. Let α and c be real numbers, c > 0, and f is defined
More informationMeasure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond
Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................
More informationWalker Ray Econ 204 Problem Set 3 Suggested Solutions August 6, 2015
Problem 1. Take any mapping f from a metric space X into a metric space Y. Prove that f is continuous if and only if f(a) f(a). (Hint: use the closed set characterization of continuity). I make use of
More informationM2PM1 Analysis II (2008) Dr M Ruzhansky List of definitions, statements and examples Preliminary version
M2PM1 Analysis II (2008) Dr M Ruzhansky List of definitions, statements and examples Preliminary version Chapter 0: Some revision of M1P1: Limits and continuity This chapter is mostly the revision of Chapter
More informationIntroduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION
Introduction to Proofs in Analysis updated December 5, 2016 By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Purpose. These notes intend to introduce four main notions from
More informationAnalysis III. Exam 1
Analysis III Math 414 Spring 27 Professor Ben Richert Exam 1 Solutions Problem 1 Let X be the set of all continuous real valued functions on [, 1], and let ρ : X X R be the function ρ(f, g) = sup f g (1)
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 information5 Integration with Differential Forms The Poincare Lemma Proper Maps and Degree Topological Invariance of Degree...
Contents 1 Review of Topology 3 1.1 Metric Spaces............................... 3 1.2 Open and Closed Sets.......................... 3 1.3 Metrics on R n............................... 4 1.4 Continuity.................................
More informationvan Rooij, Schikhof: A Second Course on Real Functions
vanrooijschikhofproblems.tex December 5, 2017 http://thales.doa.fmph.uniba.sk/sleziak/texty/rozne/pozn/books/ van Rooij, Schikhof: A Second Course on Real Functions Some notes made when reading [vrs].
More informationMATHS 730 FC Lecture Notes March 5, Introduction
1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists
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 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 informationSupplementary Notes for W. Rudin: Principles of Mathematical Analysis
Supplementary Notes for W. Rudin: Principles of Mathematical Analysis SIGURDUR HELGASON In 8.00B it is customary to cover Chapters 7 in Rudin s book. Experience shows that this requires careful planning
More information4th Preparation Sheet - Solutions
Prof. Dr. Rainer Dahlhaus Probability Theory Summer term 017 4th Preparation Sheet - Solutions Remark: Throughout the exercise sheet we use the two equivalent definitions of separability of a metric space
More informationMath General Topology Fall 2012 Homework 6 Solutions
Math 535 - General Topology Fall 202 Homework 6 Solutions Problem. Let F be the field R or C of real or complex numbers. Let n and denote by F[x, x 2,..., x n ] the set of all polynomials in n variables
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 informationFRACTAL GEOMETRY, DYNAMICAL SYSTEMS AND CHAOS
FRACTAL GEOMETRY, DYNAMICAL SYSTEMS AND CHAOS MIDTERM SOLUTIONS. Let f : R R be the map on the line generated by the function f(x) = x 3. Find all the fixed points of f and determine the type of their
More informationWe say that the function f obtains a maximum value provided that there. We say that the function f obtains a minimum value provided that there
Math 311 W08 Day 10 Section 3.2 Extreme Value Theorem (It s EXTREME!) 1. Definition: For a function f: D R we define the image of the function to be the set f(d) = {y y = f(x) for some x in D} We say that
More informationSuppose R is an ordered ring with positive elements P.
1. The real numbers. 1.1. Ordered rings. Definition 1.1. By an ordered commutative ring with unity we mean an ordered sextuple (R, +, 0,, 1, P ) such that (R, +, 0,, 1) is a commutative ring with unity
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 informationLemma 15.1 (Sign preservation Lemma). Suppose that f : E R is continuous at some a R.
15. Intermediate Value Theorem and Classification of discontinuities 15.1. Intermediate Value Theorem. Let us begin by recalling the definition of a function continuous at a point of its domain. Definition.
More informationReal Analysis Problems
Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.
More information1.4 Outer measures 10 CHAPTER 1. MEASURE
10 CHAPTER 1. MEASURE 1.3.6. ( Almost everywhere and null sets If (X, A, µ is a measure space, then a set in A is called a null set (or µ-null if its measure is 0. Clearly a countable union of null sets
More informationMath 127C, Spring 2006 Final Exam Solutions. x 2 ), g(y 1, y 2 ) = ( y 1 y 2, y1 2 + y2) 2. (g f) (0) = g (f(0))f (0).
Math 27C, Spring 26 Final Exam Solutions. Define f : R 2 R 2 and g : R 2 R 2 by f(x, x 2 (sin x 2 x, e x x 2, g(y, y 2 ( y y 2, y 2 + y2 2. Use the chain rule to compute the matrix of (g f (,. By the chain
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 informationCompendium and Solutions to exercises TMA4225 Foundation of analysis
Compendium and Solutions to exercises TMA4225 Foundation of analysis Ruben Spaans December 6, 2010 1 Introduction This compendium contains a lexicon over definitions and exercises with solutions. Throughout
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 informationThe reference [Ho17] refers to the course lecture notes by Ilkka Holopainen.
Department of Mathematics and Statistics Real Analysis I, Fall 207 Solutions to Exercise 6 (6 pages) riikka.schroderus at helsinki.fi Note. The course can be passed by an exam. The first possible exam
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 informationTHE STONE-WEIERSTRASS THEOREM AND ITS APPLICATIONS TO L 2 SPACES
THE STONE-WEIERSTRASS THEOREM AND ITS APPLICATIONS TO L 2 SPACES PHILIP GADDY Abstract. Throughout the course of this paper, we will first prove the Stone- Weierstrass Theroem, after providing some initial
More informationGeneral Notation. Exercises and Problems
Exercises and Problems The text contains both Exercises and Problems. The exercises are incorporated into the development of the theory in each section. Additional Problems appear at the end of most sections.
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 informationB. Appendix B. Topological vector spaces
B.1 B. Appendix B. Topological vector spaces B.1. Fréchet spaces. In this appendix we go through the definition of Fréchet spaces and their inductive limits, such as they are used for definitions of function
More information6.2 Fubini s Theorem. (µ ν)(c) = f C (x) dµ(x). (6.2) Proof. Note that (X Y, A B, µ ν) must be σ-finite as well, so that.
6.2 Fubini s Theorem Theorem 6.2.1. (Fubini s theorem - first form) Let (, A, µ) and (, B, ν) be complete σ-finite measure spaces. Let C = A B. Then for each µ ν- measurable set C C the section x C is
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 informationMath 117: Continuity of Functions
Math 117: Continuity of Functions John Douglas Moore November 21, 2008 We finally get to the topic of ɛ δ proofs, which in some sense is the goal of the course. It may appear somewhat laborious to use
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 informationLEBESGUE MEASURE AND L2 SPACE. Contents 1. Measure Spaces 1 2. Lebesgue Integration 2 3. L 2 Space 4 Acknowledgments 9 References 9
LBSGU MASUR AND L2 SPAC. ANNI WANG Abstract. This paper begins with an introduction to measure spaces and the Lebesgue theory of measure and integration. Several important theorems regarding the Lebesgue
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 informationTools from Lebesgue integration
Tools from Lebesgue integration E.P. van den Ban Fall 2005 Introduction In these notes we describe some of the basic tools from the theory of Lebesgue integration. Definitions and results will be given
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 information