12.07.2015 Views

Course in Probability Theory

Course in Probability Theory

Course in Probability Theory

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

20 1 MEASURE THEORY(A AB) A(C AD) = (A A C) A(B AD),AAB=C' A =BAC,AAB=CAD4 AAC=BAD .3 . If S2 has exactly n po<strong>in</strong>ts, then J has 2" members . The B .F . generatedby n given sets "without relations among them" has 2 2 " members .4. If Q is countable, then J is generated by the s<strong>in</strong>gletons, andconversely . [HNT : All countable subsets of S2 and their complements forma B .F.]5 . The <strong>in</strong>tersection of any collection of B .F .'s a E A) is the maximalB .F . conta<strong>in</strong>ed <strong>in</strong> all of them ; it is <strong>in</strong>differently denoted by I IaEA ~a or A aE a .*6 . The union of a countable collection of B .F .'s {5~ } such that :~Tj C z~+rneed not be a B .F ., but there is a m<strong>in</strong>imal B .F . conta<strong>in</strong><strong>in</strong>g all of them, denotedby v j ; 7~ . In general V A denotes the m<strong>in</strong>imal B .F. conta<strong>in</strong><strong>in</strong>g all Oa , a E A .[HINT : Q = the set of positive <strong>in</strong>tegers ; 9Xj = the B .F. generated by those upto j .]7. A B .F . is said to be countably generated iff it is generated by a countablecollection of sets . Prove that if each j is countably generated, then sois v~__ 1 .*8 . Let `T be a B .F. generated by an arbitrary collection of sets {E a , a EA) . Prove that for each E E ~T, there exists a countable subcollection {Eaj , j >1 } (depend<strong>in</strong>g on E) such that E belongs already to the B .F . generated by thissubcollection . [Hrwr : Consider the class of all sets with the asserted propertyand show that it is a B .F. conta<strong>in</strong><strong>in</strong>g each Ea .]9 . If :T is a B .F . generated by a countable collection of disjo<strong>in</strong>t sets{A„ }, such that U„ A„ = Q, then each member of JT is just the union of acountable subcollection of these A,, 's .10 . Let 2 be a class of subsets of S2 hav<strong>in</strong>g the closure property (iii) ;let .,/ be a class of sets conta<strong>in</strong><strong>in</strong>g Q as well as , and hav<strong>in</strong>g the closureproperties (vi) and (x) . Then ~/ conta<strong>in</strong>s the B .F . generated by !7 . (This isDynk<strong>in</strong>'s form of a monotone class theorem which is expedient for certa<strong>in</strong>applications . The proof proceeds as <strong>in</strong> Theorem 2 .1 .2 by replac<strong>in</strong>g ~' 3 and -6-with 9 and .~/ respectively .)11 . Take Q = .:;4" or a separable metric space <strong>in</strong> Exercise 10 and let 7be the class of all open sets . Let ;XF be a class of real-valued functions on Qsatisfy<strong>in</strong>g the follow<strong>in</strong>g conditions .(a) 1 E '' and l D E ~Y' for each D E 1 ;(b) dY' is 'a vector space, namely : if f i E f 2 E XK and c 1 , c 2 are anytwo real constants, then c1 f 1 + c2f2 E X' ;

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!