Probability with Measure
\(\newcommand{\footnotename}{footnote}\)
\(\def \LWRfootnote {1}\)
\(\newcommand {\footnote }[2][\LWRfootnote ]{{}^{\mathrm {#1}}}\)
\(\newcommand {\footnotemark }[1][\LWRfootnote ]{{}^{\mathrm {#1}}}\)
\(\let \LWRorighspace \hspace \)
\(\renewcommand {\hspace }{\ifstar \LWRorighspace \LWRorighspace }\)
\(\newcommand {\mathnormal }[1]{{#1}}\)
\(\newcommand \ensuremath [1]{#1}\)
\(\newcommand {\LWRframebox }[2][]{\fbox {#2}} \newcommand {\framebox }[1][]{\LWRframebox } \)
\(\newcommand {\setlength }[2]{}\)
\(\newcommand {\addtolength }[2]{}\)
\(\newcommand {\setcounter }[2]{}\)
\(\newcommand {\addtocounter }[2]{}\)
\(\newcommand {\arabic }[1]{}\)
\(\newcommand {\number }[1]{}\)
\(\newcommand {\noalign }[1]{\text {#1}\notag \\}\)
\(\newcommand {\cline }[1]{}\)
\(\newcommand {\directlua }[1]{\text {(directlua)}}\)
\(\newcommand {\luatexdirectlua }[1]{\text {(directlua)}}\)
\(\newcommand {\protect }{}\)
\(\def \LWRabsorbnumber #1 {}\)
\(\def \LWRabsorbquotenumber "#1 {}\)
\(\newcommand {\LWRabsorboption }[1][]{}\)
\(\newcommand {\LWRabsorbtwooptions }[1][]{\LWRabsorboption }\)
\(\def \mathchar {\ifnextchar "\LWRabsorbquotenumber \LWRabsorbnumber }\)
\(\def \mathcode #1={\mathchar }\)
\(\let \delcode \mathcode \)
\(\let \delimiter \mathchar \)
\(\def \oe {\unicode {x0153}}\)
\(\def \OE {\unicode {x0152}}\)
\(\def \ae {\unicode {x00E6}}\)
\(\def \AE {\unicode {x00C6}}\)
\(\def \aa {\unicode {x00E5}}\)
\(\def \AA {\unicode {x00C5}}\)
\(\def \o {\unicode {x00F8}}\)
\(\def \O {\unicode {x00D8}}\)
\(\def \l {\unicode {x0142}}\)
\(\def \L {\unicode {x0141}}\)
\(\def \ss {\unicode {x00DF}}\)
\(\def \SS {\unicode {x1E9E}}\)
\(\def \dag {\unicode {x2020}}\)
\(\def \ddag {\unicode {x2021}}\)
\(\def \P {\unicode {x00B6}}\)
\(\def \copyright {\unicode {x00A9}}\)
\(\def \pounds {\unicode {x00A3}}\)
\(\let \LWRref \ref \)
\(\renewcommand {\ref }{\ifstar \LWRref \LWRref }\)
\( \newcommand {\multicolumn }[3]{#3}\)
\(\require {textcomp}\)
\(\newcommand {\intertext }[1]{\text {#1}\notag \\}\)
\(\let \Hat \hat \)
\(\let \Check \check \)
\(\let \Tilde \tilde \)
\(\let \Acute \acute \)
\(\let \Grave \grave \)
\(\let \Dot \dot \)
\(\let \Ddot \ddot \)
\(\let \Breve \breve \)
\(\let \Bar \bar \)
\(\let \Vec \vec \)
\(\DeclareMathOperator {\var }{var}\)
\(\DeclareMathOperator {\cov }{cov}\)
\(\newcommand {\nN }{n \in \mathbb {N}}\)
\(\newcommand {\Br }{{\cal B}(\R )}\)
\(\newcommand {\F }{{\cal F}}\)
\(\newcommand {\ds }{\displaystyle }\)
\(\newcommand {\st }{\stackrel {d}{=}}\)
\(\newcommand {\uc }{\stackrel {uc}{\rightarrow }}\)
\(\newcommand {\la }{\langle }\)
\(\newcommand {\ra }{\rangle }\)
\(\newcommand {\li }{\liminf _{n \rightarrow \infty }}\)
\(\newcommand {\ls }{\limsup _{n \rightarrow \infty }}\)
\(\newcommand {\limn }{\lim _{n \rightarrow \infty }}\)
\(\def \to {\rightarrow }\)
\(\def \iff {\Leftrightarrow }\)
\(\def \ra {\Rightarrow }\)
\(\def \sw {\subseteq }\)
\(\def \mc {\mathcal }\)
\(\def \mb {\mathbb }\)
\(\def \sc {\setminus }\)
\(\def \v {\textbf }\)
\(\def \E {\mb {E}}\)
\(\def \P {\mb {P}}\)
\(\def \R {\mb {R}}\)
\(\def \C {\mb {C}}\)
\(\def \N {\mb {N}}\)
\(\def \Q {\mb {Q}}\)
\(\def \Z {\mb {Z}}\)
\(\def \B {\mb {B}}\)
\(\def \~{\sim }\)
\(\def \-{\,;\,}\)
\(\def \qed {$\blacksquare $}\)
\(\def \1{\unicode {x1D7D9}}\)
\(\def \cadlag {c\`{a}dl\`{a}g}\)
\(\def \p {\partial }\)
\(\def \l {\left }\)
\(\def \r {\right }\)
\(\def \Om {\Omega }\)
\(\def \om {\omega }\)
\(\def \eps {\epsilon }\)
\(\def \de {\delta }\)
\(\def \ov {\overline }\)
\(\def \sr {\stackrel }\)
\(\def \Lp {\mc {L}^p}\)
\(\def \Lq {\mc {L}^q}\)
\(\def \Lone {\mc {L}^1}\)
\(\def \Ltwo {\mc {L}^2}\)
\(\def \toae {\sr {\rm a.e.}{\to }}\)
\(\def \toas {\sr {\rm a.s.}{\to }}\)
\(\def \top {\sr {\mb {\P }}{\to }}\)
\(\def \tod {\sr {\rm d}{\to }}\)
\(\def \toLp {\sr {\Lp }{\to }}\)
\(\def \toLq {\sr {\Lq }{\to }}\)
\(\def \eqae {\sr {\rm a.e.}{=}}\)
\(\def \eqas {\sr {\rm a.s.}{=}}\)
\(\def \eqd {\sr {\rm d}{=}}\)
\(\def \Sa {(S1)}\)
\(\def \Sb {(S2)}\)
\(\def \Sc {(S3)}\)
\(\def \Scp {(S3')}\)
\(\def \Ma {(M1)}\)
\(\def \Mb {(M2)}\)
\(\def \La {(L1)}\)
\(\def \Lb {(L2)}\)
\(\def \Lc {(L3)}\)
\(\def \Ld {(L4)}\)
\(\def \Le {(L5)}\)
1.7 Measures and limits
In this section we return to the consideration of arbitrary measure spaces \((S, \Sigma , m)\). Let \((A_{n})\) be a sequence of sets in \(\Sigma \). We say that it is increasing if \(A_{n} \subseteq A_{n+1}\)
for all \(\nN \), and decreasing if \(A_{n+1}\sw A_n\). When \((A_n)\) is increasing, it is easily seen that \((A^c_n)\) is decreasing.
When \((A_n)\) is increasing, a useful technique is the disjoint union trick whereby we can write \(\bigcup _{n=1}^{\infty }A_{n} = \bigcup _{n=1}^{\infty }B_{n}\) where the \(B_{n}\)s are all mutually
disjoint by defining \(B_{1} = A_{1}\) and for \(n > 1, B_{n} = A_{n} - A_{n-1}\). e.g. \(\R = \bigcup _{n=1}^{\infty }[-n, n]\) and here \(B_{1} = [-1, 1], B_{2} = [-2, -1) \cup (1, 2]\)
etc.
Proof: We will prove the first claim here. The second claim can be deduced from the first, which is for
you to do in Problem 1.7. We use the disjoint union trick and (M2) to find that
\(\seteqnumber{0}{1.}{9}\)
\begin{align*}
m(A) & = m\left (\bigcup _{n=1}^{\infty }B_{n}\right ) = \sum _{n=1}^{\infty }m(B_{n}) = \lim _{N \rightarrow \infty }\sum _{n=1}^{N}m(B_{n}) = \lim _{N \rightarrow \infty
}m\left (\bigcup _{n=1}^{N}B_{n}\right ) = \lim _{N \rightarrow \infty } m(A_{N}).
\end{align*}
Here we use that \(A_{N} = B_{1} \cup B_{2} \cup \cdots \cup B_{N}\). ∎
Proof: From Problem 1.4, we have \(m(A_{1} \cup A_{2}) + m(A_{1} \cap A_{2}) = m(A_{1}) + m(A_{2})\) from which we deduce
that \(m(A_{1} \cup A_{2}) \leq m(A_{1}) + m(A_{2})\). By induction we then obtain for all \(N \geq 2\),
\[ m\left (\bigcup _{n=1}^{N}A_{n}\right ) \leq \sum _{n=1}^{N}m(A_{n}).\]
Now define \(X_{N} = \bigcup _{n=1}^{N}A_{n}\). Then \(X_{N} \subseteq X_{N+1}\) and so \((X_{N})\) is increasing to \(\bigcup _{n=1}^{\infty }X_{n} = \bigcup _{n=1}^{\infty }A_{n}\). By
Lemma 1.7.1 we have
\(\seteqnumber{0}{1.}{9}\)
\begin{align*}
m\left (\bigcup _{n=1}^{\infty }A_{n}\right ) & = m\left (\bigcup _{n=1}^{\infty }X_{n}\right ) = \lim _{N \rightarrow \infty }m(X_{N}) = \lim _{N \rightarrow \infty } m\left
(\bigcup _{n=1}^{N}A_{n}\right ) \leq \lim _{N \rightarrow \infty }\sum _{n=1}^{N}m(A_{n}) = \sum _{n=1}^{\infty }m(A_{n}).
\end{align*}
∎