MATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION. Extra Reading Material for Level 4 and Level 6
|
|
- Lucinda Richardson
- 5 years ago
- Views:
Transcription
1 MATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION Extra Reading Material for Level 4 and Level 6 Part A: Construction of Lebesgue Measure The first part the extra material consists of the construction of the Lebesgue measure µ whose existence is asserted in Theorem 3.6: Theorem 3.6. There exists a unique function µ : M R + {+ } such that (i) if I is an interval then µ(i) = l(i) (length property); (ii) for every x R, µ(x + E) = µ(e) (translation invariance); (iii) if {E j } is a countable collection of disjoint sets (in M) then µ = µ(e j ) E j (countable additivity); (iv) E F = µ(e) µ(f ) (montonicity); (v) if A N then µ(a) = 0 and, conversely, if µ(a) = 0 then A N (null sets property); (vi) if A M then µ(a) = inf{µ(u) : U is open and A U} (regularity). Recall that M denotes the smallest σ-algebra containing O N and that sets in M are called (Lebesgue) measurable. If I is an interval then M(I) will denote the measurable subsets of I. Lebesgue Outer Measure. The first step in the construction is to introduce the socalled Lebesgue outer measure,. This will be defined for all subsets of R and will satisfy properties (i), (ii), (iv), (v) and (vi) in Theorem 3.6 but will satisfy a condition which is weaker than countable additivity. Let {I j } be a countable collection of intervals. For E R, we say that {I j } is a cover of E if E j I j. Definition Let E R. Its Lebesgue outer measure (E) is defined by (E) = inf l(i j ) : {I j } is a cover of E by intervals. j 1 Typeset by AMS-TEX
2 (Note that we may have (E) = +.) Exercise 1 Show that we obtain the same value for (E) if we only allow covers {I j } consisting of open intervals. With the above definition, it is easy to establish some basic properties of. Proposition A.1. The Lebegsue outer measure satisfies the following. (i) (E) 0 for all E R; (ii) ( ) = 0; (iii) E F = (E) (F ) (monotonicity); (iv) ({x}) = 0 for all x R. Proof. (i) For any collection of intervals {I j }, j l(i j) 0, so the infimum in the definition of (E) is 0. (ii) Since is a subset of any set, {[ ϵ/2, ϵ/2]} is a cover of, for any ϵ > 0. Hence ( ) = inf l(i j ) : {I j } is a cover of by intervals j l([ ϵ/2, ϵ/2]) = ϵ. Since ϵ > 0 is arbitrary, we have ( ) = 0. (iii) If E F then every cover of F is also a cover of E, so the infimum in the definition of (E) is taken over a larger collection than that in the definition of (F ). Hence (E) (F ). (iv) This is nearly the same as the proof that ( ) = 0. Simply observe that, for any ϵ > 0, {[x ϵ/2, x + ϵ/2]} is a cover of {x}. Next, we show that satisfies the null sets property. Proposition A.2. For a set A R, A N if and only if (A) = 0. Proof. Suppose that A N. Then, by the definition of null sets, given ϵ > 0, there is a countable collection of open intervals {I j } such that A j I j so that {I j } is a cover of A and j l(i j) < ϵ. Thus, by the definition of (A) as an infimum, (A) j l(i j ) < ϵ. Since this holds for all ϵ > 0, we get (A) = 0. Now suppose (A) = 0. Then, by the definition of infimum, given ϵ > 0, there is an open cover {I j } of A such that l(i j ) < (A) + ϵ = ϵ. This shows that A is a null set. j To end this subsection, we shall show that satisfies the translation invariance property. 2
3 Proposition A.3. For all E R and all x R, we have (x + E) = (E). Exercise 2 Prove Proposition A.3. The Length Property. Next we need to show that really is a generalization of length by proving that satisfies the length property. This is much harder than the fairly easy results we proved above. It uses the following theorem, the proof of which makes a fairly challenging exercise. Heine-Borel Theorem. Suppose that I is a closed and bounded (or, as we sometimes say, compact) interval in R. Then every open cover of I has a finite subcover. More formally: if {J α } α A is a collection of open intervals which cover I then there exist α 1, α 2,..., α n A such that I J α1 J α2 J αn. (In this result, the collection A does not have to be countable. However, the hypothesis that the intervals J α are open is absolutely crucial.) Exercise 3 Prove the Heine-Borel Theorem. Hint: Consider S = {x [a, b] : [a, x] can be covered by a finite number of the J α }. Show that S and let c = sup S. Show that (i) c = b; and (ii) b S. Proposition A.4. If I R is an interval then (I) = l(i). Proof. First observe that, since {I} is a cover of I, it is clear that (I) l(i). Now we have to show the reverse inequality: this is considerably harder. We shall first consider the case where I is a closed and bounded interval [a, b]. By Exercise 1, we know that (I) is the infimum of j l(j j) taken over all covers of I by open intervals. However, the Heine-Borel Theorem implies that every such cover has a finite subcover, {J j1,..., J jn } say. Clearly, l(i ji ) l(i j ), j so we obtain that (I) is the infimum of j l(j j) taken over all covers of I by a finite collection of open intervals. Thus, we only need to consider covers of I consisting of a finite number of open intervals. We shall use induction on the number of elements in the cover to show that if {J 1,..., J n } is a cover of a closed interval I then l(i) l(j i ). 3
4 If a closed interval I is covered by one interval {J 1 } then, by monotonicity, l(i) l(j 1 ). Suppose, as our inductive hypothesis, that if a closed interval I is covered by m n intervals {J 1,..., J m } then m l(i) l(j i ). Now suppose that I is covered by {J 1,..., J n+1 } but that no n of these intervals cover I. (If they do the result is trivial.) Consider I\J n+1 : this consists of either one or two disjoint closed intervals. Let us suppose there are two if there is only one the argument is simpler and call them I and I. None of the intervals J i, i = 1,..., n, can intersect both I and I, for otherwise this J i would contain I J n+1 and hence {J 1,..., J n } would be a cover of I. Therefore, some of the intervals J 1,..., J n form a cover of I and the rest form a cover of I. Hence, by the inductive hypothesis, we have l(i ) + l(i ) l(j i ), which gives us l(i) = l(i ) + l(i ) + l(i J n+1 ) l(i ) + l(i ) + l(j n+1 ) n+1 l(j i ), as required. This completes the induction. We have shown that for any cover of a closed interval I by a finite number of open intervals {J 1,..., J n }, we have l(i) l(j i ). Taking the infimum over all such covers gives l(i) (I), so that (I) = l(i). Now suppose that I = (a, b) is an open bounded interval. Then, if ϵ > 0 is sufficiently small, [a + ϵ/2, b ϵ/2] is a closed interval contained in I. By monotonicity, (I) ([a + ϵ/2, b ϵ/2]) = l([a + ϵ/2, b ϵ/2]) = b a ϵ = l(i) ϵ. Since ϵ > 0 is arbitrary, we have (I) l(i). Combined with the first paragraph, this gives (I) = l(i). 4
5 Similar arguments deal with half-open bounded intervals. Finally, any unbounded interval contains bounded subintervals of arbitrary lengths so the result follows by monotonicity of. Exercise 4 Give an example of a subset A [0, 1] such that (A) = 0 but such that if {U 1, U 2,..., U n } is a finite cover of A by open intervals then n l(u i) 1. Regularity. Proposition A.5. If A R then (A) = inf{ (U) : U is open and A U}. Exercise 5. Prove Proposition A.5. Hint: use Exercise 1. Countable Subadditivity. Next, we show that satisfies a weakened version of countable additivity. This is called countable subadditivity. Proposition A.6. Let {E i } be a countable collection of subsets of R. (Note that we do not assume that they are disjoint.) Then ( ) E i (E i ). Proof. If any of the E i s has (E i ) = + then the result is immediate, so we shall assume that (E i ) < + for all i. Let ϵ > 0. For each i, we can, by the definition of (E i ), choose a cover {I (i) j } of E i by intervals so that (E i ) > l(i (i) j ) ϵ 2 i. Then {I(i) j } is a cover of E i and so ( ) E i = l(i (i) j ) ( (E i ) + ϵ ) 2 i (E i ) + ϵ. Since ϵ > 0 is arbitrary the required inequality follows. Exercise 6 (a) Show that, if N N and A R then (A N) = (A). 5
6 (b) Recall that, for E, F R, their symmetric difference is defined by E F = (E\F ) (F \E). Show that if E F N then (E) = (F ). Exercise 7 Suppose that {I j } is a countable collection of disjoint open intervals. Prove that j I j = j l(i j ). Exercise 8 Let {I j } be as in the previous exercise and let A be a subset of R. Show that A j I j = j (A I j ). The collection M 0. We will see later on (in Part B) that it is possible to find sets A, B R such that A B = and (A) + (B) (A B), so countable additivity fails in a very dramatic way. Our aim is to find a big σ-algebra on which this cannot happen. Here big will mean that it includes all Borel sets. We begin with some motivation. Suppose that A is a σ-algebra that contains all Borel sets and suppose that µ : A R + {+ } is a function which satisfies the length property, monotonicity and countable additivity. The next result will give us some estimates that such a function µ must satisfy. Lemma A.7. Suppose that µ : A R + {+ } is a function which satisfies the length property, monotonicity and countable additivity. Then, for any interval I = [a, b] and any set A A, l(i) (A c I) µ(a I) (A I). Proof. First we shall show the upper bound. Suppose that {I j } is a cover of A I by open intervals. Then {I j } is contained in A and µ(a I) µ j I j j µ(i j ) = j l(i j ), where the first inequality follows from monotonicity and the second inequality follows from countable additivity. Taking the infimum over all covers of A I by open intervals we obtain µ(a I) (A I). Thus the upper bound holds. 6
7 Since A c A, as well, the same argument also shows that µ(a c I) (A c I). Futhermore, A I and A c I are disjoint, so countable additivity gives µ(a I) + µ(a c I) = µ((a I) (A c I)) = µ(i) = l(i), where we have used the length property. Rearranging this and using the inequality for A c I gives µ(a I) = l(i) µ(a c I) l(i) (A c I), so the lower bound holds. This result tells us that if A and µ satisfy the properties we want then we must have l(i) (A c I) µ(a I) (A I) for all sets A A and all intervals I. If we had l(i) (A c I) = (A I) then the value of µ(a I) would be determined by this. We now make an educated guess which we will need to jusify that we should focus on sets for which the equality l(i) (A c I) = (A I) holds. Definition We will write M 0 for the collection of sets A R which have have the property that for every set X R, (A X) + (A c X) = (X). Since is subadditive, the definition can be relaxed to the requirement that for every X R, (A X) + (A c X) (X). Often, we will call the sets X test sets to indicate that they are being used to test whether a given set A is contained in M 0. Exercise 9 Let S denote the collection of all subsets A of R such that, for every interval J = (a, b), (A J) + (A c J) = (J). (a) Show that if A S and U is a bounded open subset of R then (A U) + (A c U) = (U). (b) Use (a) to show that if A S and X is any bounded subset of R then (A X) + (A c X) = (X). 7
8 Proposition A.8. N M 0. Exercise 10 Prove Proposition A.8. The next result shows that if we restrict to M 0 then it satisfies countable additivity. Theorem A.9. Let {A j } be a countable collection of disjoint sets in M 0. Then A j = (A j ). Proof. Consider the first n sets A 1,..., A n. Set A = A 1 and X = A 1 A 2 A n in the definition of M 0. Since A 1 M 0, we obtain (A 1 ) + (A 2 A n ) = (A 1 A n ). Repeating the argument with A = A 2 and X = A 2 A n, we obtain (A 2 ) + (A 3 A n ) = (A 2 A n ), so that (A 1 ) + (A 2 ) + (A 3 A n ) = (A 1 A n ). By repeating this argument a finite number of times, we get n A j = (A j ). Since, for any n 1, we have n A j A j, we obtain the inequality A j n A j = (A j ). Letting n, we have A j (A j ). Since, by subadditivity, we already know that A j 8 (A j ),
9 we have shown that A j = (A j ), as required. Exercise 11 Adapt the above proof to show that if {A j } is a countable collection of disjoint sets in M 0 and if X R is any set then X A j = (X A j ). M 0 is a σ-algebra. Our aim is now to show that, in fact, M 0 = M, the σ-algebra of measurable sets (which, we recall, was defined to be the smallest σ-algebra containing both the Borel sets B and the null sets N ). Our first step is to show that M 0 is a σ-algebra. Theorem A.10. M 0 is a σ-algebra. Proof. It is clear from the definition that M 0 and that if A M 0 then A c M 0. It remains to show that M 0 is closed under countable unions. First we will show that if A 1, A 2 M 0 then A 1 A 2 M 0. Take a test set X R; we need to show that ((A 1 A 2 ) X) + ((A 1 A 2 ) c X) = (X). Writing X 1 = A 1 \A 2 X, X 2 = A 1 A 2 X, X 3 = A 2 \A 1 X, and X 4 = (A 1 A 2 ) c X, this is equivalent to (X 1 X 2 X 3 ) + (X 4 ) = (X). Since A 2 M 0, we may use X 1 X 2 as a test set to obtain and use X 3 X 4 as a test set to obtain Also, since A 1 M 0 and using X as a test set we have Combining (1),(2) and (3) gives (X 1 ) + (X 2 ) = (X 1 X 2 ) (1) (X 3 ) + (X 4 ) = (X 3 X 4 ). (2) (X 1 X 2 ) + (X 3 X 4 ) = (X). (3) (X 1 ) + (X 2 ) + (X 3 ) + (X 4 ) = (X). (4) 9
10 Now, since A 1 M 0 and using X 1 X 2 X 3 as a test set, we have By (1), we can rewrite this as Combining (4) and (5) gives (X 1 X 2 ) + (X 3 ) = (X 1 X 2 X 3 ). (X 1 ) + (X 2 ) + (X 3 ) = (X 1 X 2 X 3 ). (5) (X 1 X 2 X 3 ) + (X 4 ) = (X), as required. Using a simple induction argument, we can deduce (from the results for two sets) that M 0 is closed under finite unions. To complete the proof we have to consider countable unions. Suppose that {A j } M 0. We can assume that these sets are disjoint by replacing A 2 by A 2 \A 1, A 3 by A 3 \(A 1 A 2 ) and, in general, A j by A j \ j 1 A i. (This procedure does not alter the union A j.) Let B n = A 1 A 2 A n, then B n M 0. Furthermore, by Theorem A.9, By Exercise 11, for any test set X, (B n ) = (A j ). (X) = (X B n ) + (X Bn) c = (X A j ) + (X Bn). c Write A = A j. Then B n A for all n 1, so A c B c n. Hence and so (X) (X B c n) (X A c ) (X A j ) + (X A c ). Letting n and again applying Exercise 11 gives (X) (X A j ) + (X A c ) = (X A) + (X A c ). Therefore A M 0. 10
11 Borel sets are in M 0. We will prove that B M 0 in two steps. The first is to show that semi-infinite intervals are in M 0. Lemma A.11. For every a R, the interval (a, ) M 0. Proof. Let X R be a test set and write X 1 = X (a, ), X 2 = X (, a]. We need to show that (X 1 ) + (X 2 ) (X). If (X) = + then the result immediate, so assume that (X) < +. Then, by the definition of (X), given ϵ > 0, there exists a cover {I j } of X by open intervals for which l(i j ) (X) + ϵ. For each j, let I j = I j (a, ), I j and Since X 1 j I j, we have j = I j (, a]. Then I j and I j l(i j ) = l(i j) + l(i j ) = (I j) + (I j ). (X 1 ) j I j j (I j) are intervals (or empty) and since X 2 j I j, we have (X 2 ) j I j j (I j ). Hence (X 1 ) + (X 2 ) j = j ( (I j) + (I j ) ) l(i j ) (X) + ϵ. Since ϵ > 0 is arbitrary, the required inequality holds. Theorem A.12. We have B M 0. Proof. We will repeatedly use the fact that M 0 is a σ-algebra to show that (a, ) M 0 for all a implies that all Borel sets are contained in M 0. By Lemma A.11, (a, ) M 0, for every a R. Since M 0 is a σ-algebra, we also have (a, ) c = (, a] M 0. Since ( (, b) =, b 1 ], n n=1 we have (, b) M 0, for every b R. Hence every open interval (a, b) = (, b) (a, ) is in M 0. Since the Borel σ-algebra is the smallest σ-algebra containing all open intervals, we have B M 0. 11
12 M 0 is equal to M, the σ-algebra of measurable sets. Proposition A.13. M M 0 Proof. We have shown that N M 0 and B M 0, so M 0 is a σ-algebra containing N and B. Since M is the smallest σ-algebra with this property, we have M M 0. Lemma A.14. Any bounded set A M 0 can be written as A = B\N, where B B and N = A c B N. Proof. Let A M 0 be bounded, i.e., A [ M, M], for some M 0. Then (A) ([ M, M]) = 2M < +. By the regularity property of outer measure, for each k 1 we can find an open set V k such that A V k and (V k ) (A) + 1 k. Let B = k=1 V k B. Then, for each k 1, (A) (B) (V k ) (A) + 1 k and so we see that (B) = (A). Now apply the definition of M 0 to A with X = B. We get Since A B, A B = A and this becomes (A B) + (A c B) = (B). (A) + (A c B) = (B). Since (B) = (A) and (A) is finite, we must have (A c B) = 0. By Proposition A.2, A c B is a null set. Thus we have found B B and N = A c B N such that A = B\N. Theorem A.15. We have M 0 = M. Proof. For arbitrary A M 0 and m Z, write A m = A [m, m + 1]. Then A m M 0 and A m is bounded. By Lemma A.14, we can write A m = B\N with B B M and N N M. Since M 0 is a σ-algebra, we get A m M and hence A = m Z A m M. Thus M 0 M. Combined with Proposition A.13, this gives the result. Definition We call the restriction of to M the Lebesgue measure on R. denote it by µ or, if we wish to be more precise, by (R, M, µ). We shall Remark You should note that the use of the symbol µ to denote Lebesgue measure is not universal. 12
13 Exercise 12 Prove that a measure which satisfies all the properties in Theorem 3.6 except (ii) (translation invariance) must also, in fact, satisfy (ii). Exercise 13 THIS EXERCISE IS NOT EXAMINABLE. Prove that if ν is measure which satisfies properties (ii)-(vi) in Theorem 3.6 then there exists c [0, + ) such that ν = cµ. Exercise 14 Show that if A M with µ(a) = + then, given any ϵ > 0, there is an open set V R such that A V and µ(v \A) < ϵ. (Hint: recall that the case where µ(a) < + was on Example Sheet 3. Try to deduce the required result from this.) Remark We can also construct Lebesgue measure on R n, n 2. In this setting, we are trying to generalize n-dimensional volume (area if n = 2, standard volume if n = 3). We shall denote n-dimensional Lebesgue measure by µ (n). A set of the form R = I 1 I n, where I 1,..., I n are intervals is called an (n-dimensional) rectangle. The volume vol(r) of R is given by n vol(r) = l(i j ). We wish to define µ (n) so that µ (n) (R) = vol(r), for every rectangle R. Imitating our procedure for n = 1, we define an outer measure as follows: µ (n) (E) = inf vol(r j ) : {R j } is a cover of E by rectangles. j It should be easy to convince yourself that µ (n) is an outer measure on R n. Essentially everything that we did for carries through for µ (n) except we have to work harder. 13
14 Part B: A Non-Measurable Set So far we have not ruled out the possibility that all subsets of R are measurable. We now present an example of a non-measurable set. To do this we need to use: Axiom of Choice. Let C be any collection of non-empty sets. Then we can choose precisely one element from each of these sets. (More precisely, there is a function f : C A, such that f(a) A, for all A C.) A C First, let us introduce some notation. For x, y [0, 1) define { x + y if 0 x + y < 1 x y = x + y (mod 1) = x + y 1 if 1 x + y < 2, and for E [0, 1), x [0, 1) define x E = {x e : e E} [0, 1). Lemma B.1. If E [0, 1) is measurable and x [0, 1) then x E is measurable and µ(x E) = µ(e). Proof. Let E 1 = E [0, 1 x) and E 2 = E [1 x, 1); then E 1 and E 2 are measurable (and disjoint) so µ(e) = µ(e 1 ) + µ(e 2 ). It is easy to check that x E 1 = x + E 1 and x E 2 = (x 1) + E 2, so that x E 1 and x E 2 are measurable and (by translation invariance) µ(x E 1 ) = µ(e 1 ), µ(x E 2 ) = µ(e 2 ). It is also easy to check that x E 1 and x E 2 are disjoint and hence, since x E = (x E 1 ) (x E 2 ), x E is measurable and µ(x E) = µ(x E 1 ) + µ(x E 2 ) = µ(e 1 ) + µ(e 2 ) = µ(e). Now define an equivalence relation on [0, 1) by x y if and only if x y Q. Let C denote the collection of equivalence classes for this relation and apply the Axiom of Choice to obtain a set E [0, 1) consisting of one element from each equivalence class. 14
15 Theorem B.2. E is not measurable. Proof. Let {r n } n=1 be an enumeration of the rationals in [0, 1). Let x [0, 1); then x e for some e E, i.e., x e Q. Since x e ( 1, 1), we have x e = r n or x e = r n 1 for some n. Rewriting this as x = r n + e or x = r n + e 1, shows that x r n E. Now suppose that x (r n E) (r m E). Then x = r n + e n ( 1) = r m + e m ( 1), for some e n, e m E. (The 1 terms may or may not appear.) Hence e n e m Q, so that, since E contains one element from each equivalence class, e n = e m. Therefore r n = r m. The above shows that [0, 1) = r n E, n=1 and that this union is disjoint. If E is measurable then so are the other sets in the union and ( ) 1 = µ([0, 1)) = µ r n E = = n=1 µ(r n E) n=1 µ(e). n=1 But this sum is equal to either 0 or +, depending on whether µ(e) = 0 or µ(e) > 0. Hence we have a contradiction and so E cannot be measurable. Theorem B.3. There exist sets A, B R such that A B = but (A) + (B) (A B). Proof. Let E be the non-measurable set defined above. Since M = M 0, non-measurability means that we can find X R such that (E X) + (E c X) (X). Set A = E X and B = E c X. Then A B = and A B = X, so the above equation becomes (A) + (B) (A B), as required. 15
16 Part C: General Measures So far we have studied very special measures on R and R n ones that that generalize length and volume, respectively. However, there is a general notion of a measure, which we will now introduce. Let X be a set (no other structure is assumed) and let B be a σ-algebra of subsets of X. The pair (X, B) is called a measurable space. Definition Let (X, B) be a measurable space. A function m : B R + {+ } satisfying (i) m( ) = 0, (ii) if {E j } is a countable collection of disjoint sets in B then m = m(e j ), E j is called a measure. (If m(x) < + then we call m a finite measure.) The triple (X, B, m) is called a measure space. Remarks (i) Note that countable additivity implies monotonicity. (ii) We do not assume that B is the largest σ-algebra on which we can define m as a measure. For example, if M denotes the Lebesgue measurable sets in R and B denotes the Borel sets in R then (R, M, µ) and (R, B, µ) are both measure spaces. We can construct measures from outer measures in exactly the same way that we constructed Lebesgue measure from Lebesgue outer measure. Definition Let X be a set. A map m from the set of all subsets of X to R + {+ } is called an outer measure if (i) m ( ) = 0, (ii) E F = m (E) m (F ), (iii) if {E j } is a countable collection of sets in X then m (E j ). m E j In this general context, we use the defining criterion of M 0 as the definition of measurability: Definition We say that E X is m -measurable (or just measurable, if no confusion arises) if, for every A X, m (E A) + m (E c A) = m (A). Write M for the collection of all m -measurable sets and let m denote the restriction of m to M. We then have the following theorem. 16
17 Theorem C.1. With the above definitions, M is a σ-algebra and (X, M, m) is a measure space. Proof. We ve already proved it! If you look at the proofs of the corresponding results for Lebesgue measure you will see that all we used were the properties of outer measure and the definition of measurability. Example Let I R be an interval and let f : I R be a non-negative measurable function. Then m : M(I) R + {+ } defined by is a measure. m(a) = Exercise 15 Show that m is a measure. integrable over I. A fdµ = I fχ A dµ ( ) Show that m(i) is finite if and only if f is Example For an arbitrary (non-empty) set X and for x X define δ x by { 1 if x A, δ x (A) = 0 otherwise. Then (X, P, δ x ) is a measure space, where P is the set of all subsets of X. (Such δ x are called Dirac measures.) Exercise 16 Show that (X, P, δ x ) is a measure space. Show that any function f : X R is measurable with respect to δ x and that f dδ x = f(x). Exercise 17 Let I R be an interval and let x I. Show that there is no integrable function f such that for all A M(I) we have δ x (A) = m(a), where m is defined by ( ). 17
Chapter 4. Measure Theory. 1. Measure Spaces
Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if
More informationMeasures and Measure Spaces
Chapter 2 Measures and Measure Spaces In summarizing the flaws of the Riemann integral we can focus on two main points: 1) Many nice functions are not Riemann integrable. 2) The Riemann integral does not
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 informationII - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define
1 Measures 1.1 Jordan content in R N II - REAL ANALYSIS Let I be an interval in R. Then its 1-content is defined as c 1 (I) := b a if I is bounded with endpoints a, b. If I is unbounded, we define c 1
More informationLebesgue Measure. Dung Le 1
Lebesgue Measure Dung Le 1 1 Introduction How do we measure the size of a set in IR? Let s start with the simplest ones: intervals. Obviously, the natural candidate for a measure of an interval is its
More information+ = x. ± if x > 0. if x < 0, x
2 Set Functions Notation Let R R {, + } and R + {x R : x 0} {+ }. Here + and are symbols satisfying obvious conditions: for any real number x R : < x < +, (± + (± x + (± (± + x ±, (± (± + and (± (, ± if
More informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
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 informationµ (X) := inf l(i k ) where X k=1 I k, I k an open interval Notice that is a map from subsets of R to non-negative number together with infinity
A crash course in Lebesgue measure theory, Math 317, Intro to Analysis II These lecture notes are inspired by the third edition of Royden s Real analysis. The Jordan content is an attempt to extend the
More informationMeasures. Chapter Some prerequisites. 1.2 Introduction
Lecture notes Course Analysis for PhD students Uppsala University, Spring 2018 Rostyslav Kozhan Chapter 1 Measures 1.1 Some prerequisites I will follow closely the textbook Real analysis: Modern Techniques
More informationLebesgue Measure on R n
8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationChapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries
Chapter 1 Measure Spaces 1.1 Algebras and σ algebras of sets 1.1.1 Notation and preliminaries We shall denote by X a nonempty set, by P(X) the set of all parts (i.e., subsets) of X, and by the empty set.
More informationSolutions to Tutorial 1 (Week 2)
THE UNIVERSITY OF SYDNEY SCHOOL OF MATHEMATICS AND STATISTICS Solutions to Tutorial 1 (Week 2 MATH3969: Measure Theory and Fourier Analysis (Advanced Semester 2, 2017 Web Page: http://sydney.edu.au/science/maths/u/ug/sm/math3969/
More informationMeasure and Integration: Concepts, Examples and Exercises. INDER K. RANA Indian Institute of Technology Bombay India
Measure and Integration: Concepts, Examples and Exercises INDER K. RANA Indian Institute of Technology Bombay India Department of Mathematics, Indian Institute of Technology, Bombay, Powai, Mumbai 400076,
More informationThe Caratheodory Construction of Measures
Chapter 5 The Caratheodory Construction of Measures Recall how our construction of Lebesgue measure in Chapter 2 proceeded from an initial notion of the size of a very restricted class of subsets of R,
More informationMATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets
MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 2: Countability and Cantor Sets Countable and Uncountable Sets The concept of countability will be important in this course
More informationDRAFT MAA6616 COURSE NOTES FALL 2015
Contents 1. σ-algebras 2 1.1. The Borel σ-algebra over R 5 1.2. Product σ-algebras 7 2. Measures 8 3. Outer measures and the Caratheodory Extension Theorem 11 4. Construction of Lebesgue measure 15 5.
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More informationIntegration on Measure Spaces
Chapter 3 Integration on Measure Spaces In this chapter we introduce the general notion of a measure on a space X, define the class of measurable functions, and define the integral, first on a class of
More information1.1. MEASURES AND INTEGRALS
CHAPTER 1: MEASURE THEORY In this chapter we define the notion of measure µ on a space, construct integrals on this space, and establish their basic properties under limits. The measure µ(e) will be defined
More informationReal Analysis Chapter 1 Solutions Jonathan Conder
3. (a) Let M be an infinite σ-algebra of subsets of some set X. There exists a countably infinite subcollection C M, and we may choose C to be closed under taking complements (adding in missing complements
More information(2) E M = E C = X\E M
10 RICHARD B. MELROSE 2. Measures and σ-algebras An outer measure such as µ is a rather crude object since, even if the A i are disjoint, there is generally strict inequality in (1.14). It turns out to
More informationREAL ANALYSIS LECTURE NOTES: 1.4 OUTER MEASURE
REAL ANALYSIS LECTURE NOTES: 1.4 OUTER MEASURE CHRISTOPHER HEIL 1.4.1 Introduction We will expand on Section 1.4 of Folland s text, which covers abstract outer measures also called exterior measures).
More informationSection 2: Classes of Sets
Section 2: Classes of Sets Notation: If A, B are subsets of X, then A \ B denotes the set difference, A \ B = {x A : x B}. A B denotes the symmetric difference. A B = (A \ B) (B \ A) = (A B) \ (A B). Remarks
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 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 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 informationMeasure and integration
Chapter 5 Measure and integration In calculus you have learned how to calculate the size of different kinds of sets: the length of a curve, the area of a region or a surface, the volume or mass of a solid.
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 informationLebesgue measure on R is just one of many important measures in mathematics. In these notes we introduce the general framework for measures.
Measures In General Lebesgue measure on R is just one of many important measures in mathematics. In these notes we introduce the general framework for measures. Definition: σ-algebra Let X be a set. A
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 informationThree hours THE UNIVERSITY OF MANCHESTER. 24th January
Three hours MATH41011 THE UNIVERSITY OF MANCHESTER FOURIER ANALYSIS AND LEBESGUE INTEGRATION 24th January 2013 9.45 12.45 Answer ALL SIX questions in Section A (25 marks in total). Answer THREE of the
More informationConstruction of a general measure structure
Chapter 4 Construction of a general measure structure We turn to the development of general measure theory. The ingredients are a set describing the universe of points, a class of measurable subsets along
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 informationMeasure Theory. John K. Hunter. Department of Mathematics, University of California at Davis
Measure Theory John K. Hunter Department of Mathematics, University of California at Davis Abstract. These are some brief notes on measure theory, concentrating on Lebesgue measure on R n. Some missing
More informationMeasurable functions are approximately nice, even if look terrible.
Tel Aviv University, 2015 Functions of real variables 74 7 Approximation 7a A terrible integrable function........... 74 7b Approximation of sets................ 76 7c Approximation of functions............
More information18.175: Lecture 2 Extension theorems, random variables, distributions
18.175: Lecture 2 Extension theorems, random variables, distributions Scott Sheffield MIT Outline Extension theorems Characterizing measures on R d Random variables Outline Extension theorems Characterizing
More informationA VERY BRIEF REVIEW OF MEASURE THEORY
A VERY BRIEF REVIEW OF MEASURE THEORY A brief philosophical discussion. Measure theory, as much as any branch of mathematics, is an area where it is important to be acquainted with the basic notions and
More informationFUNDAMENTALS OF REAL ANALYSIS by. II.1. Prelude. Recall that the Riemann integral of a real-valued function f on an interval [a, b] is defined as
FUNDAMENTALS OF REAL ANALYSIS by Doğan Çömez II. MEASURES AND MEASURE SPACES II.1. Prelude Recall that the Riemann integral of a real-valued function f on an interval [a, b] is defined as b n f(xdx :=
More informationCHAPTER I THE RIESZ REPRESENTATION THEOREM
CHAPTER I THE RIESZ REPRESENTATION THEOREM We begin our study by identifying certain special kinds of linear functionals on certain special vector spaces of functions. We describe these linear functionals
More information02. Measure and integral. 1. Borel-measurable functions and pointwise limits
(October 3, 2017) 02. Measure and integral Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2017-18/02 measure and integral.pdf]
More informationMeasure Theoretic Probability. P.J.C. Spreij
Measure Theoretic Probability P.J.C. Spreij this version: September 16, 2009 Contents 1 σ-algebras and measures 1 1.1 σ-algebras............................... 1 1.2 Measures...............................
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 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 informationDual Space of L 1. C = {E P(I) : one of E or I \ E is countable}.
Dual Space of L 1 Note. The main theorem of this note is on page 5. The secondary theorem, describing the dual of L (µ) is on page 8. Let (X, M, µ) be a measure space. We consider the subsets of X which
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 information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More information(U) =, if 0 U, 1 U, (U) = X, if 0 U, and 1 U. (U) = E, if 0 U, but 1 U. (U) = X \ E if 0 U, but 1 U. n=1 A n, then A M.
1. Abstract Integration The main reference for this section is Rudin s Real and Complex Analysis. The purpose of developing an abstract theory of integration is to emphasize the difference between the
More information5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing.
5 Measure theory II 1. Charges (signed measures). Let (Ω, A) be a σ -algebra. A map φ: A R is called a charge, (or signed measure or σ -additive set function) if φ = φ(a j ) (5.1) A j for any disjoint
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 informationChapter 8. General Countably Additive Set Functions. 8.1 Hahn Decomposition Theorem
Chapter 8 General Countably dditive Set Functions In Theorem 5.2.2 the reader saw that if f : X R is integrable on the measure space (X,, µ) then we can define a countably additive set function ν on by
More informationMAT1000 ASSIGNMENT 1. a k 3 k. x =
MAT1000 ASSIGNMENT 1 VITALY KUZNETSOV Question 1 (Exercise 2 on page 37). Tne Cantor set C can also be described in terms of ternary expansions. (a) Every number in [0, 1] has a ternary expansion x = a
More informationJORDAN CONTENT. J(P, A) = {m(i k ); I k an interval of P contained in int(a)} J(P, A) = {m(i k ); I k an interval of P intersecting cl(a)}.
JORDAN CONTENT Definition. Let A R n be a bounded set. Given a rectangle (cartesian product of compact intervals) R R n containing A, denote by P the set of finite partitions of R by sub-rectangles ( intervals
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 informationAnnalee Gomm Math 714: Assignment #2
Annalee Gomm Math 714: Assignment #2 3.32. Verify that if A M, λ(a = 0, and B A, then B M and λ(b = 0. Suppose that A M with λ(a = 0, and let B be any subset of A. By the nonnegativity and monotonicity
More informationn [ F (b j ) F (a j ) ], n j=1(a j, b j ] E (4.1)
1.4. CONSTRUCTION OF LEBESGUE-STIELTJES MEASURES In this section we shall put to use the Carathéodory-Hahn theory, in order to construct measures with certain desirable properties first on the real line
More informationSpring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures
36-752 Spring 2014 Advanced Probability Overview Lecture Notes Set 1: Course Overview, σ-fields, and Measures Instructor: Jing Lei Associated reading: Sec 1.1-1.4 of Ash and Doléans-Dade; Sec 1.1 and A.1
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 informationProduct measures, Tonelli s and Fubini s theorems For use in MAT4410, autumn 2017 Nadia S. Larsen. 17 November 2017.
Product measures, Tonelli s and Fubini s theorems For use in MAT4410, autumn 017 Nadia S. Larsen 17 November 017. 1. Construction of the product measure The purpose of these notes is to prove the main
More informationMeasure Theory & Integration
Measure Theory & Integration Lecture Notes, Math 320/520 Fall, 2004 D.H. Sattinger Department of Mathematics Yale University Contents 1 Preliminaries 1 2 Measures 3 2.1 Area and Measure........................
More information13. Examples of measure-preserving tranformations: rotations of a torus, the doubling map
3. Examples of measure-preserving tranformations: rotations of a torus, the doubling map 3. Rotations of a torus, the doubling map In this lecture we give two methods by which one can show that a given
More informationarxiv: v1 [math.fa] 14 Jul 2018
Construction of Regular Non-Atomic arxiv:180705437v1 [mathfa] 14 Jul 2018 Strictly-Positive Measures in Second-Countable Locally Compact Non-Atomic Hausdorff Spaces Abstract Jason Bentley Department of
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
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 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 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 informationREAL ANALYSIS I Spring 2016 Product Measures
REAL ANALSIS I Spring 216 Product Measures We assume that (, M, µ), (, N, ν) are σ- finite measure spaces. We want to provide the Cartesian product with a measure space structure in which all sets of the
More informationReminder Notes for the Course on Measures on Topological Spaces
Reminder Notes for the Course on Measures on Topological Spaces T. C. Dorlas Dublin Institute for Advanced Studies School of Theoretical Physics 10 Burlington Road, Dublin 4, Ireland. Email: dorlas@stp.dias.ie
More informationMA359 Measure Theory
A359 easure Theory Thomas Reddington Usman Qureshi April 8, 204 Contents Real Line 3. Cantor set.................................................. 5 2 General easures 2 2. Product spaces...............................................
More informationMath212a1411 Lebesgue measure.
Math212a1411 Lebesgue measure. October 14, 2014 Reminder No class this Thursday Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous
More informationUniversity of Sheffield. School of Mathematics & and Statistics. Measure and Probability MAS350/451/6352
University of Sheffield School of Mathematics & and Statistics Measure and Probability MAS350/451/6352 Spring 2018 Chapter 1 Measure Spaces and Measure 1.1 What is Measure? Measure theory is the abstract
More informationMATH & MATH FUNCTIONS OF A REAL VARIABLE EXERCISES FALL 2015 & SPRING Scientia Imperii Decus et Tutamen 1
MATH 5310.001 & MATH 5320.001 FUNCTIONS OF A REAL VARIABLE EXERCISES FALL 2015 & SPRING 2016 Scientia Imperii Decus et Tutamen 1 Robert R. Kallman University of North Texas Department of Mathematics 1155
More informationU e = E (U\E) e E e + U\E e. (1.6)
12 1 Lebesgue Measure 1.2 Lebesgue Measure In Section 1.1 we defined the exterior Lebesgue measure of every subset of R d. Unfortunately, a major disadvantage of exterior measure is that it does not satisfy
More informationMath 4121 Spring 2012 Weaver. Measure Theory. 1. σ-algebras
Math 4121 Spring 2012 Weaver Measure Theory 1. σ-algebras A measure is a function which gauges the size of subsets of a given set. In general we do not ask that a measure evaluate the size of every subset,
More information2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More informationSigned Measures and Complex Measures
Chapter 8 Signed Measures Complex Measures As opposed to the measures we have considered so far, a signed measure is allowed to take on both positive negative values. To be precise, if M is a σ-algebra
More informationProbability and Measure
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability
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 informationFinal. due May 8, 2012
Final due May 8, 2012 Write your solutions clearly in complete sentences. All notation used must be properly introduced. Your arguments besides being correct should be also complete. Pay close attention
More informationQuick Tour of the Topology of R. Steven Hurder, Dave Marker, & John Wood 1
Quick Tour of the Topology of R Steven Hurder, Dave Marker, & John Wood 1 1 Department of Mathematics, University of Illinois at Chicago April 17, 2003 Preface i Chapter 1. The Topology of R 1 1. Open
More information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
More information2 Measure Theory. 2.1 Measures
2 Measure Theory 2.1 Measures A lot of this exposition is motivated by Folland s wonderful text, Real Analysis: Modern Techniques and Their Applications. Perhaps the most ubiquitous measure in our lives
More informationMoreover, µ is monotone, that is for any A B which are both elements of A we have
FRACTALS Contents. Algebras, sigma algebras, and measures 2.. Carathéodory s outer measures 5.2. Completeness 6.3. Homework: Measure theory basics 7 2. Completion of a measure, creating a measure from
More informationAnalysis of Probabilistic Systems
Analysis of Probabilistic Systems Bootcamp Lecture 2: Measure and Integration Prakash Panangaden 1 1 School of Computer Science McGill University Fall 2016, Simons Institute Panangaden (McGill) Analysis
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 informationStat 451: Solutions to Assignment #1
Stat 451: Solutions to Assignment #1 2.1) By definition, 2 Ω is the set of all subsets of Ω. Therefore, to show that 2 Ω is a σ-algebra we must show that the conditions of the definition σ-algebra are
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 informationPart III. 10 Topological Space Basics. Topological Spaces
Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.
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 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 informationCHAPTER 6. Differentiation
CHPTER 6 Differentiation The generalization from elementary calculus of differentiation in measure theory is less obvious than that of integration, and the methods of treating it are somewhat involved.
More informationMAT 571 REAL ANALYSIS II LECTURE NOTES. Contents. 2. Product measures Iterated integrals Complete products Differentiation 17
MAT 57 REAL ANALSIS II LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: SPRING 205 Contents. Convergence in measure 2. Product measures 3 3. Iterated integrals 4 4. Complete products 9 5. Signed measures
More informationA Brief Introduction to the Theory of Lebesgue Integration
A Brief Introduction to the Theory of Lebesgue Integration Kevin Sigler June 8, 25 Introduction Gonzalez-Velasco s paper The Lebesgue Integral as a Riemann Integral provides a non-standard, direct construction
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 information6 Classical dualities and reflexivity
6 Classical dualities and reflexivity 1. Classical dualities. Let (Ω, A, µ) be a measure space. We will describe the duals for the Banach spaces L p (Ω). First, notice that any f L p, 1 p, generates the
More informationPrinciples of Real Analysis I Fall I. The Real Number System
21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous
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 informationDifferentiation. Chapter 4. Consider the set E = [0, that E [0, b] = b 2
Chapter 4 Differentiation Consider the set E = [0, 8 1 ] [ 1 4, 3 8 ] [ 1 2, 5 8 ] [ 3 4, 8 7 ]. This set E has the property that E [0, b] = b 2 for b = 0, 1 4, 1 2, 3 4, 1. Does there exist a Lebesgue
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 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 information