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)}\)
Chapter 1 Measure Spaces
1.1 What is measure theory?
Measure theory is the abstract mathematical theory that underlies all models of measurement of ‘size’ in the real world. This includes measurement of length, area and volume, weight and mass, and also of chance
and probability. Measure theory is a branch of pure mathematics, in particular of analysis, but it plays key roles in both calculus and statistical modelling. This is because measure theory provides the foundation of
both the modern theory of integration and of the modern theory of probability.
Suppose that we wish to measure the lengths of several line segments. We represent these as closed intervals of the real number line \(\R \) so a typical line segment is \([a,b]\) where \(b > a\). We all agree
that its length is \(b-a\). We write this as
\[ m([a,b]) = b-a\]
and interpret this as telling us that the measure \(m\) of length of the line segment \([a,b]\) is the number \(b-a\). We might also agree that if \([a_{1}, b_{1}]\) and \([a_{2}, b_{2}]\) are two
non-overlapping line segments and we want to measure their combined length then we want to apply \(m\) to the set-theoretic union \([a_{1}, b_{1}] \cup [a_{2}, b_{2}]\) and
\(\seteqnumber{0}{1.}{0}\)
\begin{eqnarray}
\label {firstunion} m([a_{1}, b_{1}] \cup [a_{2}, b_{2}]) & = (b_{2} - a_{2}) + (b_{1} - a_{1}) = m([a_{1}, b_{1}]) + m([a_{2}, b_{2}]).\nonumber \\ ~~&~~&~~
\end{eqnarray}
An isolated point \(c\) has zero length and so
\[ m(\{c\}) = 0.\]
If we consider the whole real line in its entirety then it has infinite length, i.e.
\[ m(\R ) = \infty .\]
The key point here is that, if we try to abstract the notion of a ‘measure of length, then we should regard it as a mapping \(m\) defined on subsets of the real line, that takes values in the extended non-negative real
numbers \([0, \infty ]\).
We might wonder why there is any mathematical difficulty involved here, since it appears that we can easily agree on how how long a line is. The problem is that subsets of \(\R \) may arise naturally and still be
rather complicated.
-
Let \(C_0=[0,1]\). Given \(C_n\), define \(C_{n+1}\) by taking each
sub-interval of \(C_n\), cutting this sub-interval into three parts of equal length and removing the open interval corresponding to the middle third. So, for each \(n\), \(C_n\) is a set of \(2^n\) closed intervals each
of length \((\frac 13)^n\).
Let \(C=\bigcap _{n=0}^\infty C_n\). Clearly \(C_{n+1}\sw C_n\), so this is a decreasing sequence of sets, and \(C\) is precisely the points that ‘never end up in the middle thirds’. For example, \(0\in C_n\)
and \(\frac 13\in C_n\).
The total length of the intervals in \(C_n\) is \(2^n(\frac 13)^n=(\frac 23)^n\), which tends to zero as \(n\to \infty \). This suggests \(C\) should have ‘length’ zero, but how can we make this intuition into
rigorous mathematics?
The Cantor set is a ‘fractal’, which is a general term for any shape with very detailed structure. It is somewhat contrived – in fact, it was first introduced precisely as a contrived example of an odd looking shape
that appeared to exist within the real line, but with no obvious purpose. Today, we know that fractal-like objects appear frequently within nature, which means that we also need to deal with them within our theory
of measure.