It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
|
|
- Bonnie Nichols
- 5 years ago
- Views:
Transcription
1 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 o X. I order to do so, we eed to assume that our fuctios have the special property of beig measurable. The formal defiitio of this property depeds o the cocept of the iverse image of a fuctio which we shall discuss first. Defiitio 4.1. Let f : X! Y be a fuctio betwee spaces X ad Y. Let V! Y. The iverse image of V uder f is the subset of X give by The x! f 1 (V ) if ad oly if f ( x)!v. f!1 (V ) = {x X : f (x ) V}. It is always the case that uios, itersectios, complemets, ad set differeces are preserved by the iverse image of a fuctio. That is, (a) f!1 # & %! V ( ' =! f!1 ( V ) (b) f!1 # & %! V ( ' =! f!1 ( V ) (c) f!1 (V c ) = ( f!1 (V )) c (d) f!1 (V! U) = f!1 (V )! f!1 (U) We prove properties (a) ad (c) below, but leave the proofs of (b) ad (d) as exercises. Proof. (a) We have x! f!1 # & %! V ( ' iff f ( x)!! V iff f ( x)! V for some! iff x! f 1 ( V # ) for some! iff x!! f 1 ( V # ). # (c) We have x! f!1 (V c ) iff f ( x)! V c iff f ( x)! V iff x! f!1 (V ) iff x! ( f!1 (V )) c. Defiitio 4.2. Let f : X! be a real-valued fuctio defied o X. The f is called measurable provided f!1 ((!, b] ) #F for all itervals of the form (!, b] #. That is, {x! X : f ( x) b} must always be a measurable set by beig i the! - algebra F. We the ca measure this evet by evaluatig µ ({x! X : f ( x) b} ). For coveiece, we ofte shall abbreviate the otatio for this iverse image by writig the set as { f! b} ad by writig its measure as µ ( f! b).
2 Example 4.1. Let! = {1, 2,..., 20}, with F beig the power set of!, ad P({}} = 1 / 20 for all!. Let f :! # be defied by!# f () = # 2 if is prime 2 otherwise. Because F is the power set of!, it cotais all subsets of! icludig all iverse images of the form { f! b}. Thus, f is measurable. What is P( f! 10)? We simply eed to determie which values i the domai have fuctio values that are less tha or equal to 10. We see that { f! 10} = {1, 2, 3, 5}; thus, P( f! 10) = 4/20. Note: Whe (!, F, P ) is a probability space, the measurable fuctios are called radom variables ad are geerally deoted by the symbol X. I this cotext, the symbol X represets a fuctio defied o! ad does ot represet a geeric set or space. Example 4.2. Let p be the probability of a wi o ay idepedet attempt ad let q = 1! p be the probability of a loss. Let! = {(! 1,...,! ) :! i {W, L} for 1 # i # }, let F be the power set of!, ad let P({(! 1,...,! )}) = p k q k, where k is the umber of wis i the sequece (! 1,...,! ). Defie X :! # to be the umber of wis i a sequece. As i (a), X is measurable because F is the power set of!. I this sceario, X is called a biomial radom variable ad is deoted by X ~ b(, p). What is P(X = k )? The evet {X = k} is the set of outcomes i! that have exactly k wis i attempts. Moreover, because F is closed uder set differece, we have {X = k} = {X! k} {X! k 1} #F. Thus, we ca compute P(X = k ). By the defiitio of P, each idividual outcome with exactly k wis has probability p k q!k!. Because there # & distict ways to have exactly k%! k wis i a sequece, we the have P(X = k ) = # & k % p k q 'k. Whe X is a radom variable o a probability space (!, F, P ), the {X! t} is a measurable set for all t!. Thus, we always ca compute P(X! t ). This probability defies a fuctio F :!!, called the cumulative distributio fuctio or cdf, which is give by F(t) = P( X! t).
3 Example 4.3. (a) (Uiform Probability) Let! = [a, b] ad let X be a umber chose at radom from!. The we always have a! X! b. The cdf of X is give by # 0 if t < a % t a F(t) = P( X! t) = if a! t! b % b a & % 1 if t > b. (b) (Geometric Probability) Let p be the probability of a wi o ay idepedet attempt, ad let q = 1! p be the probability of a loss. Let X cout the umber of attempts eeded for the first wi. The for itegers! 1, the cdf gives the probability of wiig withi tries ad is give by F() = P( X! ) = 1 q (which comes from the complemet losig times i a row). We ca exted this fuctio to be defied for all t! by &( 0 if t <1 F(t) = P( X! t) = ' )( 1 q # t if t % 1. Properties of the CDF Let F(t) = P( X! t) be the cdf of a radom variable X defied o a probability space (!, F, P ). The (i) For all t!, 0! F(t )! 1. (ii) F(t) is a icreasig fuctio of t. (iii) lim F(t) = 0 ad lim F (t ) = 1. t!# t! (iv) For a < b, P(a < X! b) = F(b) F(a). (v) F(t) is right-cotiuous. That is, lim F(t ) = F(a) for all a!. t!a + Proof. (i) Because {X! t} #, we have by the axioms ad properties of probability measure that 0! P( X! t)! P() = 1; thus, 0! F(t )! 1 for all t!. (ii) If t 1 < t 2, the {X! t 1 } {X! t 2 }; thus, F(t 1 ) = P( X! t 1 )! P(X! t 2 ) = F(t 2 ).! (iii) Let {t } =1 icrease to. The the evets {X! t } =1 are ested icreasig with! {X! t } = # (assumig X is always real-valued ad ever assigs a value of + ). =1 Thus, lim F (t ) = lim ) = lim ) = P() = 1. (We leave lim F(t) = 0 as a t!!! t!# exercise.) (iv) For a < b, {X! a} {X! b}; thus, P(a < X! b) = P({X! b} {X! a}) = P( X! b) P(X! a) = F (b) F(a).
4 (v) Let a! ad let {a } be a sequece of real umbers that decrease to a. It suffices to show that F(a )! F(a). So let! > 0 be give. Because {a } is a decreasig sequece, the evets {X! a } form ested decreasig sequece of sets. The because P is a fiite measure, we have lim P( X # a ' ) = P! {X # a }! & ). % =1 ( Now because a! a for all, we have {X! a}! {X! a }. O the other had, if a < X(! ), the for large eough we have a < a < X(! ).! ) c which makes {X! a} {X! a } That is, we have {X! a} c ( {X! a }! ad therefore we have {X! a} =! {X! a }. Thus, # & F(a) = P(X! a) = P! {X! a } % ( = 1 ' = lim P(X! a ) = lim F(a ). ) ) Example 4.4. Let f :!! be give by f ( x) = x 3, where F is the Borel! -algebra o!. We claim that f is measurable. For all b!, we have {x : f (x )! b} = {x : x 3! b} = {x : x! b 1/3 } = (#, b 1/3 ] F, because the Borel! -algebra cotais all itervals of the form (!, c]. We ow shall prove some properties of measurable fuctios, icludig that various algebraic combiatios of measurable fuctios are still measurable. Theorem 4.1. Let f be a measurable fuctio defied o a measure space ( X, F, µ). (a) For all b!, (i) f!1 ((!, b) ) # F (ii) f!1 ((b, )) #F (iii) f!1 ([b,)) # F (iv) f!1 ({b}) F (b) For all a, b! with a < b, (i) f!1 ((a, b] ) F (ii) f!1 ((a, b) ) F (iii) f!1 ([a,b]) F (iv) f!1 ([a,b)) F Proof. (a) Because f is measurable, we kow f!1 ((!, c] ) # F for all c!. (i) We ote that (!, b) =! (!, b! 1 / ]. The because F is closed uder coutable uios, =1 we have f!1 ((!, b)) = f!1 # &! (!, b! 1 / ] % ( =1 ' =! f!1 ((!, b!1 / ] ) )F. =1
5 (ii, iii, iv) Because F is closed uder complemets ad itersectios, we have f!1 ((b, )) = f!1 (!, b] c f!1 ([b,)) = f!1 (!, b) c ( ) = ( f!1 ((!, b] )) c # F, ( ) = ( f!1 ((!, b) )) c #F, ad f!1 ({b}) = f!1 ((!, b] # [b,)) = f!1 ((!, b] ) # f!1 ([b,)) F. (b) Usig the results i (a), the fact that f!1 (V! U) = f!1 (V )! f!1 (U), ad the fact that F is closed uder set differece, we have (i) f!1 ((a, b] ) = f!1 ((!, b]! (!, a] ) = f!1 ((!, b] )! f!1 ((!, a] ) # F (ii) f!1 ((a, b) ) = f!1 ((!, b)! (!, a] ) = f!1 ((!, b) )! f!1 ((!, a] ) #F (iii) f!1 ([a,b]) = f!1 ((!, b]! (!, a) ) = f!1 ((!, b] )! f!1 ((!, a) ) #F (iv) f!1 ([a,b)) = f!1 ((!, b)! (!, a) ) = f!1 ((!, b) )! f!1 ((!, a) ) # F Note: Ay of the above coditios from (a) or (b) (except (a, iv)) could have bee used to defie the cocept of measurability. The followig exercise demostrates this fact. Exercise 4.1. Let f be a fuctio defied o a measure space ( X, F, µ). (a) Suppose f!1 ((!, b) ) # F for all b!. Prove that f is measurable. (b) Suppose f!1 ((a, b] ) F for all a, b! with a < b. Prove that f is measurable. Theorem 4.2. ( X, F, µ). Let f ad g be measurable fuctios defied o a measure space (a) Costat fuctios are measurable. (b) For every costat c!!, the fuctio c f is measurable. (c) For all itegers! 1, the fuctio f is measurable. (d) The fuctio f is measurable. (e) The sum f + g ad the differece f! g are measurable. (f) The product f g is measurable. (g) The fuctios max{f, g} ad mi{f, g} are measurable.
6 Proof. (a) Suppose h(x )! c. Let b!. If b < c, the h!1 ((!, b] )= # F. If b! c, the h!1 ((!, b] )= X # F. Thus, h is measurable. (b) If c = 0, the c f! 0 is measurable by (a). Otherwise, let b!. If c > 0, the (c f )!1 ((!, b] ) = {x #X : c f ( x) b} = {x #X : f ( x) b / c} = f!1 ((!, b / c] ) #F (c) Let b!. If is odd, the ( f )!1 ((!, b] )= {x # X : f (x ) b} = {x # X : f ( x) b 1/ } ( ) #F = f!1 (!, b 1/ ] If c < 0, the (c f )!1 ((!, b] ) = {x #X : c f ( x) b} = {x #X : f ( x) % b / c} = f!1 ([b / c, )) #F If is eve ad b! 0, the ( f )!1 ((!, b] )= {x # X : 0 f ( x) b} = {x # X :! b 1/ f (x ) b 1/ } ( ) #F = f!1 [!b 1/, b 1/ ] If is eve ad b < 0, the f! 0 > b; thus, ( f )!1 ((!, b] )= # F. (d) Let b!. If b < 0, the {x : f (x )! b} = #F. For b! 0, we have { x : f (x )! b} = {x: b! f (x )! b} = f 1 ([b, b] ) #F. (e) We shall use the result from Exercise 4.1(a) above. But we shall first show that { x : f ( x) + g(x ) < b} =! ({x : g(x ) < r}! {x : f (x ) < b r} ). r#q If g(x ) < r ad f ( x) < b! r for some r! Q, the f ( x) + g( x) < b! r + r = b. Thus, { x : f ( x) + g(x ) < b}!! ({x : g(x ) < r} {x : f ( x) < b # r} ). rq O the other had, suppose f ( x) + g( x) < b. The there exists a! > 0 such that f ( x) + g( x) < b! < b. But there also exists a ratioal umber r such that g(x ) < r < g( x) +!. But the f ( x) < b! g(x )! < b! r. Hece, { x : f ( x) + g(x ) < b}!! ({x: g( x) < r}! {x : f ( x) < b r} ). r #Q So for every b!, {x : g(x ) < r}! {x : f (x ) < b r}! F because f ad g are both measurable. Thus, the deumerable uio of these evets over all ratioal umbers is also i F. Hece, { x : f ( x) + g(x ) < b}! F for all b!, which makes f + g a measurable fuctio. From this result ad (b), it the follows that f! g = f + (!1)g is measurable.
7 (f) f g = 1 ( 4 ( f + g)2! ( f! g) 2 ) is measurable by Parts (b), (c), ad (e). (g) The result follows from (b), (d), (e), ad the followig idetities: max{f, g} = 1 2 ( f + g + f! g ) ad mi{f, g} = 1 2 ( f + g! f! g ). Exercise 4.2. Let f be a measurable fuctio defied o a measure space ( X, F, µ). Prove: (a) If m is a odd iteger, the f 1/m is measurable. (b) If m is a eve iteger ad f! 0, the f 1/m is measurable. (c) Let, m be positive itegers with gcd(, m) = 1. Explai the coditios that make f /m measurable. Defiitio 4.3. Let f be a measurable fuctio defied o a measure space ( X, F, µ). The kerel of f is defied by ker f = {x : f ( x) = 0}. We ote that ker f! F by Theorem 4.1 (a) (iv). If we exclude ker f from the domai, the we ca evaluate the reciprocal fuctio 1 / f. Theorem 4.3. Let f be a measurable fuctio defied o a measure space ( X, F, µ). Let 1 f : X! ker( f ) # be give by 1 f ( x) = 1 f (x ). The 1 is measurable. f Proof. Let b!. If b > 0, the 1 / f ( x)! b iff f ( x) < 0 or ( f ( x) > 0 ad 1 / b! f (x )). Thus, {1 / f! b} = { f < 0} ({1 / b! f } # {f > 0} )!F. If b = 0, the 1 / f ( x)! b iff f ( x) < 0 ; thus, {1 / f! b} = { f < 0}!F. If b < 0, the {1 / f! b} = ({1 / b! f } {f < 0} )!F. Hece, 1 / f is measurable. QED Exercise 4.3. Let f ad g be measurable fuctios defied o a measure space ( X, F, µ). Prove that f : X! ker(g) # is also measurable. g Defiitio 4.4. Give a measurable fuctio f, the positive part of f is defied by f + ( x) = # f ( x) if f (x )! 0 0 if f ( x) < 0 = max{f, 0}. The egative part of f is defied by f! #! f ( x) if f ( x) < 0 ( x) = =! mi{f, 0}. % 0 if f ( x) 0
8 Both f + ad f! are o-egative fuctios. It is easy to verify that f = f +! f! ad f = f + + f!. Because f + ad f! ca be expressed i terms of the max ad mi of the measurable fuctios f ad 0, the ext result follows from Theorem 4.2(g): Theorem 4.4. Let f be a measurable fuctio defied o a measure space ( X, F, µ). The f + ad f! are measurable. The Idicator Fuctio Let ( X, F, µ) be a measure space. For every A!F, we defie the idicator fuctio 1 A : X! by # 1 if x!a 1 A (x ) = % 0 if x A. Idicator fuctios ca be used to write fuctios that are piecewise defied over evets that form a partitio of the space. Example 4.5. Let X be a set of college studets with F cosistig of all subsets of X. Let A be the subset of all udergraduate males, let B be the subset of all udergraduate females, ad let C be the subset of all other studets. The A, B, C are mutually disjoit, ad X = A! B! C. Defie f : X! by f ( x) = # % 5 if x! A 10 if x!b 15 if x!c The f ca be writte i oe lie as f = 51 A +101 B C. We ote that the variable x is ofte suppressed whe usig the idicator otatio. Techically, we could write f ( x) = 51 A (x ) B ( x) C ( x). Because ay specific elemet x must be i oe ad oly oe of the subsets, oly oe idicator fuctio ca be 1 at a time while the others are 0.
9 Theorem 4.5. Let ( X, F, µ) be a measure space. For every A!F, the idicator fuctio 1 A is measurable. Proof. Let b!. Suppose first that b! 1. Because 0! 1 A ( x)! 1! b for all x, the 1 A!1 ((!, b]) = X! F. If 0! b < 1, the 1A!1 ((!, b]) = A c! F. If b < 0, the 1 A!1 ((!, b]) =!! F. QED Theorem 4.6. Let ( X, F, µ) be a measure space ad let A, B!F. The (a) 1 A!B = 1 A 1 B (b) 1 A!B = 1 A + 1 B 1 A 1 B. Proof. (a) For x!x, the value 1 A!B (x ) is either 1 or 0, ad the product 1 A (x ) 1 B (x ) ca oly be 1 or 0. But 1 A!B (x ) = 1 if ad oly if x!a B if ad oly if x!a ad x!b if ad oly if 1 A (x ) = 1 ad 1 B (x ) = 1 if ad oly if 1 A (x ) 1 B (x ) = 1. (b) Let x!x. We cosider four cases. (i) If x!( A B) c, the x!a c ad x!b c ; thus, 1 A!B (x ) = 0 = 1 A (x ) + 1 B ( x) 1 A (x )1 B (x ). (ii) If x!a B, the 1 A!B (x ), 1 A (x ), 1 B (x ), ad 1 A (x )1 B (x ) are all equal to 1 ad the result follows. (iii) If x!a B c, the 1 A!B (x ) ad 1 A (x ) are equal to 1 while 1 B (x ) is 0, ad the result follows. (iv) The case of x!a c B is similar to (iii). QED Example 4.6. Let f be a measurable fuctio ad let A = {f! 0}. The f + = f 1 A ad f! =! f 1 A c = f 1 A c. Defiitio 4.5. Let { A i } i=1 be a fiite collectio of disjoit evets i a measure space ( X, F, µ). A fuctio f : X! is called a simple fuctio if f is of the form f =! a i 1 Ai = a 1 1 A a 1 A, i =1 where a 1,..., a are real umbers. Notes: (i) Wheever coveiet, we ca assume that a 1,..., a are distict real umbers. For if a i = a j = a, the because A i ad A j are assumed to be disjoit, we the ( ) = a1 Ai! A j. That is, we ca replace the sum of the two have a i 1 Ai + a j 1 Aj = a 1 Ai + 1 Aj terms a i 1 Ai + a j 1 Aj with the sigle term a1 Ai!A j, ad A i! A j is still i F ad is disjoit from the other evets A k.
10 (ii) By re-labelig the evets, we ca always assume that a 1 < a 2 <... < a. From Theorems 4.5 ad 4.2, we obtai: Theorem 4.7. Simple fuctios are measurable. Exteded Real-Valued Fuctios Suppose f : X! [#, #] is a fuctio that is allowed to take ifiite values. We ca still say that f is measurable provided { f! b}!f for all b!. If f is measurable,! the {x : f (x ) <!} =! {f }!F ad {x : f (x ) =!} = {x : f (x ) <!} c F. =1 More Exercises Exercise 4.4. (a) Let f :!! be give by f ( x) = x 2. Use the formal defiitio of measurability to prove that f is measurable with respect to the Borel! -algebra o!. (b) Prove that the followig real-valued fuctios are Borel measurable: (i) g(x ) = ta x (ii) h(x ) =! x Exercise 4.5. Let X be a set of college studets with F cosistig of all subsets of X. Let A be the subset of all udergraduate males, let B be the subset of all udergraduate females, ad let C be the subset of all other studets. Assume P({!}) = 1 / X for all! X, ad that P(A) = 0.50, P(B) = 0.30, P(C) = Defie f : X! by f ( x) = # % 5 if x! A 10 if x!b 15 if x!c Fid the cdf fuctio F(t) = P( f! t ) as a piecewise defied fuctio of all t!. Exercise 4.6. Prove that lim F(t) = 0 for ay cdf fuctio F. t!# Exercise 4.7. Let f :!! be a cotiuous fuctio. Prove that f is measurable with respect to the Borel! -algebra o!. Exercise 4.8. Let f : X! [#, #] be a exteded real-valued fuctio defied o a measure space ( X, F, µ). Prove that {x : f (x ) >!}!F ad {x :! < f ( x) < }!F.
Axioms 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 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 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 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 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 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 informationLesson 10: Limits and Continuity
www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals
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 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 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 informationUnit 6: Sequences and Series
AMHS Hoors Algebra 2 - Uit 6 Uit 6: Sequeces ad Series 26 Sequeces Defiitio: A sequece is a ordered list of umbers ad is formally defied as a fuctio whose domai is the set of positive itegers. It is commo
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 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 informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
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 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 information( ) = p and P( i = b) = q.
MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of
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 informationLecture 12: November 13, 2018
Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,
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 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 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 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 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 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 informationCS161 Handout 05 Summer 2013 July 10, 2013 Mathematical Terms and Identities
CS161 Hadout 05 Summer 2013 July 10, 2013 Mathematical Terms ad Idetities Thaks to Ady Nguye ad Julie Tibshirai for their advice o this hadout. This hadout covers mathematical otatio ad idetities that
More informationWhat is Probability?
Quatificatio of ucertaity. What is Probability? Mathematical model for thigs that occur radomly. Radom ot haphazard, do t kow what will happe o ay oe experimet, but has a log ru order. The cocept of probability
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 informationProduct 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 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 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 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 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 informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationSets and Probabilistic Models
ets ad Probabilistic Models Berli Che Departmet of Computer ciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Referece: - D. P. Bertsekas, J. N. Tsitsiklis, Itroductio to Probability, ectios 1.1-1.2
More informationSTAT Homework 1 - Solutions
STAT-36700 Homework 1 - Solutios Fall 018 September 11, 018 This cotais solutios for Homework 1. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better
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 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 informationAs stated by Laplace, Probability is common sense reduced to calculation.
Note: Hadouts DO NOT replace the book. I most cases, they oly provide a guidelie o topics ad a ituitive feel. The math details will be covered i class, so it is importat to atted class ad also you MUST
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 informationLecture 10: Mathematical Preliminaries
Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # Slide # I this
More information4.1 Sigma Notation and Riemann Sums
0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal 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 information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationProbability and Statistics
robability ad Statistics rof. Zheg Zheg Radom Variable A fiite sigle valued fuctio.) that maps the set of all eperimetal outcomes ito the set of real umbers R is a r.v., if the set ) is a evet F ) for
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 informationUNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY
UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY Structure 2.1 Itroductio Objectives 2.2 Relative Frequecy Approach ad Statistical Probability 2. Problems Based o Relative Frequecy 2.4 Subjective Approach
More informationQuick Review of Probability
Quick Review of Probability Berli Che Departmet of Computer Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Refereces: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chapter 2 & Teachig
More informationRandom Models. Tusheng Zhang. February 14, 2013
Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the
More informationQuick Review of Probability
Quick Review of Probability Berli Che Departmet of Computer Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Refereces: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chapter & Teachig Material.
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 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 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 informationLecture 1 Probability and Statistics
Wikipedia: Lecture 1 Probability ad Statistics Bejami Disraeli, British statesma ad literary figure (1804 1881): There are three kids of lies: lies, damed lies, ad statistics. popularized i US by Mark
More informationSets and Probabilistic Models
ets ad Probabilistic Models Berli Che Departmet of Computer ciece & Iformatio Egieerig Natioal Taiwa Normal iversity Referece: - D. P. Bertsekas, J. N. Tsitsiklis, Itroductio to Probability, ectios 1.1-1.2
More informationSection 11.8: Power Series
Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i
More informationA brief introduction to linear algebra
CHAPTER 6 A brief itroductio to liear algebra 1. Vector spaces ad liear maps I what follows, fix K 2{Q, R, C}. More geerally, K ca be ay field. 1.1. Vector spaces. Motivated by our ituitio of addig ad
More informationSection 7 Fundamentals of Sequences and Series
ectio Fudametals of equeces ad eries. Defiitio ad examples of sequeces A sequece ca be thought of as a ifiite list of umbers. 0, -, -0, -, -0...,,,,,,. (iii),,,,... Defiitio: A sequece is a fuctio which
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationRandom Variables, Sampling and Estimation
Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig
More information6. Uniform distribution mod 1
6. Uiform distributio mod 1 6.1 Uiform distributio ad Weyl s criterio Let x be a seuece of real umbers. We may decompose x as the sum of its iteger part [x ] = sup{m Z m x } (i.e. the largest iteger which
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 informationAlternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.
0_0905.qxd //0 :7 PM Page SECTION 9.5 Alteratig Series Sectio 9.5 Alteratig Series Use the Alteratig Series Test to determie whether a ifiite series coverges. Use the Alteratig Series Remaider to approximate
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 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 informationDiscrete probability distributions
Discrete probability distributios I the chapter o probability we used the classical method to calculate the probability of various values of a radom variable. I some cases, however, we may be able to develop
More informationGeneralized Semi- Markov Processes (GSMP)
Geeralized Semi- Markov Processes (GSMP) Summary Some Defiitios Markov ad Semi-Markov Processes The Poisso Process Properties of the Poisso Process Iterarrival times Memoryless property ad the residual
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationSOLVED EXAMPLES
Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationSeries III. Chapter Alternating Series
Chapter 9 Series III With the exceptio of the Null Sequece Test, all the tests for series covergece ad divergece that we have cosidered so far have dealt oly with series of oegative terms. Series with
More informationSome Basic Probability Concepts. 2.1 Experiments, Outcomes and Random Variables
Some Basic Probability Cocepts 2. Experimets, Outcomes ad Radom Variables A radom variable is a variable whose value is ukow util it is observed. The value of a radom variable results from a experimet;
More informationTopic 5: Basics of Probability
Topic 5: Jue 1, 2011 1 Itroductio Mathematical structures lie Euclidea geometry or algebraic fields are defied by a set of axioms. Mathematical reality is the developed through the itroductio of cocepts
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 information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
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 informationCS166 Handout 02 Spring 2018 April 3, 2018 Mathematical Terms and Identities
CS166 Hadout 02 Sprig 2018 April 3, 2018 Mathematical Terms ad Idetities Thaks to Ady Nguye ad Julie Tibshirai for their advice o this hadout. This hadout covers mathematical otatio ad idetities that may
More informationCardinality Homework Solutions
Cardiality Homework Solutios April 16, 014 Problem 1. I the followig problems, fid a bijectio from A to B (you eed ot prove that the fuctio you list is a bijectio): (a) A = ( 3, 3), B = (7, 1). (b) A =
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 informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationUnit 4: Polynomial and Rational Functions
48 Uit 4: Polyomial ad Ratioal Fuctios Polyomial Fuctios A polyomial fuctio y px ( ) is a fuctio of the form p( x) ax + a x + a x +... + ax + ax+ a 1 1 1 0 where a, a 1,..., a, a1, a0are real costats ad
More informationHOMEWORK 2 SOLUTIONS
HOMEWORK SOLUTIONS CSE 55 RANDOMIZED AND APPROXIMATION ALGORITHMS 1. Questio 1. a) The larger the value of k is, the smaller the expected umber of days util we get all the coupos we eed. I fact if = k
More information1 Introduction to reducing variance in Monte Carlo simulations
Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by
More informationMath 10A final exam, December 16, 2016
Please put away all books, calculators, cell phoes ad other devices. You may cosult a sigle two-sided sheet of otes. Please write carefully ad clearly, USING WORDS (ot just symbols). Remember that the
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 informationRandomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)
Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
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 information4. Partial Sums and the Central Limit Theorem
1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems
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 informationMATH 6101 Fall Problems. Problems 11/9/2008. Series and a Famous Unsolved Problem (2-1)(2 + 1) ( 4) 12-Nov-2008 MATH
/9/008 MATH 60 Fall 008 Series ad a Famous Usolved Problem = = + + + + ( - )( + ) 3 3 5 5 7 7 9 -Nov-008 MATH 60 ( 4) = + 5 48 -Nov-008 MATH 60 3 /9/008 ( )! = + -Nov-008 MATH 60 4 3 4 5 + + + + + + +
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More information4.1 SIGMA NOTATION AND RIEMANN SUMS
.1 Sigma Notatio ad Riema Sums Cotemporary Calculus 1.1 SIGMA NOTATION AND RIEMANN SUMS Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationLecture 2: April 3, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,
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 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 informationChapter Vectors
Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it
More informationMDIV. Multiple divisor functions
MDIV. Multiple divisor fuctios The fuctios τ k For k, defie τ k ( to be the umber of (ordered factorisatios of ito k factors, i other words, the umber of ordered k-tuples (j, j 2,..., j k with j j 2...
More information