TheoremBase

Stopping Times on a Compact Time Interval: Elementary Operations, the Prior Sigma-Algebra, Dyadic Approximation, Sampling, and Hitting Times

Statement

Let R\mathbb{R} be the real numbers, let (Ω,F,P)(\Omega,\mathcal{F},P) be a probability space, let T>0T>0 be real, and let (Ft)t∈[0,T](\mathcal{F}_t)_{t\in[0,T]} be a filtration on (Ω,F,P)(\Omega,\mathcal{F},P) with time index restricted to [0,T][0,T]. Stopping times are those of (Ft)t∈[0,T](\mathcal{F}_t)_{t\in[0,T]}, the σ\sigma-algebra of events prior to a stopping time τ\tau is denoted Fτ\mathcal{F}_\tau, and for a family X=(Xt)t∈[0,T]X=(X_t)_{t\in[0,T]} of real-valued functions on Ω\Omega the sampled function XτX_\tau and stopped family XτX^\tau are as defined there. A family XX is adapted when XtX_t is an Ft\mathcal{F}_t-measurable random variable for every t∈[0,T]t\in[0,T], progressive measurability is with respect to (Ft)t∈[0,T](\mathcal{F}_t)_{t\in[0,T]}, a path of XX is a map s↦Xs(ω)s\mapsto X_s(\omega) on [0,T][0,T] at a fixed ω\omega, and a path is right-continuous in the sense of the progressive measurability toolkit: for every s∈[0,T]s\in[0,T] and every sequence (sj)j∈N(s_j)_{j\in\mathbb{N}} in [s,T][s,T] converging to ss, the sequence (Xsj(ω))j∈N(X_{s_j}(\omega))_{j\in\mathbb{N}} converges to Xs(ω)X_s(\omega). Throughout, a real-valued function on a subinterval II of the real numbers R\mathbb{R} is called continuous on II when it is continuous relative to II, both II and the codomain R\mathbb{R} carrying the metric of the real line. For a natural number nn let

Dn={kT2−n: k∈{0,1,…,2n}}D_n=\{kT2^{-n}:\ k\in\{0,1,\dots,2^n\}\}

be the nn-th dyadic grid of [0,T][0,T]. For a function τ:Ω→[0,T]\tau:\Omega\to[0,T] and t∈[0,T]t\in[0,T] write {τ≤t}\{\tau\le t\} for {ω∈Ω:τ(ω)≤t}\{\omega\in\Omega:\tau(\omega)\le t\}, and similarly for <<, ==, ≥\ge, >>.

1. (Elementary stopping times.) Every constant function ω↦c\omega\mapsto c with c∈[0,T]c\in[0,T] is a stopping time. If σ\sigma and τ\tau are stopping times, then so are the pointwise minimum min⁡(σ,τ)\min(\sigma,\tau) and the pointwise maximum max⁡(σ,τ)\max(\sigma,\tau). If τ\tau is a stopping time, then for every t∈[0,T]t\in[0,T] the four sets {τ<t}\{\tau<t\}, {τ=t}\{\tau=t\}, {τ≥t}\{\tau\ge t\}, {τ>t}\{\tau>t\} belong to Ft\mathcal{F}_t, and τ\tau, regarded as a real-valued function on Ω\Omega, is measurable with respect to FT\mathcal{F}_T and the Borel σ\sigma-algebra of the real line.

2. (The prior σ\sigma-algebra.) Let σ\sigma and τ\tau be stopping times. Then Fτ\mathcal{F}_\tau is a σ\sigma-algebra on Ω\Omega contained in FT\mathcal{F}_T; the function τ\tau is measurable with respect to Fτ\mathcal{F}_\tau and the Borel σ\sigma-algebra; if τ\tau is the constant c∈[0,T]c\in[0,T] then Fτ=Fc\mathcal{F}_\tau=\mathcal{F}_c; if σ(ω)≤τ(ω)\sigma(\omega)\le\tau(\omega) for every ω∈Ω\omega\in\Omega, then Fσ⊆Fτ\mathcal{F}_\sigma\subseteq\mathcal{F}_\tau; and for every s∈[0,T]s\in[0,T] and every A∈FsA\in\mathcal{F}_s,

A∩{τ>s}∈Fmin⁡(s,τ),A\cap\{\tau>s\}\in\mathcal{F}_{\min(s,\tau)},

where min⁡(s,τ)\min(s,\tau) denotes the stopping time ω↦min⁡(s,τ(ω))\omega\mapsto\min(s,\tau(\omega)).

3. (Dyadic approximation from above.) Let τ\tau be a stopping time and, for each natural number nn, define

τn(ω)=min⁡{d∈Dn: d≥τ(ω)}(ω∈Ω),\tau_n(\omega)=\min\{d\in D_n:\ d\ge\tau(\omega)\}\qquad(\omega\in\Omega),

the least grid point of DnD_n not below τ(ω)\tau(\omega) (which exists since T∈DnT\in D_n). Then τn\tau_n is a stopping time with values in DnD_n; for every ω\omega and nn,

τ(ω)≤τn+1(ω)≤τn(ω)≤τ(ω)+T2−n,\tau(\omega)\le\tau_{n+1}(\omega)\le\tau_n(\omega)\le\tau(\omega)+T2^{-n},

so that (τn(ω))n∈N(\tau_n(\omega))_{n\in\mathbb{N}} converges to τ(ω)\tau(\omega) for every ω∈Ω\omega\in\Omega; {τn=0}={τ=0}\{\tau_n=0\}=\{\tau=0\} and, for k∈{1,…,2n}k\in\{1,\dots,2^n\}, {τn=kT2−n}={(k−1)T2−n<τ≤kT2−n}\{\tau_n=kT2^{-n}\}=\{(k-1)T2^{-n}<\tau\le kT2^{-n}\}; Fτ⊆Fτn\mathcal{F}_\tau\subseteq\mathcal{F}_{\tau_n}; and if σ\sigma is a stopping time with σ≤τ\sigma\le\tau pointwise, then σn≤τn\sigma_n\le\tau_n pointwise, where σn\sigma_n is defined from σ\sigma in the same way.

4. (Sampling a progressively measurable process.) Let X=(Xt)t∈[0,T]X=(X_t)_{t\in[0,T]} be progressively measurable and let τ\tau be a stopping time.

(i) For every t∈[0,T]t\in[0,T] the function Xtτ=Xmin⁡(t,τ)X^\tau_t=X_{\min(t,\tau)} is Ft\mathcal{F}_t-measurable; thus the stopped family XτX^\tau is adapted.

(ii) The sampled function XτX_\tau is measurable with respect to Fτ\mathcal{F}_\tau and the Borel σ\sigma-algebra; in particular it is an FT\mathcal{F}_T-measurable random variable.

(iii) Let ω∈Ω\omega\in\Omega be a point at which the path of XX is right-continuous, and let τn\tau_n be as in claim 3. Then the sequence (Xτn(ω))n∈N(X_{\tau_n}(\omega))_{n\in\mathbb{N}} converges to Xτ(ω)X_\tau(\omega), and the path of XτX^\tau at ω\omega is right-continuous. Consequently, if XX is adapted and every path of XX is right-continuous, then XτX^\tau is adapted with every path right-continuous, hence progressively measurable.

5. (Hitting times of continuous adapted processes.) Let Y=(Yt)t∈[0,T]Y=(Y_t)_{t\in[0,T]} be adapted with every path continuous on [0,T][0,T], and let cc be a real number. For ω∈Ω\omega\in\Omega let H(ω)={t∈[0,T]:Yt(ω)≥c}H(\omega)=\{t\in[0,T]:Y_t(\omega)\ge c\} and define

τ(ω)={inf⁡H(ω)if H(ω)≠∅,Tif H(ω)=∅,\tau(\omega)=\begin{cases}\inf H(\omega)&\text{if }H(\omega)\neq\emptyset,\\ T&\text{if }H(\omega)=\emptyset,\end{cases}

the infimum in the first case being the greatest lower bound, which exists by the existence theorem for infima since there H(ω)H(\omega) is nonempty and bounded below by 00. Then τ\tau is a stopping time; Yt(ω)<cY_t(\omega)<c for every ω\omega and every t∈[0,T]t\in[0,T] with t<τ(ω)t<\tau(\omega); and Yτ(ω)(ω)≥cY_{\tau(\omega)}(\omega)\ge c whenever H(ω)≠∅H(\omega)\neq\emptyset, in particular for every ω\omega with τ(ω)<T\tau(\omega)<T.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…