Stopping Times
The Markov property of the previous page restarts the Itô diffusion at a deterministic time: conditionally on the information at time \(t\), the future \(X^x_{t+h}\) behaves like a fresh copy of the diffusion launched from \(X^x_t\). But the times at which one most wants to restart a diffusion are rarely deterministic. The first time the process leaves an interval, the first time it reaches a level, the first time a running cost exceeds a budget: each of these is a time read off from the path itself. The previous page closed by asking what a random time must satisfy for the restart question to make sense. This page answers the question, and then proves that the driving noise restarts at every such time: after a stopping time, Brownian motion begins afresh, independent of everything the stopping time has seen. Upgrading that restart from the noise to the diffusion itself harvests the strong Markov property, the engine behind the exit-time computations of the coming pages.
The setting is unchanged. Throughout, \(w_t\) is the standard one-dimensional Brownian motion, \(\{\mathcal{F}_t\}\) is the filtration generated by the motion and the null sets, and \(X^x\) is the Itô diffusion with Lipschitz coefficients \(b\) and \(\sigma\), started at \(x \in \mathbb{R}\). We work in one dimension, with the several-component version deferred as before. The two definitions that follow are stated for an arbitrary filtration, because they will later be applied both to \(\{\mathcal{F}_t\}\) and to shifted filtrations built from it.
Let \(\{\mathcal{M}_t\}_{t \geq 0}\) be a filtration on a probability space \((\Omega, \mathcal{F}, \mathbb{P})\). A map \(\tau : \Omega \to [0, \infty]\) is a stopping time with respect to \(\{\mathcal{M}_t\}\) if
\[ \{ \omega : \tau(\omega) \leq t \} \in \mathcal{M}_t \quad \text{for every } t \geq 0 . \]
The definition encodes a prohibition on peeking ahead. Whether \(\tau\) has occurred by time \(t\) must be decidable from the information available at time \(t\); an observer watching the flow of information can raise a flag the moment \(\tau\) occurs, without ever consulting the future. The value \(\infty\) is permitted and means that \(\tau\) never occurs; several statements below therefore carry the hypothesis \(\tau \lt \infty\) almost surely. Every deterministic time \(\tau \equiv t_0\) is a stopping time, since \(\{\tau \leq t\}\) is either \(\Omega\) or \(\emptyset\). The interesting examples are genuinely random, and the next section certifies the one the track actually needs.
Conditioning on the information available at a deterministic time \(t\) means conditioning on \(\mathcal{M}_t\). To state a Markov property at a random time, we need the analogous object: the \(\sigma\)-algebra of events decidable by time \(\tau\).
Let \(\tau\) be a stopping time with respect to \(\{\mathcal{M}_t\}\), and let \(\mathcal{M}_\infty\) denote the smallest \(\sigma\)-algebra containing \(\mathcal{M}_t\) for every \(t \geq 0\). The \(\sigma\)-algebra \(\mathcal{M}_\tau\) consists of the sets \(A \in \mathcal{M}_\infty\) such that
\[ A \cap \{ \tau \leq t \} \in \mathcal{M}_t \quad \text{for every } t \geq 0 . \]
The reading is the same as for the definition of a stopping time. An event \(A\) belongs to \(\mathcal{M}_\tau\) when, at every deterministic time \(t\), the part of \(A\) on which \(\tau\) has already occurred is decidable from time-\(t\) information. For a deterministic time \(\tau \equiv t_0\) this recovers \(\mathcal{M}_{t_0}\) itself: the condition at \(t = t_0\) reads \(A \in \mathcal{M}_{t_0}\), the condition at \(t \gt t_0\) then holds automatically because \(\mathcal{M}_{t_0} \subseteq \mathcal{M}_t\), and the condition at \(t \lt t_0\) is vacuous because the intersection is empty. That the name \(\sigma\)-algebra is deserved is part of the next theorem, which collects the bookkeeping facts the rest of the page relies on.
A Calculus of Stopping Times
Let \(\tau\) and \(\rho\) be stopping times with respect to a filtration \(\{\mathcal{M}_t\}\) on \((\Omega, \mathcal{F}, \mathbb{P})\), and let \(v \geq 0\) be a constant.
(i) New stopping times from old.
\(\tau \wedge \rho\), \(\tau \vee \rho\), and \(\tau + v\) are
stopping times.
(ii) The past is a \(\sigma\)-algebra.
\(\mathcal{M}_\tau\) is a \(\sigma\)-algebra, and \(\tau\) is
\(\mathcal{M}_\tau\)-measurable.
(iii) Monotonicity.
If \(\tau \leq \rho\) pointwise, then
\(\mathcal{M}_\tau \subseteq \mathcal{M}_\rho\).
(iv) Dyadic discretization.
For \(n \in \mathbb{N}\) define
\(\tau_n(\omega) = (k+1) 2^{-n}\) when
\(\tau(\omega) \in [k 2^{-n}, (k+1) 2^{-n})\) for
\(k \in \mathbb{Z}_{\geq 0}\), and \(\tau_n(\omega) = \infty\)
when \(\tau(\omega) = \infty\). Then each \(\tau_n\) is a
stopping time taking values in the grid
\(G_n = \{ k 2^{-n} : k \in \mathbb{N} \} \cup \{\infty\}\),
the sequence decreases pointwise with
\(\tau \lt \tau_n \leq \tau + 2^{-n}\) on
\(\{\tau \lt \infty\}\), and for every
\(A \in \mathcal{M}_\tau\) and every \(g \in G_n\) with
\(g \lt \infty\),
\[ A \cap \{ \tau_n = g \} \in \mathcal{M}_g . \]
(v) The state at a stopping time.
If \(Y : [0,\infty) \times \Omega \to \mathbb{R}\) is
progressively measurable
with respect to \(\{\mathcal{M}_t\}\), then the map
\(\omega \mapsto Y(\tau(\omega), \omega)\), defined on
\(\{\tau \lt \infty\}\), is
\(\mathcal{M}_\tau\)-measurable.
Item (i).
For every \(t \geq 0\),
\[ \begin{align*} \{ \tau \wedge \rho \leq t \} &= \{ \tau \leq t \} \cup \{ \rho \leq t \} \in \mathcal{M}_t , \\\\ \{ \tau \vee \rho \leq t \} &= \{ \tau \leq t \} \cap \{ \rho \leq t \} \in \mathcal{M}_t . \end{align*} \]
For the shift, \(\{ \tau + v \leq t \}\) is empty when \(t \lt v\), and for \(t \geq v\) it equals \(\{ \tau \leq t - v \} \in \mathcal{M}_{t-v} \subseteq \mathcal{M}_t\).
Item (ii).
\(\Omega \cap \{\tau \leq t\} = \{\tau \leq t\} \in
\mathcal{M}_t\), so \(\Omega \in \mathcal{M}_\tau\). If
\(A \in \mathcal{M}_\tau\), then
\[ (\Omega \setminus A) \cap \{ \tau \leq t \} = \{ \tau \leq t \} \setminus \bigl( A \cap \{ \tau \leq t \} \bigr) \in \mathcal{M}_t , \]
and complements in \(\mathcal{M}_\infty\) are inherited, so \(\Omega \setminus A \in \mathcal{M}_\tau\). Countable unions pass through the intersection with \(\{\tau \leq t\}\) directly. For the measurability of \(\tau\), fix \(s \geq 0\); the set \(\{\tau \leq s\}\) satisfies
\[ \{ \tau \leq s \} \cap \{ \tau \leq t \} = \{ \tau \leq s \wedge t \} \in \mathcal{M}_{s \wedge t} \subseteq \mathcal{M}_t , \]
so \(\{\tau \leq s\} \in \mathcal{M}_\tau\), and the sets \(\{\tau \leq s\}\) for \(s \geq 0\) together with \(\{\tau = \infty\} = \Omega \setminus \bigcup_m \{\tau \leq m\}\) generate the Borel structure of \([0, \infty]\).
Item (iii).
Let \(A \in \mathcal{M}_\tau\). Since \(\tau \leq \rho\),
\(\{\rho \leq t\} \subseteq \{\tau \leq t\}\), so
\[ A \cap \{ \rho \leq t \} = \bigl( A \cap \{ \tau \leq t \} \bigr) \cap \{ \rho \leq t \} \in \mathcal{M}_t , \]
the second factor lying in \(\mathcal{M}_t\) because \(\rho\) is a stopping time.
Item (iv).
First, \(\{\tau \lt s\} = \bigcup_m \{\tau \leq s - 1/m\}
\in \mathcal{M}_s\) for every \(s \gt 0\), the union running
over \(m \in \mathbb{N}\) with \(1/m \lt s\). For a finite
grid point \(g = (k+1) 2^{-n}\),
\[ \{ \tau_n = g \} = \{ \tau \lt g \} \setminus \{ \tau \lt g - 2^{-n} \} \in \mathcal{M}_g , \]
reading \(\{\tau \lt 0\} = \emptyset\) for \(k = 0\). Hence for \(t \geq 0\),
\[ \{ \tau_n \leq t \} = \bigcup_{g \in G_n ,\; g \leq t} \{ \tau_n = g \} \in \mathcal{M}_t , \]
a finite union of sets lying in \(\mathcal{M}_g \subseteq \mathcal{M}_t\), so \(\tau_n\) is a stopping time. On \(\{\tau \lt \infty\}\) the defining half-open window gives \(\tau \lt \tau_n \leq \tau + 2^{-n}\) directly. For the monotonicity, fix \(\omega\) with \(\tau(\omega) \in [k 2^{-n-1}, (k+1) 2^{-n-1})\), so that \(\tau_{n+1}(\omega) = (k+1) 2^{-n-1}\); the window \([k 2^{-n-1}, (k+1) 2^{-n-1})\) is contained in a single window of the coarser grid whose right endpoint is at least \((k+1) 2^{-n-1}\), whence \(\tau_{n+1}(\omega) \leq \tau_n(\omega)\). Finally, let \(A \in \mathcal{M}_\tau\) and \(g = (k+1)2^{-n}\). Then
\[ A \cap \{ \tau_n = g \} = \bigl( A \cap \{ \tau \lt g \} \bigr) \setminus \bigl( A \cap \{ \tau \lt g - 2^{-n} \} \bigr) , \]
and for every \(s \gt 0\),
\[ A \cap \{ \tau \lt s \} = \bigcup_{m} \bigl( A \cap \{ \tau \leq s - 1/m \} \bigr) \in \mathcal{M}_s , \]
each term lying in \(\mathcal{M}_{s - 1/m} \subseteq \mathcal{M}_s\) by the definition of \(\mathcal{M}_\tau\). Taking \(s = g\) and \(s = g - 2^{-n}\) closes item (iv).
Item (v).
Write \(Y_\tau\) for the map in question and fix a Borel set
\(B \subseteq \mathbb{R}\) and \(t \geq 0\). On
\(\{\tau \leq t\}\) we have \(Y_\tau = Y_{\tau \wedge t}\),
so
\[ \{ Y_\tau \in B \} \cap \{ \tau \leq t \} = \{ Y_{\tau \wedge t} \in B \} \cap \{ \tau \leq t \} . \]
The map \(\omega \mapsto (\tau(\omega) \wedge t, \omega)\) from \(\Omega\) to \([0, t] \times \Omega\) is measurable from \(\mathcal{M}_t\) to \(\mathcal{B}([0,t]) \otimes \mathcal{M}_t\): its second component is the identity, and its first component is \(\mathcal{M}_t\)-measurable because \(\{\tau \wedge t \leq s\}\) equals \(\{\tau \leq s\} \in \mathcal{M}_s \subseteq \mathcal{M}_t\) for \(s \lt t\) and equals \(\Omega\) for \(s \geq t\). Progressive measurability says precisely that the restriction of \(Y\) to \([0,t] \times \Omega\) is \(\mathcal{B}([0,t]) \otimes \mathcal{M}_t\)-measurable, so the composition \(Y_{\tau \wedge t}\) is \(\mathcal{M}_t\)-measurable, and the displayed intersection lies in \(\mathcal{M}_t\). Letting \(t\) run over \(\mathbb{N}\) shows \(\{Y_\tau \in B\} \cap \{\tau \lt \infty\} \in \mathcal{M}_\infty\), and the display then verifies the defining condition of \(\mathcal{M}_\tau\). Here measurability is meant on the event \(\{\tau \lt \infty\}\), which itself lies in \(\mathcal{M}_\tau\) because its intersection with \(\{\tau \leq t\}\) is \(\{\tau \leq t\}\) again.
Item (iv) is the workhorse of this page. It replaces an arbitrary stopping time by a decreasing sequence of stopping times taking countably many values, at the price of an error at most \(2^{-n}\), and it guarantees that every event decided by time \(\tau\) slices compatibly along the values of the discretization. Both halves are used repeatedly in the restart section below, and again in the proof that the diffusion itself restarts.