A Proof of Birkhoff s Ergodic Theorem
|
|
- Gordon Doyle
- 6 years ago
- Views:
Transcription
1 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 me this proof, as commuicated to him by a colleague, Mate Wierdl. It s hard to fid it i prit, so here it is. 2 The Theorem ad the Proof Theorem 2. (Birkhoff). Let (, B, µ, T ) be a measure-preservig system o a σ-fiite measure space, ad let f be a itegrable fuctio. The lim f(t k (x)) k=0 coverges for almost every x, ad the resultig fuctio f is i L, with f T = f almost everywhere ad f f. If µ() <, the f dµ = f dµ. Corollary 2.2. If (, B, µ, T ) is ergodic, the f as obtaied above is almost everywhere costat, ad if µ() <, the f = f dµ. µ() Proof of Birkhoff s Ergodic Theorem. We split the proof ito two parts: first, assumig the almost everywhere existece of the limit of the ergodic averages, we prove that it has the requisite properties. Secod, we prove that the limit exists for all L fuctios. So for ow, let f L (µ) ad assume that the limit f(x) = lim f(t i (x)) exists for almost every x. As a limit of a sum of measurable fuctios, f is measurable, ad by Fatou s lemma, we have: f dµ = lim f(t i (x) dµ(x) (Fatou s Lemma) lim if f(t i (x) dµ(x) ivariace = lim if = lim if f(x) dµ(x) f = f.
2 Hece f is itegrable, with f f. Precomposig by T gives us: f(t (x)) = lim = lim = f(x). f(x) 0 f(t i+ (x)) = lim f(t i (x)) i= f(t i (x)) So we have that f is T -ivariat. Lastly for this part, suppose that µ() <. We will show that for ay bouded f L (µ), we have f dµ = f dµ, ad bootstrap to show it for ubouded f. So let f L (µ) be bouded, with f C <. The we have f(t i (x)) C = C, ad C dµ = C dµ = Cµ() <, so g C is a itegrable majorat for this sequece, which allows us to apply the Lebesgue Domiated Covergece Theorem: f dµ = = lim lim f(t i (x)) dµ f(t i (x)) dµ = lim f dµ = f dµ, usig T -ivariace i the last steps. Now let f be ubouded, ad let ɛ > 0; we may fid f B L (µ) which is bouded, with f f B < ɛ 2. By the above argumet, f f B f f B < ɛ 2. We the approximate the differece of the itegrals: f dµ f dµ f dµ f B dµ + f B dµ = f f B dµ + f B f dµ f f B dµ + f B f dµ f f B + f f B < ɛ 2 + ɛ 2 = ɛ. f B dµ + f B dµ f dµ 2
3 Sice ɛ was arbitrary, we have f dµ = as desired. We ow oly have to prove that for every f L (µ), the poitwise limit of the ergodic averages coverges almost everywhere. There are four mai steps of the proof, together with some mior argumets.. Prove a maximal ergodic lemma for l (Z). f dµ, 2. Use this lemma to prove a maximal ergodic lemma for L (, µ). 3. Show that the subset of L fuctios satisfyig the BET is closed i L. 4. Fid a dese subset of L for which the BET holds. Everythig will be doe for real-valued fuctios; oce it is prove, the result holds for a complex-valued fuctio by writig the the fuctio as a sum of a real fuctio ad aother real fuctio multiplied by the imagiary uit. As well, we will do the mai proof i the case of a probability space, ad the show how to exted the result to a σ-fiite space. Or at least, we would, if I kew how to do it. See Halmos s Lectures o Ergodic Theory or similar for a proof that works i the σ-fiite case. Sorry. Step : This lemma is of a more combiatorial ature. Lemma 2.3 (Maximal Ergodic Lemma for l (Z)). Let a l (Z), ad deote The we have, for ay positive real umber λ, j M a () = sup a( + i). j j : M a () λ a λ. Proof. First, assume that the statemet holds whe λ =. Now, let λ > 0 be fixed, ad let ã = λa. The we have: : M a () λ = : Mã() ã = λ a. Hece we eed oly prove the claim for λ =. Note that because a l (Z), a a(i) <, so M a () is actually a maximum, because the averagig factor j forces the terms towards 0. Let 0 < ɛ <. Agai because a l (Z), we fid M R ad idices k k 2 Z such that a > M > a ɛ, ad M = k 2 i=k a(i). This says that almost all of the mass is cotaied betwee two idices. We observe that for < k (M +), there is a boud o the value of M a (). For j = 0,..., k, we have j a( + i) < j j ɛ <, ad for j > k, we have that j > k > M +, by defiitio of, so that j a( + i) < M + (ɛ + M) < j M + M + =. Hece M a () < for < k. For > k 2, the we clearly have M a () <, as less tha ɛ of the weight is after k 2. Therefore : M a () is fiite. Deote A = : M a (). 3
4 Let 0 = mi A, ad defie j 0 = max j : j j m=0 a( 0 + m) which we ca do because M a ( 0 ) is a hoest maximum. The iductively defie i = mi A, > i + j i, ad j j i = max j : a( i + m), j for i =... k, sice A is fiite. The sets i,..., i + j i are disjoit, which meas à = m=0 k i,..., i + j i is a disjoit uio, ad we see that A Ã. This implies: ad so we are doe. a k j i m=0 a( i + m) j i k k j i = i,..., i + j i = à A = : M a (), Step 2: This is a so-called trasferece priciple, where we obtai the result i a more complicated space by bootstrappig from the l (Z) case. Lemma 2.4 (Maximal Ergodic Lemma for L (, µ)). Let (, B, µ, T ) be a measure-preservig system, ad let f be a itegrable fuctio. Defie, for each x, The for ay positive real umber λ, we have Mf(x) = sup j j j f(t i (x)). µ(x : Mf(x) λ) f λ. Proof. The same proof as i the l (Z) case applies to show that it suffices to prove the lemma for λ =. So assume λ =. We shall perform two trucatios, to allow us to deal with fiite summatios. Let K N +, ad defie f x,k : Z R by f(t (x)) 0 K, f x,k () = 0 < 0, > K. The for µ-almost every x, f x,k l (Z) as it is a fiite sum (it is t summable everywhere because f could be ifiite o a set B of measure zero), ad for a fixed, f,k () = f(t ( )) is both measurable ad itegrable (the latter by T -ivariace of µ). Because Z is coutable, we see that f,k ( ) is a measurable fuctio o Z. For ay fuctio g L µ, ad N N +, we defie M N g : R, by M N g(x) = max j N j 4 j f(t i (x)).,
5 Note that as a maximum of a sum of measurable fuctios, M N f is measurable. We also have that Mf(x) = lim N M Nf(x), by defiitio, so that Mf is measurable. Now, observe that for N < N 2, we have M N f(x) M N2 f(x), so that we have a icreasig chai of subsets of, give by x : M N f(x). If we were able to prove that µ(x : M N f(x) ) f for all N, the we would be able to show the result for Mf, by cotiuity of the measure µ alog chais: µ(x : Mf(x) ) = µ( x : lim M N f(x) ) N = lim N µ(x : M Nf(x) ) lim N f = f. So it is ow our goal to show that the result holds for ay N. If we let N >> K, the we see that because a large umber of the terms i the sum are zero, the followig idetity is true: M N f x,k () = max j N j j f(t ((T i (x))) = max j N j j f(t +i (x)) = M fx,k (), where we use the otatio from the previous lemma for summable fuctios. This allows us to apply Lemma 2.3, to obtai (writig c for the orm o l (Z)): We may ow prove the lemma: f x,k c : M fx,k () = : MN f x,k (). K f = = (by Fubii) = (by Fubii) = (T ivariace of µ) = K =0 K = =0 K =0 f(x) dµ(x) = K =0 f x,k () dµ(x) = f x,k () dµ(x) = f(t (x)) dµ(x) (by T ivariace) Z f x,k c : M N f x,k () dµ(x) K =0 K =0 K =0 : MN f x,k () () dµ(x) x : MN (f T )(x) (x) dµ(x) x : MN f(x) (x) dµ(x) = Kµ(x : M N f(x) ). f x,k () dµ c(x, ) dµ(x) Hece we obtai µ(x : M N f(x) ) f for all N >> K, ad thus we get by the earlier remark. µ(x : Mf(x) ) f 5
6 Step 3: We ow show that the set of L fuctios satisfyig the BET is closed. Suppose that f k k= L (µ) with each f k satisfyig the BET, with the correspodig T -ivariat fuctio deoted f k, ad f k f i L. Deote Ā f (x) = lim sup f(t i (x)), A f (x) = lim if f(t i (x)). k Lemma 2.5. We have µ( x : Ā f (x) A f (x) > 0 ) = 0, ad hece the limit fuctio f exists almost everywhere o. Proof. We may boud the differece of Ā f (x) ad A f (x). ivolvig limit supremums ad ifimums: For ay k, we have, by applyig iequalities Ā f (x) A f (x) = lim sup = lim sup lim if f(t i (x)) lim if f(t i (x)) ( ) f k (T i (x)) + (f f k )(T i (x)) ( ) f k (T i (x)) + (f f k )(T i (x)) = f k (x) + lim sup lim sup sup 2(f fk )(T i (x)) 2(f fk )(T i (x)) = M(2(f f k ))(x). (f f k )(T i (x)) f k (x) lim if (f f k )(T i (x)) From here, fix ɛ > 0, ad pick δ > 0 such that for all sufficietly large k, f k f < ɛδ 2. We may apply Lemma 2.4 i the case of 2(f f k ), where k is large eough to obtai: µ( x : Ā f (x) A f (x) > ɛ ) µ(x : M(2(f f k ))(x) > ɛ) 2(f f k) ɛ We picked δ arbitrarily, so that ad ɛ was also arbitrary, so that µ( x : Ā f (x) A f (x) > ɛ ) = 0, < 2ɛδ 2ɛ = δ. Hece Āf = A f µ-almost everywhere, so that exists µ-almost everywhere. µ( x : Ā f (x) A f (x) > 0 ) = 0. f(x) = lim f(t i (x)) Hece the set of L fuctios which satisfy the BET is closed i the L sese. Step 4: Fially, we show that there is a L dese set of fuctios which satisfy the BET. We shall do this i two smaller steps: first we show that the square-itegrable fuctios are dese i L (µ), the we explicitly fid our desired set. 6
7 Lemma 2.6. Supposig that µ() <, we have L 2 (µ) L (µ), ad moreover L 2 (µ) is dese i the L sese i L (µ). Proof. We are still assumig that µ() <. We first follow the proof of a result I should ve remembered from my itro measure theory class from udergrad, but i the special case of L 2 ad L. Let f L 2 (µ); the f L 2 (µ) also. We apply Cauchy-Schwarz (a special case of Hölder s Iequality): f, = f dµ f 2 2 = f 2 µ() 2 <. Thus f L (µ), so L 2 (µ) L (µ). I additio, the orm iequality meas covergece i the L 2 sese implies covergece i the L sese. Furthermore, if f L (µ), the for each N defie f : R, by f(x), f (x) = f(x) < f(x) <, f(x). The f (x) f(x), so f L (µ), ad moreover f is bouded. This meas f 2 is bouded, ad hece itegrable o, so f L 2 (µ). Fially, f f almost everywhere, so f (x) f(x) 0 for almost every x. We also have, by ispectio of the defiitio of f, that f(x) f(x) f (x) f(x) = 0 f(x) < f(x), so that f is a itegrable majorat for f f, ad so we obtai: lim f f = lim f f dµ LDCT = lim f f dµ = Hece f coverges to f i the L sese, so we are doe. 0 dµ = 0. The previous lemma serves a very useful purpose: if a sequece of L 2 fuctios f k k= coverges i the L 2 sese to a L 2 fuctio f, ad BET holds for each f k, the we see that this covergece happes i the L sese, ad so by two lemmas ago, BET holds for f also. The fial step, the, is to fid a subset of L o which BET holds, ad the L -closure of which cotais L 2. Lemma 2.7. BET holds for the subspace of L 2 coboudaries, C = f f T L 2 -closure of C, C L2. Proof. For a coboudary f f T, we have: (f f T )(T i (x)) = (f(x) f(t (x))). By Markov s Iequality, we obtai: µ x : f(t (x)) Hece for almost every x, we have 2 3 f T ( ) = f lim (f f T )(T i (x)) = 0, 0. ad so BET holds for C. By the above covergece result, BET also holds for C L2. : f L 2, ad thus for the 7
8 Lemma 2.8. The orthogoal complemet of C is C = g L 2 (µ) : hg dµ = 0, h C = g L 2 (µ) : g = g T, the set of T -ivariat fuctios i L 2, ad BET holds for this subspace. Proof. Let g C. The g g T C, by defiitio, ad we have: Addig, we obtai: g, g g T = g, g g, g T = g T, g T g, g T = g T g, g T = g T, g g T = g T, g g T = 0. 0 = = g, g g T + g T, g g T = g g T, g g T = g g T 2 2, which implies that g = g T almost everywhere. Coversely, if g is (almost) T -ivariat, ad f L 2, the we have: g, f f T = g, f g, f T = g T, f T g T, f T = 0. Hece g C, ad we get that C = g L 2 (µ) : g = g T. To coclude, observe that for g C, lim so BET holds for elemets of C. g(t i (x)) = lim g(x) g(x) = lim = g(x), We ow observe that L 2 (µ) = C L2 2 C, so that every elemet of L2(µ) may be writte as a sum of a limit of a coboudary ad a T -ivariat fuctio. If BET holds for two fuctios, it holds for their sum (by limit laws), so that BET ow holds for all of L 2 (µ). but we already kow that the L -closure of L 2 (µ) is all of L (µ), so we see that BET holds for all fuctios i L, thus completig the proof i the fiite measure case. We give the proof of the corollary of Birkhoff s theorem, Corollary 2.2. Proof. Let (µ, T ) be ergodic, let f L (µ), ad let f be the limit of the ergodic averages. We kow that f is T -ivariat, so f is almost everywhere costat. If µ() =, the sice f is itegrable, f 0 almost everywhere. If µ() <, the we have: f dµ = fµ() = f dµ, so that as desired. f(x) = f dµ, µ() Fially, we show that f is the coditioal expectatio of f with respect to the σ-algebra of T -ivariat measurable sets, T. Proof. Let A T ad let f L (µ). The we have A = T (A) = A T, ad A f L (µ), so we have: A f(x) = lim A (T i (x))f(t i (x)) = lim f(t i (x)) A (x) = f(x) A (x). 8
9 Hece, we obtai: A f dµ = f A dµ = A f dµ = f A dµ = ad so by a theorem about coditioal expectatios, f is the coditioal expectatio of f with respect to T (equality of itegrals over ay set i the σ-algebra is sufficiet ad ecessary). A f dµ, 9
Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
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 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 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 informationBIRKHOFF ERGODIC THEOREM
BIRKHOFF ERGODIC THEOREM Abstract. We will give a proof of the poitwise ergodic theorem, which was first proved by Birkhoff. May improvemets have bee made sice Birkhoff s orgial proof. The versio we give
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 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 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 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 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 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 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 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 informationMa 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5
Ma 42: Itroductio to Lebesgue Itegratio Solutios to Homework Assigmet 5 Prof. Wickerhauser Due Thursday, April th, 23 Please retur your solutios to the istructor by the ed of class o the due date. You
More informationHomework 4. x n x X = f(x n x) +
Homework 4 1. Let X ad Y be ormed spaces, T B(X, Y ) ad {x } a sequece i X. If x x weakly, show that T x T x weakly. Solutio: We eed to show that g(t x) g(t x) g Y. It suffices to do this whe g Y = 1.
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 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 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 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 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 informationMATH4822E FOURIER ANALYSIS AND ITS APPLICATIONS
MATH48E FOURIER ANALYSIS AND ITS APPLICATIONS 7.. Cesàro summability. 7. Summability methods Arithmetic meas. The followig idea is due to the Italia geometer Eresto Cesàro (859-96). He shows that eve if
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 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 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 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 informationEntropy Rates and Asymptotic Equipartition
Chapter 29 Etropy Rates ad Asymptotic Equipartitio Sectio 29. itroduces the etropy rate the asymptotic etropy per time-step of a stochastic process ad shows that it is well-defied; ad similarly for iformatio,
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 informationPower series are analytic
Power series are aalytic Horia Corea 1 1 The expoetial ad the logarithm For every x R we defie the fuctio give by exp(x) := 1 + x + x + + x + = x. If x = 0 we have exp(0) = 1. If x 0, cosider the series
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 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 informationPower series are analytic
Power series are aalytic Horia Corea 1 1 Fubii s theorem for double series Theorem 1.1. Let {α m }, be a real sequece idexed by two idices. Assume that the series α m is coverget for all ad C := ( α m
More informationREAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS
REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai
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 informationTopics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.
MATH 301 Itroductio to Aalysis Chapter Four Sequeces Topics 1. Defiitio of covergece of sequeces. 2. Fidig ad provig the limit of sequeces. 3. Bouded covergece theorem: Theorem 4.1.8. 4. Theorems 4.1.13
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 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 informationAdditional Notes on Power Series
Additioal Notes o Power Series Mauela Girotti MATH 37-0 Advaced Calculus of oe variable Cotets Quick recall 2 Abel s Theorem 2 3 Differetiatio ad Itegratio of Power series 4 Quick recall We recall here
More informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationRead carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.
THE UNIVERSITY OF WARWICK FIRST YEAR EXAMINATION: Jauary 2009 Aalysis I Time Allowed:.5 hours Read carefully the istructios o the aswer book ad make sure that the particulars required are etered o each
More informationMath 140A Elementary Analysis Homework Questions 3-1
Math 0A Elemetary Aalysis Homework Questios -.9 Limits Theorems for Sequeces Suppose that lim x =, lim y = 7 ad that all y are o-zero. Detarime the followig limits: (a) lim(x + y ) (b) lim y x y Let s
More informationMath 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions
Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationSolutions to home assignments (sketches)
Matematiska Istitutioe Peter Kumli 26th May 2004 TMA401 Fuctioal Aalysis MAN670 Applied Fuctioal Aalysis 4th quarter 2003/2004 All documet cocerig the course ca be foud o the course home page: http://www.math.chalmers.se/math/grudutb/cth/tma401/
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 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 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 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 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 information1+x 1 + α+x. x = 2(α x2 ) 1+x
Math 2030 Homework 6 Solutios # [Problem 5] For coveiece we let α lim sup a ad β lim sup b. Without loss of geerality let us assume that α β. If α the by assumptio β < so i this case α + β. By Theorem
More informationFinal Solutions. 1. (25pts) Define the following terms. Be as precise as you can.
Mathematics H104 A. Ogus Fall, 004 Fial Solutios 1. (5ts) Defie the followig terms. Be as recise as you ca. (a) (3ts) A ucoutable set. A ucoutable set is a set which ca ot be ut ito bijectio with a fiite
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 information1 Lecture 2: Sequence, Series and power series (8/14/2012)
Summer Jump-Start Program for Aalysis, 202 Sog-Yig Li Lecture 2: Sequece, Series ad power series (8/4/202). More o sequeces Example.. Let {x } ad {y } be two bouded sequeces. Show lim sup (x + y ) lim
More informationHOMEWORK #10 SOLUTIONS
Math 33 - Aalysis I Sprig 29 HOMEWORK # SOLUTIONS () Prove that the fuctio f(x) = x 3 is (Riema) itegrable o [, ] ad show that x 3 dx = 4. (Without usig formulae for itegratio that you leart i previous
More informationNotes for Lecture 11
U.C. Berkeley CS78: Computatioal Complexity Hadout N Professor Luca Trevisa 3/4/008 Notes for Lecture Eigevalues, Expasio, ad Radom Walks As usual by ow, let G = (V, E) be a udirected d-regular graph with
More informationMath 299 Supplement: Real Analysis Nov 2013
Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality
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 informationMA541 : Real Analysis. Tutorial and Practice Problems - 1 Hints and Solutions
MA54 : Real Aalysis Tutorial ad Practice Problems - Hits ad Solutios. Suppose that S is a oempty subset of real umbers that is bouded (i.e. bouded above as well as below). Prove that if S sup S. What ca
More informationReview Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =
Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:
More informationIntroductory Analysis I Fall 2014 Homework #7 Solutions
Itroductory Aalysis I Fall 214 Homework #7 Solutios Note: There were a couple of typos/omissios i the formulatio of this homework. Some of them were, I believe, quite obvious. The fact that the statemet
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 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 informationMATH 312 Midterm I(Spring 2015)
MATH 3 Midterm I(Sprig 05) Istructor: Xiaowei Wag Feb 3rd, :30pm-3:50pm, 05 Problem (0 poits). Test for covergece:.. 3.. p, p 0. (coverges for p < ad diverges for p by ratio test.). ( coverges, sice (log
More informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
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 informationMATH 413 FINAL EXAM. f(x) f(y) M x y. x + 1 n
MATH 43 FINAL EXAM Math 43 fial exam, 3 May 28. The exam starts at 9: am ad you have 5 miutes. No textbooks or calculators may be used durig the exam. This exam is prited o both sides of the paper. Good
More informationLimit superior and limit inferior c Prof. Philip Pennance 1 -Draft: April 17, 2017
Limit erior ad limit iferior c Prof. Philip Peace -Draft: April 7, 207. Defiitio. The limit erior of a sequece a is the exteded real umber defied by lim a = lim a k k Similarly, the limit iferior of a
More informationTheorem 3. A subset S of a topological space X is compact if and only if every open cover of S by open sets in X has a finite subcover.
Compactess Defiitio 1. A cover or a coverig of a topological space X is a family C of subsets of X whose uio is X. A subcover of a cover C is a subfamily of C which is a cover of X. A ope cover of X is
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics ad Egieerig Lecture otes Sergei V. Shabaov Departmet of Mathematics, Uiversity of Florida, Gaiesville, FL 326 USA CHAPTER The theory of covergece. Numerical sequeces..
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 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 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 informationNotes 27 : Brownian motion: path properties
Notes 27 : Browia motio: path properties Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces:[Dur10, Sectio 8.1], [MP10, Sectio 1.1, 1.2, 1.3]. Recall: DEF 27.1 (Covariace) Let X = (X
More informationDirichlet s Theorem on Arithmetic Progressions
Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty
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 informationPRELIM PROBLEM SOLUTIONS
PRELIM PROBLEM SOLUTIONS THE GRAD STUDENTS + KEN Cotets. Complex Aalysis Practice Problems 2. 2. Real Aalysis Practice Problems 2. 4 3. Algebra Practice Problems 2. 8. Complex Aalysis Practice Problems
More information2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F.
CHAPTER 2 The Real Numbers 2.. The Algebraic ad Order Properties of R Defiitio. A biary operatio o a set F is a fuctio B : F F! F. For the biary operatios of + ad, we replace B(a, b) by a + b ad a b, respectively.
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 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 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 informationTENSOR PRODUCTS AND PARTIAL TRACES
Lecture 2 TENSOR PRODUCTS AND PARTIAL TRACES Stéphae ATTAL Abstract This lecture cocers special aspects of Operator Theory which are of much use i Quatum Mechaics, i particular i the theory of Quatum Ope
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 informationSOME SEQUENCE SPACES DEFINED BY ORLICZ FUNCTIONS
ARCHIVU ATHEATICU BRNO Tomus 40 2004, 33 40 SOE SEQUENCE SPACES DEFINED BY ORLICZ FUNCTIONS E. SAVAŞ AND R. SAVAŞ Abstract. I this paper we itroduce a ew cocept of λ-strog covergece with respect to a Orlicz
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 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 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More informationReal Numbers R ) - LUB(B) may or may not belong to B. (Ex; B= { y: y = 1 x, - Note that A B LUB( A) LUB( B)
Real Numbers The least upper boud - Let B be ay subset of R B is bouded above if there is a k R such that x k for all x B - A real umber, k R is a uique least upper boud of B, ie k = LUB(B), if () k is
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 informationExponential Functions and Taylor Series
MATH 4530: Aalysis Oe Expoetial Fuctios ad Taylor Series James K. Peterso Departmet of Biological Scieces ad Departmet of Mathematical Scieces Clemso Uiversity March 29, 2017 MATH 4530: Aalysis Oe Outlie
More information2 Banach spaces and Hilbert spaces
2 Baach spaces ad Hilbert spaces Tryig to do aalysis i the ratioal umbers is difficult for example cosider the set {x Q : x 2 2}. This set is o-empty ad bouded above but does ot have a least upper boud
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 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 informationPhysics 116A Solutions to Homework Set #1 Winter Boas, problem Use equation 1.8 to find a fraction describing
Physics 6A Solutios to Homework Set # Witer 0. Boas, problem. 8 Use equatio.8 to fid a fractio describig 0.694444444... Start with the formula S = a, ad otice that we ca remove ay umber of r fiite decimals
More informationIt is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.
Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable
More informationArchimedes - numbers for counting, otherwise lengths, areas, etc. Kepler - geometry for planetary motion
Topics i Aalysis 3460:589 Summer 007 Itroductio Ree descartes - aalysis (breaig dow) ad sythesis Sciece as models of ature : explaatory, parsimoious, predictive Most predictios require umerical values,
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 informationThe natural exponential function
The atural expoetial fuctio Attila Máté Brookly College of the City Uiversity of New York December, 205 Cotets The atural expoetial fuctio for real x. Beroulli s iequality.....................................2
More informationSequences and Limits
Chapter Sequeces ad Limits Let { a } be a sequece of real or complex umbers A ecessary ad sufficiet coditio for the sequece to coverge is that for ay ɛ > 0 there exists a iteger N > 0 such that a p a q
More informationMath 525: Lecture 5. January 18, 2018
Math 525: Lecture 5 Jauary 18, 2018 1 Series (review) Defiitio 1.1. A sequece (a ) R coverges to a poit L R (writte a L or lim a = L) if for each ǫ > 0, we ca fid N such that a L < ǫ for all N. If 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 informationAnalytic Continuation
Aalytic Cotiuatio The stadard example of this is give by Example Let h (z) = 1 + z + z 2 + z 3 +... kow to coverge oly for z < 1. I fact h (z) = 1/ (1 z) for such z. Yet H (z) = 1/ (1 z) is defied for
More information