Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
|
|
- Jeffery Martin
- 5 years ago
- Views:
Transcription
1 Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October Costructio of the product measure The purpose of these otes is to preset the costructio of the product of two measure spaces ad to state ad prove the mai theorems, Toelli s ad Fubii s theorems. These otes expad upo the material o product measure i [2]. The overall goal is to be able to itegrate fuctios of two or several variables. For this we eed to make sese of a multiple itegral i such a way that we ca compute its value o appropriate fuctios by chagig the order of itegratio whe we view the fuctio i a sigle variable, the others beig kept fixed. Give two measure spaces, A 1, µ 1 ad, A 2, µ 2, the goal is to costruct a σ-algebra A 1 A 2 of subsets of ad a measure ω o A 1 A 2 i such a way that the above metioed chage of order of itegratio is possible whe we cosider A 1 A 2 -measurable fuctios oegative or real-valued. For motivatio, cosider the case of Lebesgue measure o R, ad let I, J be itervals. The the area of the rectagle I J is 1 areai J = lilj = λiλj. We ca thik of area as a appropriate choice for a measure ω assiged to a rectagle I J. Next we formalise this idea for two geeral measure spaces. We defie the collectio C of measurable rectagles i A 1 A 2 to be 2 C = {A B A A 1, B A 2 }. Lemma 1.1. The collectio C of measurable rectagles is closed uder fiite itersectios. Proof. Exercise, or see Propositio 6.1 i [1]. Motivated by 1 we would like to have a a σ-algebra A 1 A 2 of subsets of such that C A 1 A 2, ad we would like to have a measure ω o A 1 A 2 which satisfies 3 ωa B = µ 1 Aµ 2 B for ay measurable rectagle A B. It is immediate to defie A 1 A 2 by 4 A 1 A 2 = σc, the σ-algebra geerated by the measurable rectagles this is the smallest σ-algebra o that cotais C. The hard work lies i provig that there exists a measure ω satisfyig 3: we call this the existece part of the product measure costructio. It turs out that uder some coditios, the measure ω satisfyig 3 is the oly oe with this property: we call this the uiqueess part of the product measure costructio. 1
2 2 The uiqueess part also requires some work, ad sice some of the ideas here will be useful for the existece proof, we begi with it. 2. Uiqueess of a measure defied o a collectio of sets The mai geeral result that will be used i the uiqueess part is the followig theorem. Theorem 2.1. see [2, Theorem 7.5] Suppose that X, A, µ is a measure space with the followig properties: 1 A = σe for a collectio E of subsets of X that is closed uder fiite itersectios, ad 2 there is a sequece {X } of elemets i E such that X X +1 for all 1, X = X, ad µx < for all. The µ is uiquely determied by its values o elemets i E. More precisely, if µ is a measure o A such that µa = µa for all A E, the µ = µ. To prove this theorem we will itroduce Dyki systems. For a subset A of a set X we let A c deote the complemet X \ A. Defiitio 2.2. Let X be a set. A collectio D of subsets of X is a Dyki system if the followig are satisfied: D1 X D, D2 A D A c D, ad D3 if {A } is a pairwise disjoit family i D, the A D. I a Dyki system, if A B ad B D, the B \ A = B c A c D. Give a set X ad a collectio E of subsets of X, recall that σe deotes the σ- algebra geerated by E. Sice there exists at least oe Dyki system that cotais E, amely the collectio PX, the by takig the itersectio of all Dyki systems which cotai E we obtai the Dyki system geerated by E: we deote this by DE ad poit out that this is the smallest Dyki system that cotais E. Lemma 2.3. Give a set X, if D is a Dyki system over X which is closed uder fiite itersectios or, equivaletly, uder fiite uios, the D is a σ-algebra. Proof. Let {A } be a arbitrary sequece i D. We make this ito a disjoit sequece, thus we let B 1 = A 1, B 2 = A 2 \ A 1 = A 2 A c 1, ad for all m > 2 m m B m = A m \ A k = A m A c k. The {B m } m is a disjoit uio i D, so m B m = A D. k=1 Lemma 2.4. Dyki Let X be a set ad E a collectio of subsets of X with the property that A, B E A B E. The DE = σe. k=1
3 Proof. Sice ay σ-algebra is also a Dyki system, ad sice E σe, we have that DE σe. To prove the coverse iclusio it suffices to show that DE is a σ- algebra. For simplicity of otatio, write D istead of DE. By Lemma 2.3, it is eough to show that D is closed uder itersectios. For A D we let D A = {B D A B D}. We claim that D A is a Dyki system that cotais E. Sice A X = A is i D, we have X D A. Let B D A. The A B c = A \ B A, which is i D by earlier observatio. So B c D A. Now let {B m } m be a pairwise disjoit sequece i D A. The A m B m = m A B m, which is i D because {A B m } m is a pairwise disjoit sequece i D. This shows that m B m D A. All i all, D A is a Dyki system. If the set A we start with has the property that A E, the for every B E we have A B E by the hypothesis. Thus A B D, so B D A. Sice B was arbitrary, we have E D A each time we start with A i E. Sice D is the smallest Dyki system o X that cotais E, we have D D A, so D = D A whe A E. It is importat to realise that this holds for ay A E. Next we let A D. We will show that E D A. Take B E. The by what we have just show, A D B. Thus A B D, which also meas that B D A. Sice B was arbitrary, we get E D A for A D, thus D = D A for all A D. This meas that D is closed uder itersectios. Proof of Theorem 2.1. We defie D = {A A µa = µa}. We claim that D is a Dyki system. By the assumptios o µ ad {X } we have µx = lim µx = lim µx = µx, so X D, which is D1. To cotiue, we cosider first the case that µx <. Let A D. Sice µ is mootoe ad µa µx <, we have µa c = µx µa = µx µa = µa c. This shows D2. To prove D3, let {A } be a pairwise disjoit sequece i D. Set B m = m k=1 A k. The B m form a icreasig sequece i A whose uio is A ad therefore belogs to A. By properties of measures ad the assumptio that A D for all 1, we have µ A = µ B = lim µb = lim µa k = lim µa k = lim k=1 k=1 µb = µ B = µ This shows that A D, which is D3. Thus D is a Dyki system. The assumptios imply that E D. The Lemma 2.4 gives that so D = A, which meas that µ = µ. σe = DE D A = σe, A. 3
4 4 I the geeral case we have X = X, X E ad µx < for all 1. By the first case, we have The for each A A we have µa X = µa X for all 1 ad all A A. µa = µa X = lim µa X = lim µa X = µa X = µa, ad the theorem is proved. Measures which satisfy property ii i Theorem 2.1 have a special ame, which we ow itroduce. Defiitio 2.5. A measure space X, A, µ is σ-fiite if there exists a sequece {X } 1 of elemets i A such that X X +1 for 1, X = X ad µx < for all. 3. Existece of the product measure of two measures Let, A 1, µ 1 ad, A 2, µ 2 be two measure spaces, ad let A 1 A 2 be the product σ-algebra o : this is the smallest σ-algebra o that cotais the collectio C of measurable rectagles. If A A 1 A 2 ad x 1, x 2, we cosider the followig sets A x 2 = {x 1 x 1, x 2 A}, A x 1 = {x 2 x 1, x 2 A}. Thus, if A = A 1 A 2 C, the A x 2 = A 1 if x 2 A 2 ad A x 2 = if x 2 / A 2. Similarly for A x 1. We have the followig result. Lemma 3.1. For all A A 1 A 2, x 1 ad x 2 we have A x 2 A 1 ad A x 1 A 2. Theorem 3.2. Assume that, A 1, µ 1 ad, A 2, µ 2 are two fiite measure spaces, meaig µ k X k < for k = 1, 2. Let A A 1 A 2. The, with f = χ A, f : [0, ], the followig hold: 1 The fuctio [0, ] with x 1 fx 1, x 2 is A 1 -measurable for each x 2 i. 2 The fuctio [0, ] with x 2 fx 1, x 2 is A 2 -measurable for each x 1 i. 3 The fuctio g A : [0, ] with x 1 fx 1, x 2 dµ 2 x 2 is A 1 -measurable. 4 The fuctio h A : [0, ] with x 2 fx 1, x 2 dµ 1 x 1 is A 2 -measurable. Moreover, the followig holds: 5 fx 1, x 2 dµ 2 x 2 dµ 1 x 1 = fx 1, x 2 dµ 1 x 1 dµ 2 x 2.
5 Proof. Let D deote the collectio of measurable sets A i A 1 A 2 such that the statemets 1-5 hold. We claim that D cotais all measurable rectagles from C. To see this, let A = A 1 A 2 C. The the fuctio i 1 is either χ A1 if x 2 A 2 or 0 if x 2 \ A 2, so is A 1 -measurable. A similar argumet applies for 2. The fuctio g A i 3 is µ 2 A 2 χ A1, so is A 1 -measurable, ad similarly for h A. Fially, ote that both sides i 5 equal µ 1 A 1 µ 2 A 2. Our claim is therefore proved. Sice sets i C geerate A 1 A 2 ad C is closed uder fiite itersectios accordig to Lemma 1.1, it will follow from Lemma 2.4 that the theorem is valid if we show that D is a Dyki system. By defiitio, D. Let A D. Sice χ A c = 1 χ A, it is easy to verify that 1-2 hold for f = χ A c. Usig that µ 2 is fiite, the fuctio i 3 is g A cx 1 = µ 2 A 2 µ 2 A x 1, ad so is A 1 -measurable. A similar argumet shows that the fuctio i 4 is measurable. To verify that 5 holds for f = χ A c, ote that sice µ 1, µ 2 are fiite measures we have g A cx 1 dµ 1 x 1 = µ 2 µ 2 A x 1 dµ 1 x 1 = µ 1 µ 2 χ A x 1, x 2 dµ 2 x 2 dµ 1 x 1 X 2 = µ 1 µ 2 χ A x 1, x 2 dµ 1 x 1 dµ 2 x 2 X 1 = h A cx 2 dµ 2 x 2, as eeded. It remais to prove that D is closed uder disjoit coutable uios. For this, we prove first that D is closed uder fiite disjoit uios. Let A i D, i = 1,..., such that A i A j = wheever i j. The also A i x 2 A j x 2 = wheever i j, for all x 2. Note that i A i x 2 = i A i x 2, for each x 2. By additivity of µ 1, it the follows that the fuctio i 4 correspodig to i=1a i is x 2 i=1 h A x 2, ad so is A i 2 -measurable. Sice the itegral ad fiite sums of measurable fuctios iterchage order, 5 follows from h i A i dµ 2 = h Ai dµ 2 i=1 = g Ai dµ 1 by 5 for each A i i=1 = g i A i dµ 1. Now we show that D is closed uder icreasig uios. Let C i D for i 1 such that C i C i+1 for i 1. Note the that C i x 2 C i+1 x 2 for each x 2. Sice µ 1 is a 5
6 6 fiite measure, h Ci+1 x 2 h Ci x 2 = µ 1 C i+1 x 2 µ 1 C i x 2 = µ 1 C i+1 x 2 \ C i x 2 0. Thus {h Ci } i is a odecreasig sequece of A 2 -measurable fuctios. The poitwise limit of {h Ci } i is also A 2 -measurable, ad by the mootoe covergece theorem we have lim h Ci dµ 2 = lim h Ci dµ 2. i X i 2 Now ote that cotiuity of µ 1 implies that lim i h Ci x 2 = lim i µ 1 C i x 2 = µ 1 i C i x 2. Similarly, by applyig the mootoe covergece theorem to g Ci ad by usig assumptio 5 for all C i we get that g Ci dµ 1 = lim g Ci dµ 1 = lim h Ci dµ 1 = h Ci dµ 2, X i 1 X i 1 which shows that i C i D, as claimed. I all, we have showed that D is a Dyki system. By Lemma 2.4, we have DC = σc. Sice σc = A 1 A 2, it follows that A 1 A 2 D, so the theorem is proved. Theorem 3.3. Let, A 1, µ 1 ad, A 2, µ 2 be σ-fiite measure spaces. The statemets 1-5 of Theorem 3.2 hold. Proof. By the hypothesis, there are sets X i, Σ i for 1 ad i = 1, 2 such that {X i, } is icreasig, µ i X i, < for all i = 1, 2 ad 1, ad X i = X i, for i = 1, 2. I order to reduce the problem to the fiite case we ote that the assigmets µ 1, B = µ 1 B, ad µ 2, C = µ 2 C, for B A 1, C A 2, 1, give fiite measures o A 1 ad A 2, respectively. Note for later use that h dµ 1, = hχ X1, dµ 1 for ay oegative measurable fuctio first check for h a simple fuctio, the approximate by oegative simple fuctios to get the claim i geeral. Similarly for µ 2, ad all. Applyig Theorem 3.2 to µ 1, ad µ 2, for all 1 gives 6 g A x 1 dµ 1, x 1 = h A x 2 dµ 2, x 2 for all A A 1 A 2. By the observatio i the previous paragraph, we have g A χ X1, dµ 1 = h A χ X2, dµ 2 for all 1. Now we take the limit as ad use that {, } icreases to ad {, } icreases to. Therefore the mootoe covergece theorem, applied i both the right- ad left-had side, shows that 5 holds i this case. The other statemets ca be verified i a similar way.
7 Theorem 3.4. Let, A 1, µ 1 ad, A 2, µ 2 be two σ-fiite measure spaces. The there exists a uique measure o, A 1 A 2, deoted µ 1 µ 2, such that 7 µ 1 µ 2 A 1 A 2 = µ 1 A 1 µ 2 A 2, A 1 A 1, A 2 A 2. Furthermore, for each A A 1 A 2 we have 8 µ 1 µ 2 A = χ A x 1, x 2 dµ 2 x 2 dµ 1 x 1 X 2 9 = χ A x 1, x 2 dµ 1 x 1 dµ 2 x 2. Proof. We defie µ 1 µ 2 A by the value of ay of the double itegrals above. These quatities are equal by Theorem Clearly 7 holds ad µ 1 µ 2 = 0. It remais to show that µ 1 µ 2 is coutably additive. Let {A } be a disjoit sequece i A 1 A 2 ad let A = A. Note that for ay x 1 we have A x 1 = A x 1, 7 where the secod uio is disjoit i. Sice µ 2 is coutably additive, we have g A x 1 = µ 2 A x 1 = µ 2 A x 1 = g A x 1 for each x 1. Hece, by a corollary to the mootoe covergece theorem, it follows that µ 1 µ 2 A = g A dµ 1 = g A dµ 1 = µ 1 µ 2 A, showig that µ 1 µ 2 is a measure. To show uiqueess of µ 1 2 amog all measures o A 1 A 2 which satisfy 7, ote that this will follow from Theorem 2.1 because A 1 A 2 is geerated by C if we show that µ 1 µ 2 is σ-fiite. Sice µ i for i = 1, 2 are σ-fiite, there are sequeces X i, A i for 1 ad i = 1, 2 such that {X i, } icreases to X i, ad µ i X i, < for all i = 1, 2 ad 1. The {,, } icreases to. Moreover, so ideed µ 1 µ 2 is σ-fiite. µ 1 µ 2,, = µ 1, µ 2, <, Note: a alterative proof of the existece of the product measure is give by Theorem 6.4 i [1] ad of the uiqueess by Theorem 6.5 i [1]. Our proof of existece ad uiqueess ca be see as icorporatig Lemmas 6.8 ad 6.9 i [1]. 4. Toelli s ad Fubii s theorems Let X i, A i, µ i be σ-fiite measure spaces for i = 1, 2 ad let µ 1 µ 2 be the product measure o A 1 A 2 give by Theorem 3.4. Give a fuctio f : R, defie its sectios at x 1 ad x 2 by f x2 x 1 = fx 1, x 2 ad f x1 x 2 = fx 1, x 2.
8 8 Propositio 4.1. If f : R is A 1 A 2 -measurable, the f x2 : R is A 1 -measurable for every x 2. Similarly, f x1 : R is A 2 -measurable for every x 1. Proof. Sice f is measurable, for ay r R the set A = {x 1, x 2 fx 1, x 2 r, ]} is i A 1 A 2. But {x 1 f x2 x 1 r, ]} = {x 1 x 1, x 2 A}, i other words fx 1 2 r, ] = A x 2, which lies i A 1 by lemma. Sice r R is arbitrary, the claim for f x2 follows. The proof i the case of f x1 is similar. Note: the coclusio of the propositio is also valid for a complex-valued measurable fuctio f o. The proof is similar to the above or see Propositio 6.10 i [1]. Theorem 4.2. Toelli s theorem Let X i, A i, µ i be σ-fiite measure spaces for i = 1, 2 ad let µ 1 µ 2 be the product measure o A 1 A 2. Suppose that f : [0, ] is A 1 A 2 -measurable. The the fuctios x 1 f x1 dµ 2 ad x 2 f x2 dµ 1 are measurable, ad 10 f dµ 1 µ 2 = fx 1, x 2 dµ 1 x 1 dµ 2 x 2 X 1 11 = fx 1, x 2 dµ 2 x 2 dµ 1 x 1. Proof. The case whe f = χ A for A Σ 1 Σ 2 was doe i Theorem 3.3. By liearity the result exteds to simple fuctios o. Next let {s } be a sequece of simple fuctios o such that s 0, s s +1 for all 1, ad s f poitwise. Thus we have for every 1 that 12 s dµ 1 µ 2 = s x 1, x 2 dµ 1 x 1 dµ 2 x 2 X 1 13 = s x 1, x 2 dµ 2 x 2 dµ 1 x 1. For every fixed x 2 the sequece {s x2 } of fuctios R is icreasig ad coverget to f x2 at every poit x 1. By the mootoe covergece theorem, f x2 dµ 1 = lim s x2 dµ 1. X 1 Sice the theorem is true for simple fuctios, the fuctio F x 2 := s x2 dµ 1 is A 2 -measurable for all 1. Moreover, F F +1 for all 1 by properties of the itegral of oegative fuctios. It follows that lim F is measurable, which meas precisely that x 2 f x2 dµ 1 is A 2 -measurable. Aother applicatio of the mootoe covergece theorem gives lim F x 2 dµ 2 x 2 = lim F x 2 dµ 2 x 2, X 2
9 which rewrites as lim s x2 dµ 1 dµ2 x 2 = f x2 x 1 dµ 1 x 1 dµ 2 x 2. By 12, the term i the left-had side is lim s dµ 1 µ 2, which coverges to the itegral f dµ 1 µ 2 agai by the mootoe covergece theorem. Thus we obtai 10. The other equality is proved i a similar way. Theorem 4.3. Let X i, A i, µ i be σ-fiite measure spaces for i = 1, 2 ad let µ 1 µ 2 be the product measure o A 1 A 2. Suppose that f : R or to C is itegrable. The the followig assertios are true: 1 The fuctio f x2 is i L 1, A 1, µ 1 for µ 2 -a.e. x 2. Likewise, f x1 is i L 1, A 2, µ 2 for µ 1 - a.e. x 1. 2 The fuctios x 1 f x1 dµ 2 ad x 2 f x2 dµ 1 are defied µ 1 -a.e. o ad µ 2 -a.e. o, respectively. Further, they belog to L 1, A 1, µ 1 ad L 1, A 2, µ 2, respectively, ad fx 1, x 2 dµ 1 x 1 14 dµ 2 x 2 = f dµ 1 µ 2 X 2 15 = fx 1, x 2 dµ 2 x 2 dµ 1 x 1. Proof. See the proof of Theorem 6.7 i [1]. Refereces [1] J.N. McDoald ad N.A. Weiss, A course i Real Aalysis, 2d editio, Academic Press, Amsterdam, [2] G. Teschl, Topics i real ad fuctioal aalysis, gerald/ftp/bookfa/idex.html. 9
FUNDAMENTALS OF REAL ANALYSIS by. V.1. Product measures
FUNDAMENTALS OF REAL ANALSIS by Doğa Çömez V. PRODUCT MEASURE SPACES V.1. Product measures Let (, A, µ) ad (, B, ν) be two measure spaces. I this sectio we will costruct a product measure µ ν o that coicides
More informationMeasure and Measurable Functions
3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies
More informationIntegrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number
MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios
More informationLecture 3 The Lebesgue Integral
Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationSolution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1
Solutio Sagchul Lee October 7, 017 1 Solutios of Homework 1 Problem 1.1 Let Ω,F,P) be a probability space. Show that if {A : N} F such that A := lim A exists, the PA) = lim PA ). Proof. Usig the cotiuity
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationChapter IV Integration Theory
Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationChapter 0. Review of set theory. 0.1 Sets
Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.
More informationA Proof of Birkhoff s Ergodic Theorem
A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More informationHere are some examples of algebras: F α = A(G). Also, if A, B A(G) then A, B F α. F α = A(G). In other words, A(G)
MATH 529 Probability Axioms Here we shall use the geeral axioms of a probability measure to derive several importat results ivolvig probabilities of uios ad itersectios. Some more advaced results will
More informationThe Boolean Ring of Intervals
MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,
More informationIntroduction to Probability. Ariel Yadin. Lecture 7
Itroductio to Probability Ariel Yadi Lecture 7 1. Idepedece Revisited 1.1. Some remiders. Let (Ω, F, P) be a probability space. Give a collectio of subsets K F, recall that the σ-algebra geerated by K,
More informationSingular Continuous Measures by Michael Pejic 5/14/10
Sigular Cotiuous Measures by Michael Peic 5/4/0 Prelimiaries Give a set X, a σ-algebra o X is a collectio of subsets of X that cotais X ad ad is closed uder complemetatio ad coutable uios hece, coutable
More informationLecture 3 : Random variables and their distributions
Lecture 3 : Radom variables ad their distributios 3.1 Radom variables Let (Ω, F) ad (S, S) be two measurable spaces. A map X : Ω S is measurable or a radom variable (deoted r.v.) if X 1 (A) {ω : X(ω) A}
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 informationThe Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.
Lecture 7: Measure ad Category The Borel hierarchy classifies subsets of the reals by their topological complexity. Aother approach is to classify them by size. Filters ad Ideals The most commo measure
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationIntroduction to Probability. Ariel Yadin. Lecture 2
Itroductio to Probability Ariel Yadi Lecture 2 1. Discrete Probability Spaces Discrete probability spaces are those for which the sample space is coutable. We have already see that i this case we ca take
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationThe Pointwise Ergodic Theorem and its Applications
The Poitwise Ergodic Theorem ad its Applicatios Itroductio Peter Oberly 11/9/2018 Algebra has homomorphisms ad topology has cotiuous maps; i these otes we explore the structure preservig maps for measure
More informationMATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and
MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f
More informationlim za n n = z lim a n n.
Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget
More informationMath 341 Lecture #31 6.5: Power Series
Math 341 Lecture #31 6.5: Power Series We ow tur our attetio to a particular kid of series of fuctios, amely, power series, f(x = a x = a 0 + a 1 x + a 2 x 2 + where a R for all N. I terms of a series
More informationFUNDAMENTALS OF REAL ANALYSIS by
FUNDAMENTALS OF REAL ANALYSIS by Doğa Çömez Backgroud: All of Math 450/1 material. Namely: basic set theory, relatios ad PMI, structure of N, Z, Q ad R, basic properties of (cotiuous ad differetiable)
More informationNotes on Snell Envelops and Examples
Notes o Sell Evelops ad Examples Example (Secretary Problem): Coside a pool of N cadidates whose qualificatios are represeted by ukow umbers {a > a 2 > > a N } from best to last. They are iterviewed sequetially
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More information1 Convergence in Probability and the Weak Law of Large Numbers
36-752 Advaced Probability Overview Sprig 2018 8. Covergece Cocepts: i Probability, i L p ad Almost Surely Istructor: Alessadro Rialdo Associated readig: Sec 2.4, 2.5, ad 4.11 of Ash ad Doléas-Dade; Sec
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More informationMath Solutions to homework 6
Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there
More information1 Introduction. 1.1 Notation and Terminology
1 Itroductio You have already leared some cocepts of calculus such as limit of a sequece, limit, cotiuity, derivative, ad itegral of a fuctio etc. Real Aalysis studies them more rigorously usig a laguage
More informationM17 MAT25-21 HOMEWORK 5 SOLUTIONS
M17 MAT5-1 HOMEWORK 5 SOLUTIONS 1. To Had I Cauchy Codesatio Test. Exercise 1: Applicatio of the Cauchy Codesatio Test Use the Cauchy Codesatio Test to prove that 1 diverges. Solutio 1. Give the series
More information5 Many points of continuity
Tel Aviv Uiversity, 2013 Measure ad category 40 5 May poits of cotiuity 5a Discotiuous derivatives.............. 40 5b Baire class 1 (classical)............... 42 5c Baire class 1 (moder)...............
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 Fuctioal Law of Large Numbers. Costructio of the Wieer Measure Cotet. 1. Additioal techical results o weak covergece
More informations = and t = with C ij = A i B j F. (i) Note that cs = M and so ca i µ(a i ) I E (cs) = = c a i µ(a i ) = ci E (s). (ii) Note that s + t = M and so
3 From the otes we see that the parts of Theorem 4. that cocer us are: Let s ad t be two simple o-egative F-measurable fuctios o X, F, µ ad E, F F. The i I E cs ci E s for all c R, ii I E s + t I E s +
More informationAssignment 5: Solutions
McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationMAS111 Convergence and Continuity
MAS Covergece ad Cotiuity Key Objectives At the ed of the course, studets should kow the followig topics ad be able to apply the basic priciples ad theorems therei to solvig various problems cocerig covergece
More informationDANIELL AND RIEMANN INTEGRABILITY
DANIELL AND RIEMANN INTEGRABILITY ILEANA BUCUR We itroduce the otio of Riema itegrable fuctio with respect to a Daiell itegral ad prove the approximatio theorem of such fuctios by a mootoe sequece of Jorda
More informationMathematical Induction
Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a
More informationMath F215: Induction April 7, 2013
Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here
More informationMA131 - Analysis 1. Workbook 3 Sequences II
MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................
More informationf n (x) f m (x) < ɛ/3 for all x A. By continuity of f n and f m we can find δ > 0 such that d(x, x 0 ) < δ implies that
Lecture 15 We have see that a sequece of cotiuous fuctios which is uiformly coverget produces a limit fuctio which is also cotiuous. We shall stregthe this result ow. Theorem 1 Let f : X R or (C) be a
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationLecture 4: Grassmannians, Finite and Affine Morphisms
18.725 Algebraic Geometry I Lecture 4 Lecture 4: Grassmaias, Fiite ad Affie Morphisms Remarks o last time 1. Last time, we proved the Noether ormalizatio lemma: If A is a fiitely geerated k-algebra, the,
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationMcGill University Math 354: Honors Analysis 3 Fall 2012 Solutions to selected problems
McGill Uiversity Math 354: Hoors Aalysis 3 Fall 212 Assigmet 3 Solutios to selected problems Problem 1. Lipschitz fuctios. Let Lip K be the set of all fuctios cotiuous fuctios o [, 1] satisfyig a Lipschitz
More informationIntroductory Ergodic Theory and the Birkhoff Ergodic Theorem
Itroductory Ergodic Theory ad the Birkhoff Ergodic Theorem James Pikerto Jauary 14, 2014 I this expositio we ll cover a itroductio to ergodic theory. Specifically, the Birkhoff Mea Theorem. Ergodic theory
More informationSOME GENERALIZATIONS OF OLIVIER S THEOREM
SOME GENERALIZATIONS OF OLIVIER S THEOREM Alai Faisat, Sait-Étiee, Georges Grekos, Sait-Étiee, Ladislav Mišík Ostrava (Received Jauary 27, 2006) Abstract. Let a be a coverget series of positive real umbers.
More informationAn introduction to stochastic integration with respect to continuous semimartingales
A itroductio to stochastic itegratio with respect to cotiuous semimartigales Alexader Sool Departmet of Mathematical Scieces Uiversity of Copehage Departmet of Mathematical Scieces Uiversity of Copehage
More informationNotes 19 : Martingale CLT
Notes 9 : Martigale CLT Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: [Bil95, Chapter 35], [Roc, Chapter 3]. Sice we have ot ecoutered weak covergece i some time, we first recall
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationPart II Probability and Measure
Part II Probability ad Measure Based o lectures by J. Miller Notes take by Dexter Chua Michaelmas 2016 These otes are ot edorsed by the lecturers, ad I have modified them (ofte sigificatly) after lectures.
More informationB Supplemental Notes 2 Hypergeometric, Binomial, Poisson and Multinomial Random Variables and Borel Sets
B671-672 Supplemetal otes 2 Hypergeometric, Biomial, Poisso ad Multiomial Radom Variables ad Borel Sets 1 Biomial Approximatio to the Hypergeometric Recall that the Hypergeometric istributio is fx = x
More informationChapter 7 Isoperimetric problem
Chapter 7 Isoperimetric problem Recall that the isoperimetric problem (see the itroductio its coectio with ido s proble) is oe of the most classical problem of a shape optimizatio. It ca be formulated
More informationReal and Complex Analysis, 3rd Edition, W.Rudin
Real ad Complex Aalysis, 3rd ditio, W.Rudi Chapter 6 Complex Measures Yug-Hsiag Huag 206/08/22. Let ν be a complex measure o (X, M ). If M, defie { } µ () = sup ν( j ) : N,, 2, disjoit, = j { } ν () =
More information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More informationHOMEWORK #4 - MA 504
HOMEWORK #4 - MA 504 PAULINHO TCHATCHATCHA Chapter 2, problem 19. (a) If A ad B are disjoit closed sets i some metric space X, prove that they are separated. (b) Prove the same for disjoit ope set. (c)
More informationExercises 1 Sets and functions
Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationCouncil for Innovative Research
ABSTRACT ON ABEL CONVERGENT SERIES OF FUNCTIONS ERDAL GÜL AND MEHMET ALBAYRAK Yildiz Techical Uiversity, Departmet of Mathematics, 34210 Eseler, Istabul egul34@gmail.com mehmetalbayrak12@gmail.com I this
More informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More informationFall 2013 MTH431/531 Real analysis Section Notes
Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters
More information7 Sequences of real numbers
40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More informationThe log-behavior of n p(n) and n p(n)/n
Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity
More informationMath 104: Homework 2 solutions
Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does
More informationIntegration Theory: Lecture notes 2013
Itegratio Theory: Lecture otes 203 Joha Joasso September 203 Preface These lecture otes are writte whe the course i itegratio theory is for the first time i more tha twety years, give joitly by the the
More informationMath 220A Fall 2007 Homework #2. Will Garner A
Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative
More information2.4 Sequences, Sequences of Sets
72 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.4 Sequeces, Sequeces of Sets 2.4.1 Sequeces Defiitio 2.4.1 (sequece Let S R. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For each
More informationRiesz-Fischer Sequences and Lower Frame Bounds
Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.
More informationACM 105: Applied Real and Functional Analysis. Solutions to Homework # 1.
ACM 15: Applied Real ad Fuctioal Aalysis. Solutios to Homewor # 1. Ady Greeberg, Alexei Noviov Problem 1. Beroulli sequeces. a. I = {x l : x = a}. But by costructio of Beroulli sequeces, a ca oly be ±1.
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More information5 Birkhoff s Ergodic Theorem
5 Birkhoff s Ergodic Theorem Amog the most useful of the various geeralizatios of KolmogorovâĂŹs strog law of large umbers are the ergodic theorems of Birkhoff ad Kigma, which exted the validity of the
More informationAdvanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology
Advaced Aalysis Mi Ya Departmet of Mathematics Hog Kog Uiversity of Sciece ad Techology September 3, 009 Cotets Limit ad Cotiuity 7 Limit of Sequece 8 Defiitio 8 Property 3 3 Ifiity ad Ifiitesimal 8 4
More informationSequences and Series
Sequeces ad Series Sequeces of real umbers. Real umber system We are familiar with atural umbers ad to some extet the ratioal umbers. While fidig roots of algebraic equatios we see that ratioal umbers
More informationsin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =
60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece
More informationINFINITE SEQUENCES AND SERIES
INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is
More informationChapter 8. Euler s Gamma function
Chapter 8 Euler s Gamma fuctio The Gamma fuctio plays a importat role i the fuctioal equatio for ζ(s that we will derive i the ext chapter. I the preset chapter we have collected some properties of the
More informationIntroduction to Functional Analysis
MIT OpeCourseWare http://ocw.mit.edu 18.10 Itroductio to Fuctioal Aalysis Sprig 009 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. LECTURE OTES FOR 18.10,
More informationProperties of Fuzzy Length on Fuzzy Set
Ope Access Library Joural 206, Volume 3, e3068 ISSN Olie: 2333-972 ISSN Prit: 2333-9705 Properties of Fuzzy Legth o Fuzzy Set Jehad R Kider, Jaafar Imra Mousa Departmet of Mathematics ad Computer Applicatios,
More informationProbability for mathematicians INDEPENDENCE TAU
Probability for mathematicias INDEPENDENCE TAU 2013 28 Cotets 3 Ifiite idepedet sequeces 28 3a Idepedet evets........................ 28 3b Idepedet radom variables.................. 33 3 Ifiite idepedet
More informationb i u x i U a i j u x i u x j
M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here
More informationCommon Coupled Fixed Point of Mappings Satisfying Rational Inequalities in Ordered Complex Valued Generalized Metric Spaces
IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578, p-issn:319-765x Volume 10, Issue 3 Ver II (May-Ju 014), PP 69-77 Commo Coupled Fixed Poit of Mappigs Satisfyig Ratioal Iequalities i Ordered Complex
More informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationn=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n
Series. Defiitios ad first properties A series is a ifiite sum a + a + a +..., deoted i short by a. The sequece of partial sums of the series a is the sequece s ) defied by s = a k = a +... + a,. k= Defiitio
More informationChapter 8. Euler s Gamma function
Chapter 8 Euler s Gamma fuctio The Gamma fuctio plays a importat role i the fuctioal equatio for ζ(s) that we will derive i the ext chapter. I the preset chapter we have collected some properties of the
More informationPart A, for both Section 200 and Section 501
Istructios Please write your solutios o your ow paper. These problems should be treated as essay questios. A problem that says give a example or determie requires a supportig explaatio. I all problems,
More information