betaFeedback

WorksMathematics

An Introduction to Applied Probability and Stochastic Processes: Open Lecture Notes

Abstract

These open lecture notes provide a broad introduction to measure-theoretic probability and stochastic processes, with a focus on applications. Topics include probability spaces, conditional expectation, generating and characteristic functions, Markov chains in discrete and continuous time, convergence of random variables, Brownian motion, stochastic calculus, stochastic differential equations and their connection to partial differential equations, jump diffusions, stochastic control, optimal stopping, and Monte Carlo methods. Most chapters include exercises, and solutions are provided. The notes were written for a two-quarter course for first-year PhD students in applied mathematics, and should also be useful to graduate students in statistics, engineering, economics and finance. The LaTeX source is freely available on GitHub under a CC BY-SA 4.0 license, and readers are encouraged to fork the notes and contribute corrections, improvements, and new material.

Open Lecture Notes

Version 1.70 (November 2026)

Preface

These notes provide a broad introduction to measure-theoretic probability and stochastic processes. They were written for a two-quarter course for first-year PhD students in applied mathematics at the University of Washington, but they should also be useful to graduate students in statistics, engineering, economics and finance, and to anyone studying the subject on their own. Readers are assumed to be familiar with undergraduate probability, real analysis and linear algebra; some exposure to ordinary and partial differential equations is helpful.

The first half of the notes covers probability spaces, conditional expectation, generating and characteristic functions, Markov chains in discrete and continuous time, and convergence of random variables. The second half covers Brownian motion, stochastic calculus, stochastic differential equations and their connection to partial differential equations, jump diffusions, stochastic control, optimal stopping and Monte Carlo methods. Most chapters end with exercises, and solutions are collected at the end of the notes.

The focus of these notes is on the applied aspects of the subject. Mathematical statements (definitions, theorems, propositions, lemmas and corollaries) are intended to be rigorously true. Proofs, however, are sometimes only sketched, or make simplifying assumptions that avoid technical complications; where this is the case, we say so. Each chapter begins with a list of references, which the interested reader can consult for complete proofs. Some examples and exercises are adapted from these references.

An open and evolving set of notes

These notes are released under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA 4.0). The LaTeX source is available at

https://github.com/mattlorig/intro-probability-stochastic-processes.

Readers are encouraged to report errors, suggest improvements and contribute new material by opening an issue or a pull request; see the file CONTRIBUTING.md in the repository. Text in blue marks material that is still under development. Information on how to cite these notes (including their arXiv identifier and DOI) can be found in the repository.

Acknowledgments

The author of these notes wishes to express his sincere thanks to Weston Barger and Yu-Chen Cheng for checking and writing solutions to the exercises as well as making corrections and improvements to the text, and to the contributors listed on GitHub.

Donations

If you find these notes useful and would like to make a donation to help me develop them further you can donate ETH or ERC20 tokens to the address below.

ETH address: 0x3D6042D6a6f39735bbAd43ad1Aa676113D55BaAC

Review of probability

The notes from this chapter are taken primarily from (Shreve, 2004, Chapter 1) and (Grimmett and Stirzaker, 2001, Chapters 1–5).

Events as sets

Definition 1.1.1. The set of all possible outcomes of an experiment is called the sample space. We denote the sample space as Ω\Omega.

We will typically denote by ω\omega a generic element of Ω\Omega.

Definition 1.1.2. An event is a subset of the sample space. We usually denote events by capital roman letters A, B, C, . . ..

Example 1.1.3 (Toss a coin once). When one tosses a coin, there are two possible outcomes: heads (H) and tails (T). Thus, we have Ω={H,T}\Omega= \{\mathrm{H}, \mathrm{T}\}. One element of Ω\Omega is, e.g., ω=H\omega= \mathrm{H}. Possible event: “toss a head.” A=HA = \mathrm{H}.

Example 1.1.4 (Toss two distinguishable coins). Ω={(HH),(HT),(TH),(TT)}\Omega= \{(\mathrm{HH}),(\mathrm{HT}),(\mathrm{TH}),(\mathrm{TT})\}. One element of Ω\Omega is, e.g., ω=(HT)\omega= (\mathrm{HT}). Possible event: ‘’second toss a tail.” A={(HT),(TT)}A = \{(\mathrm{HT}),(\mathrm{TT})\}.

Example 1.1.5 (Toss two indistinguishable coins). Ω={{HH},{HT},{TT}}\Omega= \{\{\mathrm{HH}\},\{\mathrm{HT}\},\{\mathrm{TT}\}\}. One element of Ω\Omega is, e.g., {HH}\{\mathrm{HH}\}. Possible event: ‘’coins match.” A={{HH},{TT}}A = \{\{\mathrm{HH}\},\{\mathrm{TT}\}\}.

Example 1.1.6 (Roll a die). Ω={1,2,3,4,5,6}\Omega= \{1, 2, 3, 4, 5, 6\}. One element of Ω\Omega is, e.g., ω=2\omega= 2. Possible event: “roll an odd number.” A={1,3,5}A = \{1, 3, 5\}.

Here, we use (⋅)(\cdot) to denote an ordered sequence and we use {⋅}\{\cdot\} to denote an unordered set. Thus, (HT)≠(TH)(\mathrm{HT}) \ne(\mathrm{TH}) but {HT}={TH}\{\mathrm{HT}\} = \{\mathrm{TH}\}.

If A and B are subsets of Ω\Omega, we can reasonably concern ourselves with events such as “not A” (AcA^{c}), “A or B” (A∪BA \cup B), “A and B” (A∩BA \cap B), etc. A σ\sigma-algebra is a mathematical way to describe all possible sets of interest for a given sample space Ω\Omega.

Definition 1.1.7. A collection F\mathcal{F} of subsets of Ω\Omega is called a σ\sigma-algebra if it satisfies

  1. contains the empty set: ∅∈F\varnothing\in\mathcal{F};

  2. is closed under countable unions: A1,A2,A3,…∈F⇒⋃iAi∈FA_1, A_2, A_3, \ldots\in\mathcal{F} \Rightarrow\bigcup_i A_i \in\mathcal{F};

  3. is closed under complements: A∈F⇒Ac∈FA \in\mathcal{F} \Rightarrow A^c \in\mathcal{F};

Note that if F\mathcal{F} is a σ\sigma-algebra then Ω∈F\Omega\in\mathcal{F} by items 1 and 3. Note also that F\mathcal{F} is closed under countable intersections since

A1,A2,A3,…∈F⇒A1c,A2c,A3c,…∈F⇒⋃iAic∈F⇒(⋃iAic)c∈F⇒⋂iAi∈F.\begin{aligned} A_1,A_2,A_3,\ldots&\in\mathcal{F} &&\Rightarrow A_1^c,A_2^c,A_3^c,\ldots\in\mathcal{F}\\ &&&\Rightarrow\bigcup_i A_i^c \in\mathcal{F}\\ &&&\Rightarrow\left(\bigcup_i A_i^c\right)^c \in\mathcal{F}\\ &&&\Rightarrow\bigcap_i A_i \in\mathcal{F}. \end{aligned}

Alternatively, one can define a σ\sigma-algebra F\mathcal{F} as a set of subsets of Ω\Omega that contains at least the empty set ∅\varnothing and is closed under countable set operations (though, not necessarily closed under uncountable set operators).

Example 1.1.8 (Trivial σ\sigma-algebra). The set of subsets F0:={∅,Ω}\mathcal{F}_0 := \{\varnothing,\Omega\} of Ω\Omega is commonly referred to as the trivial σ\sigma-algebra.

Example 1.1.9. If AA is a subset of Ω\Omega then FA:={∅,Ω,A,Ac}\mathcal{F}_A := \{\varnothing,\Omega,A,A^c\} is a σ\sigma-algebra.

Example 1.1.10. The power set of Ω\Omega, written 2Ω2^\Omega is the collection of all subsets of Ω\Omega. The power set F=2Ω\mathcal{F} = 2^\Omega is a σ\sigma-algebra.

Definition 1.1.11. Let G\mathcal{G} be a collection of subsets of Ω\Omega. The σ\sigma-algebra generated by G\mathcal{G}, written σ(G)\sigma(\mathcal{G}), is the smallest σ\sigma-algebra that contains G\mathcal{G}.

By “smallest” σ\sigma-algebra we mean the σ\sigma-algebra with the fewest sets. One can show (although we will not do so in these notes) that σ(G)\sigma(\mathcal{G}) is equal to the intersection of all σ\sigma-algebras that contain G\mathcal{G}.

Example 1.1.12. The collection of sets G={∅,A,Ω}\mathcal{G} = \{\emptyset, A, \Omega\} is not a σ\sigma-algebra because it does not contain AcA^{c}. However, we could create a σ\sigma-algebra from G\mathcal{G} by simply adding the set AcA^{c}. Thus, we have σ(G)={∅,Ω,A,Ac}\sigma(\mathcal{G}) = \{\emptyset, \Omega, A, A^{c}\}.

Definition 1.1.13. The pair (Ω,F)(\Omega, \mathcal{F}) where Ω\Omega is a sample space and F\mathcal{F} is a σ\sigma-algebra of subsets of Ω\Omega is called a measurable space.

Probability

So far, we have not yet talked about probabilities at all – only outcomes of a random experiment (elements ω∈Ω\omega\in\Omega) and events (subsets A⊆ΩA \subseteq\Omega). A probability measure assigns probabilities to events.

Definition 1.2.1. A probability measure defined on (Ω,F)(\Omega, \mathcal{F}) is a function P:F→[0,1]\mathbb{P} : \mathcal{F} \to[0,1] that satisfies

  1. P(Ω)=1\mathbb{P}(\Omega) = 1;

  2. if Ai∩Aj=∅A_i \cap A_j = \emptyset for i≠ji \ne j then P(⋃iAi)=∑iP(Ai)\mathbb{P}(\bigcup_i A_i) = \sum_i \mathbb{P}(A_i). (countable additivity)

As we shall see in § 4.3.2, it is very important to recognize that Item 2 holds only for countable unions. For an uncountable union it is not true that P(⋃αAα)=∑αP(Aα)\mathbb{P}(\bigcup_\alpha A_\alpha) = \sum_\alpha\mathbb{P}(A_\alpha).

How can we see the well-known result P(Ac)=1−P(A)\mathbb{P}(A^c) = 1 - \mathbb{P}(A) from the above definition? Simply note that

1=P(Ω)=P(A∪Ac)=P(A)+P(Ac).1 = \mathbb{P}(\Omega) = \mathbb{P}(A \cup A^c) = \mathbb{P}(A) + \mathbb{P}(A^c).

A probability measure P\mathbb{P} does not need to correspond to empirically observed probabilities! For example, from experience, we know that if we toss a fair coin we have P(H)=P(T)=1/2\mathbb{P}(\mathrm{H}) = \mathbb{P}(\mathrm{T}) = 1/2. However, we can always define a measure P~\widetilde{\mathbb{P}} that assigns different probabilities P~(H)=p\widetilde{\mathbb{P}}(\mathrm{H}) = p and P~(T)=1−p\widetilde{\mathbb{P}}(\mathrm{T}) = 1 - p. As long as p∈[0,1]p \in[0,1] the measure P~\widetilde{\mathbb{P}} is a probability measure on (Ω,F)(\Omega, \mathcal{F}) where Ω={H,T}\Omega= \{\mathrm{H}, \mathrm{T}\} and F={∅,Ω,H,T}\mathcal{F} = \{\emptyset, \Omega, \mathrm{H}, \mathrm{T}\}.

The triple (Ω,F,P)(\Omega, \mathcal{F}, \mathbb{P}) is often referred to as a probability space or probability triple. To review, the sample space Ω\Omega is the collection of all possible outcomes of an experiment. The σ\sigma-algebra F\mathcal{F} is all sets of interest of an experiment. And the probability measure P\mathbb{P} assigns probabilities to these sets.

When a sample space is countable Ω={ω1,ω2,…}\Omega= \{\omega_1, \omega_2, \ldots\}, we can always take the σ\sigma-algebra as the power set F=2Ω\mathcal{F} = 2^\Omega and construct a probability measure P\mathbb{P} on (Ω,F)(\Omega, \mathcal{F}) by specifying the probabilities of each individual outcome P(ωi)=pi\mathbb{P}(\omega_i) = p_i. However, when the sample space Ω\Omega is uncountable, choosing an appropriate σ\sigma-algebra F\mathcal{F}, and constructing a probability measure P\mathbb{P} on (Ω,F)(\Omega, \mathcal{F}) is a more delicate procedure.

Infinite probability spaces

In this section, we construct a probability measure on two uncountable sample spaces.

Uniform Lebesgue measure on (0,1)

In our first example, we will construct a mathematical model for choosing a number at random on the open interval (0,1)(0,1). Thus, we take Ω=(0,1)\Omega=(0,1). Note that this sample space is uncountable. A particular outcome is, e.g., ω=0.5\omega=0.5 or ω=1/2\omega=1/\sqrt{2}. Clearly, the number of possible outcomes is infinite. We would like to construct a probability P\mathbb{P} so that all numbers in the interval (0,1)(0,1) are equally likely to be chosen. It makes sense, then, to choose

P({ω:ω∈(a,b)})=μ((a,b)):=b−a,0<a≤b<1,(1)\mathbb{P}(\{\omega:\omega\in(a,b)\})=\mu((a,b)):=b-a,\qquad0<a\leq b<1, \tag*{(1)}

where we have defined the Lebesgue measure μ\mu. Equation (1) tells us how to determine the probability that ω\omega falls within an open interval. But, in fact, (1) tells us more than that. If P\mathbb{P} is to be a probability measure, then it must satisfy the countable additivity property given in Definition 1.2.1. Thus, we also know, for example, that

P({ω:ω∈(a,b)∪(c,d)})=P({ω:ω∈(a,b)})+P({ω:ω∈(c,d)})=(b−a)+(d−c),0<a<b<c<d<1.\begin{aligned} \mathbb{P}(\{\omega:\omega\in(a,b)\cup(c,d)\})&=\mathbb{P}(\{\omega:\omega\in(a,b)\})+\mathbb{P}(\{\omega:\omega\in(c,d)\})\\ &=(b-a)+(d-c),\qquad0<a<b<c<d<1. \end{aligned}

It is natural to ask, what are all of the sub-sets of (0,1)(0,1) whose probabilities are uniquely determined by (1)? Surprisingly, the answer is not the power set 2(0,1)2^{(0,1)}. It turns out that the power set 2(0,1)2^{(0,1)} has sets whose probabilities are not determined by (1). The sets whose probabilities are uniquely determined by (1) and Definition 1.2.1 are the sets in σ\sigma-algebra generated by the open intervals

B((0,1)):=σ(O)),whereO:={A⊆(0,1):A=(a,b), 0≤a<b≤1}.\mathcal{B}((0,1)):=\sigma(\mathcal{O)), \qquad\text{where}\qquad \mathcal{O}:=\{A\subseteq(0,1):A=(a,b),\ 0\leq a<b\leq1\}.}

We call B((0,1))\mathcal{B}((0,1)) the Borel σ\sigma-algebra on (0,1)(0,1). Thus, the appropriate sample space for our experiment is (Ω,F,P)=((0,1),B((0,1)),μ)(\Omega,\mathcal{F},\mathbb{P})=((0,1),\mathcal{B}((0,1)),\mu).

We can generalize the notion of Borel sets to all topological spaces.

Definition 1.3.1. Let Ω\Omega be some topological space and let O(Ω)\mathcal{O}(\Omega) be the set of open sets in Ω\Omega. We define we define the Borel σ\sigma-algebra on Ω\Omega, denoted B(Ω)\mathcal{B}(\Omega) by B(Ω):=σ(O(Ω))\mathcal{B}(\Omega):=\sigma(\mathcal{O}(\Omega)).

Remark 1.3.2. Do not worry too much about what exactly Borel σ\sigma-algebras are. Just think of them as “reasonable” sets. In fact, you would have to think very hard to come up with a set that is not a Borel set.

Infinite sequence of coin tosses

In this section we consider and infinite sequence of coin tosses. We define

Ω:=the set of infinite sequences of Hs and Ts.\Omega:=\text{the set of infinite sequences of Hs and Ts}.

Note that this set is uncountable because there is a one-to-one correspondence between Ω\Omega and the set of reals in [0,1][0,1]. We will denote a generic element of Ω\Omega as follows:

ω=ω1ω2ω3⋯\omega= \omega_1\omega_2\omega_3\cdots

where ωi\omega_i is the result of the iith coin toss. We want to construct a σ\sigma-algebra for this experiment.

Let us define some σ\sigma-algebras. First, consider the trivial σ\sigma-algebra

F0={∅,Ω}.\mathcal{F}_0 = \{\varnothing,\Omega\}.

References

No references were extracted for this paper.

Paper details

vlnc:W_c5y9fm2e
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY-SA 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents