Event Space: For any n≥1 and a1,…,an∈{0,1} set Aa1,…,an={(r1,r2,…)∈Ω:ri=ai,1≤i≤n}and then let J:={Aa1,…,an:n≥1,a1,…,an∈{0,1}}∪{∅,Ω}.We want (at minimum) a σ-algebraF⊇J with:
Closed under intersection since each event is either disjoint (i.e. its made up of discrete permutation of events) or they’re the same meaning the intersection is the same.
Complement=finite union:
Use idea that (0,0)c=(0,1)∪(1,1)∪(1,0) and then apply this at level n. \end{proof}
\begin{proof} 1: Use The Extension Theorem, need to show P is countably additive on J. Clearly, P is finitely additive: P(Aa1,a2∪Aa1,a2c)=P(Aa1)=21P(Aa1,a2)+P(Aa1,a2c)=221+221=21 Countably requires Compactness argument (see lemma 2.62 in book) 2: Compare Ω to (0,1] via binary expansion. \end{proof} >[!lemma] >Every x∈(0,1] has a unique binary expansion x=j>1∑2jrjsuch that rj∈{0,1} and rj=1i.o.. >