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 }\)

Chapter 1 Expectation and Arbitrage

In this chapter we look at our first example of a financial market. We introduce the idea of arbitrage free pricing, and discuss what tools we would need to build better models.

1.1 Betting on coin tosses

We begin by looking at a simple betting game. Someone tosses a fair coin. They offer to pay you \(\$1\) if the coin comes up heads and nothing if the coin comes up tails. How much are you prepared to pay to play the game?

One way that you might answer this question is to look at the expected return of playing the game. If the (random) amount of money that you win is \(X\), then you’d expect to make

\[\E [X]=\tfrac {1}{2}\$1+\tfrac {1}{2}\$0=\$0.50.\]

So you might offer to pay \(\$0.50\) to play the game.

We can think of a single play as us paying some amount to buy a random quantity. That is, we pay \(\$0.50\) to buy the random quantity \(X\), then later on we discover if \(X\) is \(\$1\) or \(\$0\).

We can link this ‘pricing by expectation’ to the long term average of our winnings, if we played the game multiple times. Formally this uses the strong law of large numbers:

  • Theorem 1.1.1 Let \((X_i)_{i\in \N }\) be a sequence of random variables that are independent and identically distributed. Suppose that \(\E [X_1]=\mu \) and \(\var (X_1)<\infty \), and set

    \[S_n=\frac {X_1+X_2+\ldots +X_n}{n}.\]

    Then, with probability one, \(S_n\to \mu \) as \(n\to \infty \).

In our case, if we played the game a large number \(n\) of times, and on play \(i\) our winnings were \(X_i\), then our average winnings would be \(S_n\approx \E [X_1]=\frac 12\). So we might regard \(\$0.50\) as a ‘fair’ price to pay for a single play. If we paid less, in the long run we’d make money, and if we paid more, in the long run we’d lose money.

Often, though, you might not be willing to pay this price. Suppose your life savings were \(\$20,000\). You probably (hopefully) wouldn’t gamble it on the toss of a single coin, where you would get \(\$40,000\) on heads and \(\$0\) on tails; it’s too risky.

It is tempting to hope that the fairest way to price anything is to calculate its expected value, and then charge that much. As we will explain in the rest of Chapter 1, this tempting idea turns out to be completely wrong.