last updated: October 16, 2024

Stochastic Processes and Financial Mathematics
(part one)

\(\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}\) \(\def \ra {\Rightarrow }\) \(\def \to {\rightarrow }\) \(\def \iff {\Leftrightarrow }\) \(\def \sw {\subseteq }\) \(\def \wt {\widetilde }\) \(\def \mc {\mathcal }\) \(\def \mb {\mathbb }\) \(\def \sc {\setminus }\) \(\def \v {\textbf }\) \(\def \p {\partial }\) \(\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 \|{\,|\,}\) \(\def \qed {$\blacksquare $}\) \(\def \1{\unicode {x1D7D9}}\) \(\def \cadlag {c\`{a}dl\`{a}g}\) \(\def \p {\partial }\) \(\def \l {\left }\) \(\def \r {\right }\) \(\def \F {\mc {F}}\) \(\def \G {\mc {G}}\) \(\def \H {\mc {H}}\) \(\def \Om {\Omega }\) \(\def \om {\omega }\)

6.2 The monotone convergence theorem

A natural question to ask is, when does \(\E [X_n]\to \E [X]\)? This is not a mode of convergence, but simply a practical question.

We are interested (for use later on in the course) to ask when almost sure convergence implies that \(\E [X_n]\to \E [X]\). As we can see from Example 6.1.1, in general it does not. We need some extra conditions:

  • Theorem 6.2.1 (Monotone Convergence Theorem) Let \((X_n)\) be a sequence of random variables and suppose that:

    • 1. \(X_{n+1}\geq X_n\), almost surely, for all \(n\).

    • 2. \(X_n\geq 0\), almost surely, for all \(n\).

    Then, there exists a random variable \(X\) such that \(X_n\stackrel {a.s.}{\to }X\). Further, \(\E [X_n]\to \E [X]\).

The first claim of the theorem, that the sequence \(X_n\) converges almost surely, is true because by property 1 the sequence \(X_n\) is increasing, almost surely, and increasing sequences of real numbers converge1

Since limits preserve weak inequalities and \(X_n\geq 0\) we have \(X\geq 0\), almost surely. However, we should not forget that \(\E [X]\) might be equal to \(+\infty \).

You can think of Theorem 6.2.1 as a stochastic equivalent of the fact that increasing real valued sequences converge (in \(\R \) if they are bounded, and to \(+\infty \) if they are not bounded). This is usually helpful when applying the theorem, such as in the following example.

Let \((X_n)\) be a sequence of independent random variables, with distribution given by

\[ X_i= \begin {cases} 2^{-i} & \text { with probability }\frac {1}{2}\\ 0 & \text { with probability }\frac {1}{2}.\\ \end {cases} \]

Let \(Y_n=\sum _{i=1}^n X_i\). Then \((Y_n)\) is an increasing sequence, almost surely, and hence converges almost surely to the limit \(Y=\sum _{i=1}^\infty X_i\).

Since also \(Y_n\geq 0\), we can apply the monotone convergence theorem to \((Y_n)\) and deduce that \(\E [Y_n]\to \E [Y]\). By linearity of \(\E \), and geometric summation, we have that

\[\E [Y_n]=\sum \limits _{i=1}^n \E [Y_i]=\sum \limits _{i=1}^n \frac {1}{2}\frac {1}{2^i}=\frac {1}{2}\frac {\frac 12-(\frac 12)^{n+1}}{1-\frac {1}{2}}\]

This converges to \(\frac 12\) as \(n\to \infty \), so we deduce that \(\E [Y]=\frac 12\). We’ll investigate this example further in exercise 6.5. In fact, \(X_i\) corresponds to the \(i^{th}\) digit in the binary expansion of \(Y\).

1 \(\offsyl \) More precisely: we have \(\P \l [\lim _{n\to \infty }X_n(\omega )\text { exists}\r ]=1\) and for \(\omega \) in this set we can define \(X(\omega )=\lim _{n\to \infty }X_n(\omega )\). We don’t care about \(\omega \) for which the limit doesn’t exist, because this has probability zero! We could set \(X(\omega )=0\) in such cases, and it won’t affect any probabilities involving \(X\). See MAS31002/61022 for details.

  • Remark 6.2.2 \(\msconly \) Those of you taking the MAS61023 version of the course should now begin your independent reading, starting in Chapter 8. It begins with a convergence theorem similar to Theorem 6.2.1, but which applies to non-monotone sequences.