TheoremBase

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

lemmalem:stopping-time-toolkit-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
Reason: Proof of the stopping-time toolkit; approved by Aaron.

Proof

Throughout, for a σ\sigma-algebra G\mathcal{G} on Ω\Omega, a real-valued function ff on Ω\Omega is called G\mathcal{G}-measurable when it is measurable with respect to G\mathcal{G} and the Borel σ\sigma-algebra B(R)\mathcal{B}(\mathbb{R}); by claim 3 of the Borel generator lemma this holds if and only if {f>a}G\{f>a\}\in\mathcal{G} for every real aa (the criterion). All set operations used are finite or countable, so they stay inside the σ\sigma-algebras involved (σ\sigma-algebra axioms).

Claim 1. For the constant c[0,T]c\in[0,T] and t[0,T]t\in[0,T], {ct}\{c\le t\} is Ω\Omega if ctc\le t and \emptyset otherwise, both in Ft\mathcal{F}_t. For stopping times σ,τ\sigma,\tau: {min(σ,τ)t}={σt}{τt}\{\min(\sigma,\tau)\le t\}=\{\sigma\le t\}\cup\{\tau\le t\} and {max(σ,τ)t}={σt}{τt}\{\max(\sigma,\tau)\le t\}=\{\sigma\le t\}\cap\{\tau\le t\}, both in Ft\mathcal{F}_t. Let τ\tau be a stopping time and t[0,T]t\in[0,T]. If t=0t=0 then {τ<0}=\{\tau<0\}=\emptyset. If t>0t>0, then

{τ<t}=mN, t1/m0{τt1/m}:\{\tau<t\}=\bigcup_{m\in\mathbb{N},\ t-1/m\ge0}\{\tau\le t-1/m\}:

the inclusion \supseteq is clear, and if τ(ω)<t\tau(\omega)<t there is, by the Archimedean property, a natural number mm with 1/mtτ(ω)1/m\le t-\tau(\omega), so t1/mτ(ω)0t-1/m\ge\tau(\omega)\ge0 and ω\omega lies in the mm-th set. Each {τt1/m}\{\tau\le t-1/m\} lies in Ft1/mFt\mathcal{F}_{t-1/m}\subseteq\mathcal{F}_t (the filtration being nondecreasing), so {τ<t}Ft\{\tau<t\}\in\mathcal{F}_t as a countable union. Then {τ=t}={τt}{τ<t}\{\tau=t\}=\{\tau\le t\}\setminus\{\tau<t\}, {τt}=Ω{τ<t}\{\tau\ge t\}=\Omega\setminus\{\tau<t\} and {τ>t}=Ω{τt}\{\tau>t\}=\Omega\setminus\{\tau\le t\} lie in Ft\mathcal{F}_t. Finally, for real aa: {τ>a}=Ω\{\tau>a\}=\Omega if a<0a<0; {τ>a}=\{\tau>a\}=\emptyset if aTa\ge T; and {τ>a}=Ω{τa}\{\tau>a\}=\Omega\setminus\{\tau\le a\} with {τa}FaFT\{\tau\le a\}\in\mathcal{F}_a\subseteq\mathcal{F}_T if 0a<T0\le a<T. By the criterion, τ\tau is FT\mathcal{F}_T-measurable.

Claim 2. Fτ\mathcal{F}_\tau is a σ\sigma-algebra contained in FT\mathcal{F}_T. Containment holds by definition. ΩFτ\Omega\in\mathcal{F}_\tau since Ω{τt}={τt}Ft\Omega\cap\{\tau\le t\}=\{\tau\le t\}\in\mathcal{F}_t. If AFτA\in\mathcal{F}_\tau then ΩAFT\Omega\setminus A\in\mathcal{F}_T and (ΩA){τt}={τt}(A{τt})Ft(\Omega\setminus A)\cap\{\tau\le t\}=\{\tau\le t\}\setminus\big(A\cap\{\tau\le t\}\big)\in\mathcal{F}_t. If A1,A2,FτA_1,A_2,\dots\in\mathcal{F}_\tau then jAjFT\bigcup_jA_j\in\mathcal{F}_T and (jAj){τt}=j(Aj{τt})Ft\big(\bigcup_jA_j\big)\cap\{\tau\le t\}=\bigcup_j\big(A_j\cap\{\tau\le t\}\big)\in\mathcal{F}_t. Measurability of τ\tau. For real aa, {τ>a}FT\{\tau>a\}\in\mathcal{F}_T by claim 1, and for t[0,T]t\in[0,T]: {τ>a}{τt}\{\tau>a\}\cap\{\tau\le t\} equals {τt}\{\tau\le t\} if a<0a<0, equals \emptyset if ata\ge t, and equals {τt}{τa}\{\tau\le t\}\setminus\{\tau\le a\} with {τa}FaFt\{\tau\le a\}\in\mathcal{F}_a\subseteq\mathcal{F}_t if 0a<t0\le a<t; in every case it lies in Ft\mathcal{F}_t. Hence {τ>a}Fτ\{\tau>a\}\in\mathcal{F}_\tau and the criterion applies. Constants. Let τc\tau\equiv c. If AFτA\in\mathcal{F}_\tau then A=A{τc}FcA=A\cap\{\tau\le c\}\in\mathcal{F}_c. Conversely if AFcA\in\mathcal{F}_c then AFTA\in\mathcal{F}_T, and A{τt}A\cap\{\tau\le t\} equals AFcFtA\in\mathcal{F}_c\subseteq\mathcal{F}_t when tct\ge c and \emptyset otherwise. Monotonicity. Let στ\sigma\le\tau pointwise and AFσA\in\mathcal{F}_\sigma. Since {τt}{σt}\{\tau\le t\}\subseteq\{\sigma\le t\}, we get A{τt}=(A{σt}){τt}FtA\cap\{\tau\le t\}=\big(A\cap\{\sigma\le t\}\big)\cap\{\tau\le t\}\in\mathcal{F}_t, and AFTA\in\mathcal{F}_T; so AFτA\in\mathcal{F}_\tau. Splitting. Let s[0,T]s\in[0,T] and AFsA\in\mathcal{F}_s; put A=A{τ>s}A'=A\cap\{\tau>s\}, which lies in FsFT\mathcal{F}_s\subseteq\mathcal{F}_T by claim 1. Let t[0,T]t\in[0,T]. If tst\ge s then {min(s,τ)t}=Ω\{\min(s,\tau)\le t\}=\Omega and A{min(s,τ)t}=AFsFtA'\cap\{\min(s,\tau)\le t\}=A'\in\mathcal{F}_s\subseteq\mathcal{F}_t. If t<st<s then {min(s,τ)t}={τt}\{\min(s,\tau)\le t\}=\{\tau\le t\}, which is disjoint from {τ>s}\{\tau>s\}, so A{min(s,τ)t}=FtA'\cap\{\min(s,\tau)\le t\}=\emptyset\in\mathcal{F}_t. Hence AFmin(s,τ)A'\in\mathcal{F}_{\min(s,\tau)}.

Claim 3. DnD_n is a finite set containing 00 and TT, so τn(ω)\tau_n(\omega) is well defined, lies in DnD_n, and satisfies τn(ω)τ(ω)\tau_n(\omega)\ge\tau(\omega). Upper bound. Let d=max{dDn:dτ(ω)}d^-=\max\{d\in D_n:d\le\tau(\omega)\}, which exists since 0Dn0\in D_n. If d=τ(ω)d^-=\tau(\omega) then τn(ω)=τ(ω)\tau_n(\omega)=\tau(\omega). Otherwise d<τ(ω)Td^-<\tau(\omega)\le T, so d=kT2nd^-=kT2^{-n} with k<2nk<2^n and d+T2n=(k+1)T2nDnd^-+T2^{-n}=(k+1)T2^{-n}\in D_n; this point exceeds τ(ω)\tau(\omega) (otherwise it would be a grid point in (d,τ(ω)](d^-,\tau(\omega)], contradicting maximality of dd^-), hence τn(ω)d+T2nτ(ω)+T2n\tau_n(\omega)\le d^-+T2^{-n}\le\tau(\omega)+T2^{-n}. Monotonicity in nn. DnDn+1D_n\subseteq D_{n+1} because kT2n=2kT2(n+1)kT2^{-n}=2kT2^{-(n+1)}; the minimum over the larger set {dDn+1:dτ(ω)}\{d\in D_{n+1}:d\ge\tau(\omega)\} is at most that over {dDn:dτ(ω)}\{d\in D_n:d\ge\tau(\omega)\}, so τn+1τn\tau_{n+1}\le\tau_n. The two-sided bound ττnτ+T2n\tau\le\tau_n\le\tau+T2^{-n} and T2n0T2^{-n}\to0 give τn(ω)τ(ω)\tau_n(\omega)\to\tau(\omega) for every ω\omega. Level sets. τn(ω)=0\tau_n(\omega)=0 holds exactly when 0τ(ω)0\ge\tau(\omega), i.e. τ(ω)=0\tau(\omega)=0; for k1k\ge1, τn(ω)=kT2n\tau_n(\omega)=kT2^{-n} holds exactly when kT2nτ(ω)kT2^{-n}\ge\tau(\omega) and (k1)T2n<τ(ω)(k-1)T2^{-n}<\tau(\omega). Stopping time. Fix t[0,T]t\in[0,T] and let d(t)=max{dDn:dt}d^-(t)=\max\{d\in D_n:d\le t\}. Since τn\tau_n takes values in DnD_n, τn(ω)t\tau_n(\omega)\le t holds if and only if τn(ω)d(t)\tau_n(\omega)\le d^-(t); and this holds if and only if τ(ω)d(t)\tau(\omega)\le d^-(t) (if τ(ω)d(t)\tau(\omega)\le d^-(t) then d(t)d^-(t) is a grid point not below τ(ω)\tau(\omega), so τn(ω)d(t)\tau_n(\omega)\le d^-(t); conversely ττn\tau\le\tau_n). Thus {τnt}={τd(t)}Fd(t)Ft\{\tau_n\le t\}=\{\tau\le d^-(t)\}\in\mathcal{F}_{d^-(t)}\subseteq\mathcal{F}_t. The remaining assertions. FτFτn\mathcal{F}_\tau\subseteq\mathcal{F}_{\tau_n} follows from the monotonicity part of claim 2, as ττn\tau\le\tau_n. If στ\sigma\le\tau pointwise, then {dDn:dτ(ω)}{dDn:dσ(ω)}\{d\in D_n:d\ge\tau(\omega)\}\subseteq\{d\in D_n:d\ge\sigma(\omega)\}, so σn(ω)τn(ω)\sigma_n(\omega)\le\tau_n(\omega).

Claim 4(i). Fix t[0,T]t\in[0,T] and put ρ=min(t,τ)\rho=\min(t,\tau), a stopping time by claim 1 with values in [0,t][0,t]. ρ\rho is Ft\mathcal{F}_t-measurable: for real aa, {ρ>a}\{\rho>a\} equals \emptyset if ata\ge t, equals Ω\Omega if a<0a<0, and equals {τ>a}FaFt\{\tau>a\}\in\mathcal{F}_a\subseteq\mathcal{F}_t if 0a<t0\le a<t (claim 1); apply the criterion. Consider the map ϕ:Ω[0,t]×Ω\phi:\Omega\to[0,t]\times\Omega, ϕ(ω)=(ρ(ω),ω)\phi(\omega)=(\rho(\omega),\omega), and let C\mathcal{C} be the family of those sets EE in the product σ\sigma-algebra B[0,t]Ft\mathcal{B}_{[0,t]}\otimes\mathcal{F}_t (with B[0,t]\mathcal{B}_{[0,t]} as in the definition of progressive measurability) for which ϕ1(E)Ft\phi^{-1}(E)\in\mathcal{F}_t. Then C\mathcal{C} is a σ\sigma-algebra on [0,t]×Ω[0,t]\times\Omega: it contains [0,t]×Ω[0,t]\times\Omega because ϕ1([0,t]×Ω)=ΩFt\phi^{-1}([0,t]\times\Omega)=\Omega\in\mathcal{F}_t, and preimages commute with relative complements and countable unions. It contains every measurable rectangle B×AB\times A with BB[0,t]B\in\mathcal{B}_{[0,t]} and AFtA\in\mathcal{F}_t: indeed ϕ1(B×A)={ρB}A\phi^{-1}(B\times A)=\{\rho\in B\}\cap A, and {ρB}Ft\{\rho\in B\}\in\mathcal{F}_t, because for t>0t>0 one has B=S[0,t]B=S\cap[0,t] with SB(R)S\in\mathcal{B}(\mathbb{R}) and then {ρB}={ρS}\{\rho\in B\}=\{\rho\in S\} by ρ\rho taking values in [0,t][0,t], which lies in Ft\mathcal{F}_t by the Ft\mathcal{F}_t-measurability of ρ\rho; while for t=0t=0 the only members of B[0,0]\mathcal{B}_{[0,0]} are \emptyset and {0}\{0\}, with preimages \emptyset and Ω\Omega. Since the product σ\sigma-algebra is the σ\sigma-algebra generated by the measurable rectangles, minimality gives C=B[0,t]Ft\mathcal{C}=\mathcal{B}_{[0,t]}\otimes\mathcal{F}_t; that is, ϕ\phi is measurable with respect to Ft\mathcal{F}_t and the product σ\sigma-algebra. Let Ψt\Psi_t denote the restriction of (s,ω)Xs(ω)(s,\omega)\mapsto X_s(\omega) to [0,t]×Ω[0,t]\times\Omega, measurable with respect to B[0,t]Ft\mathcal{B}_{[0,t]}\otimes\mathcal{F}_t and B(R)\mathcal{B}(\mathbb{R}) by progressive measurability. Then Xtτ(ω)=Xρ(ω)(ω)=Ψt(ϕ(ω))X^\tau_t(\omega)=X_{\rho(\omega)}(\omega)=\Psi_t(\phi(\omega)), and for SB(R)S\in\mathcal{B}(\mathbb{R}), (Xtτ)1(S)=ϕ1(Ψt1(S))Ft(X^\tau_t)^{-1}(S)=\phi^{-1}\big(\Psi_t^{-1}(S)\big)\in\mathcal{F}_t. So XtτX^\tau_t is Ft\mathcal{F}_t-measurable, and XτX^\tau is adapted.

Claim 4(ii). Let aa be real and t[0,T]t\in[0,T]. On {τt}\{\tau\le t\} one has min(t,τ)=τ\min(t,\tau)=\tau, hence Xτ=XtτX_\tau=X^\tau_t there, and

{Xτ>a}{τt}={Xtτ>a}{τt}Ft\{X_\tau>a\}\cap\{\tau\le t\}=\{X^\tau_t>a\}\cap\{\tau\le t\}\in\mathcal{F}_t

by claim 4(i) and the stopping-time property. Taking t=Tt=T, where {τT}=Ω\{\tau\le T\}=\Omega, gives {Xτ>a}FT\{X_\tau>a\}\in\mathcal{F}_T. Hence {Xτ>a}Fτ\{X_\tau>a\}\in\mathcal{F}_\tau for every real aa, and the criterion, applied with the σ\sigma-algebra Fτ\mathcal{F}_\tau of claim 2, shows that XτX_\tau is Fτ\mathcal{F}_\tau-measurable, in particular FT\mathcal{F}_T-measurable.

Claim 4(iii). Fix ω\omega at which the path of XX is right-continuous. By claim 3, (τn(ω))n(\tau_n(\omega))_n is a sequence in [τ(ω),T][\tau(\omega),T] converging to τ(ω)\tau(\omega), so right-continuity at s=τ(ω)s=\tau(\omega) gives Xτn(ω)(ω)Xτ(ω)(ω)X_{\tau_n(\omega)}(\omega)\to X_{\tau(\omega)}(\omega), i.e. Xτn(ω)Xτ(ω)X_{\tau_n}(\omega)\to X_\tau(\omega). For the path of XτX^\tau, let t[0,T]t\in[0,T] and let (tj)(t_j) be a sequence in [t,T][t,T] converging to tt. If tτ(ω)t\ge\tau(\omega) then min(tj,τ(ω))=τ(ω)=min(t,τ(ω))\min(t_j,\tau(\omega))=\tau(\omega)=\min(t,\tau(\omega)) for all jj, and the sequence Xtjτ(ω)X^\tau_{t_j}(\omega) is constant equal to Xtτ(ω)X^\tau_t(\omega). If t<τ(ω)t<\tau(\omega), put sj=min(tj,τ(ω))s_j=\min(t_j,\tau(\omega)); then sj[t,T]s_j\in[t,T] and 0sjttjt0\le s_j-t\le t_j-t, so sjts_j\to t, and right-continuity of the path of XX at tt gives Xtjτ(ω)=Xsj(ω)Xt(ω)=Xtτ(ω)X^\tau_{t_j}(\omega)=X_{s_j}(\omega)\to X_t(\omega)=X^\tau_t(\omega). Thus the path of XτX^\tau at ω\omega is right-continuous. Finally, if XX is adapted with every path right-continuous, then XX is progressively measurable by claim 2 of the progressive measurability toolkit, so XτX^\tau is adapted by claim 4(i), every path of XτX^\tau is right-continuous by what was just shown, and XτX^\tau is progressively measurable by the same claim 2 of the toolkit.

Claim 5. Fix ωΩ\omega\in\Omega and write H=H(ω)H=H(\omega), Yt=Yt(ω)Y_t=Y_t(\omega). Continuity of the path at a point t[0,T]t\in[0,T] means, by the definition of continuity for the metric of the real line: for every ε>0\varepsilon>0 there is δ>0\delta>0 with YsYt<ε|Y_s-Y_t|<\varepsilon for all s[0,T]s\in[0,T] with st<δ|s-t|<\delta.

(a) The threshold is reached at τ\tau when HH\neq\emptyset. Suppose HH\neq\emptyset; HH is bounded below by 00, so τ(ω)=infH\tau(\omega)=\inf H exists by the approximation lemma for infima, and by its claim 4 there is, for each natural number mm, some smHs_m\in H with sm<τ(ω)+1/ms_m<\tau(\omega)+1/m; also smτ(ω)s_m\ge\tau(\omega) as τ(ω)\tau(\omega) is a lower bound of HH. Hence smτ(ω)s_m\to\tau(\omega), and by continuity of the path at τ(ω)\tau(\omega), YsmYτ(ω)Y_{s_m}\to Y_{\tau(\omega)}. Since YsmcY_{s_m}\ge c for all mm, we get Yτ(ω)cY_{\tau(\omega)}\ge c: otherwise, with ε=cYτ(ω)>0\varepsilon=c-Y_{\tau(\omega)}>0, all large mm would give Ysm<Yτ(ω)+ε=cY_{s_m}<Y_{\tau(\omega)}+\varepsilon=c. If τ(ω)<T\tau(\omega)<T then HH\neq\emptyset by the definition of τ\tau, so the conclusion holds in that case too.

(b) Below τ\tau the threshold is not reached. Let t<τ(ω)t<\tau(\omega). If H=H=\emptyset then Yt<cY_t<c trivially. If HH\neq\emptyset then τ(ω)\tau(\omega) is a lower bound of HH, so tHt\notin H, i.e. Yt<cY_t<c.

(c) τ\tau is a stopping time. For t=Tt=T, {τT}=ΩFT\{\tau\le T\}=\Omega\in\mathcal{F}_T. For t=0t=0: by (a) and the definition of τ\tau (note T>0T>0), τ(ω)=0\tau(\omega)=0 holds if and only if 0H(ω)0\in H(\omega), i.e. {τ0}={Y0c}=Ω{Y0<c}\{\tau\le0\}=\{Y_0\ge c\}=\Omega\setminus\{Y_0<c\}, which lies in F0\mathcal{F}_0 because Y0Y_0 is F0\mathcal{F}_0-measurable. Now fix t(0,T)t\in(0,T) and let EtE_t be the set of ω\omega for which there is s[0,t]s\in[0,t] with Ys(ω)cY_s(\omega)\ge c. Then {τt}=Et\{\tau\le t\}=E_t: if τ(ω)t<T\tau(\omega)\le t<T then H(ω)H(\omega)\neq\emptyset (for H(ω)=H(\omega)=\emptyset would give τ(ω)=T>t\tau(\omega)=T>t) and Yτ(ω)(ω)cY_{\tau(\omega)}(\omega)\ge c by (a), with τ(ω)[0,t]\tau(\omega)\in[0,t]; conversely, if s[0,t]s\in[0,t] and Ys(ω)cY_s(\omega)\ge c, then sH(ω)s\in H(\omega) and τ(ω)=infH(ω)st\tau(\omega)=\inf H(\omega)\le s\le t. We show

Et=jN mN k=0m{Ykt/m>c1j}.E_t=\bigcap_{j\in\mathbb{N}}\ \bigcup_{m\in\mathbb{N}}\ \bigcup_{k=0}^{m}\Big\{Y_{kt/m}>c-\tfrac1j\Big\}.

For \subseteq: let ωEt\omega\in E_t with Ys(ω)cY_s(\omega)\ge c, s[0,t]s\in[0,t], and let jNj\in\mathbb{N}. By continuity of the path at ss (with ε=1/j\varepsilon=1/j) there is δ>0\delta>0 with Yr(ω)Ys(ω)<1/j|Y_r(\omega)-Y_s(\omega)|<1/j whenever r[0,T]r\in[0,T] and rs<δ|r-s|<\delta. Choose mNm\in\mathbb{N} with t/m<δt/m<\delta (Archimedean property) and let kk be the largest integer with kt/mskt/m\le s; then 0km0\le k\le m (as 0st0\le s\le t) and 0skt/m<t/m<δ0\le s-kt/m<t/m<\delta, so Ykt/m(ω)>Ys(ω)1/jc1/jY_{kt/m}(\omega)>Y_s(\omega)-1/j\ge c-1/j. For \supseteq: let ω\omega belong to the right side. The path sYs(ω)s\mapsto Y_s(\omega) restricted to [0,t][0,t] is continuous on [0,t][0,t] (the ε\varepsilon--δ\delta condition at each point of [0,t][0,t], quantified over s[0,T]s\in[0,T], holds a fortiori when quantified over s[0,t]s\in[0,t]), so by the extreme value theorem it attains a maximum value at some s[0,t]s^*\in[0,t]. For every jj there is a grid point qj[0,t]q_j\in[0,t] with Yqj(ω)>c1/jY_{q_j}(\omega)>c-1/j, hence Ys(ω)Yqj(ω)>c1/jY_{s^*}(\omega)\ge Y_{q_j}(\omega)>c-1/j for every jj, and therefore Ys(ω)cY_{s^*}(\omega)\ge c (if Ys(ω)<cY_{s^*}(\omega)<c, the Archimedean property would give jj with 1/j<cYs(ω)1/j<c-Y_{s^*}(\omega), a contradiction); so ωEt\omega\in E_t. Finally, for each grid point q=kt/m[0,t]q=kt/m\in[0,t] the set {Yq>c1/j}\{Y_q>c-1/j\} lies in FqFt\mathcal{F}_q\subseteq\mathcal{F}_t, because YY is adapted; the displayed expression is a countable intersection of countable unions of finite unions of such sets, hence lies in Ft\mathcal{F}_t. Thus {τt}Ft\{\tau\le t\}\in\mathcal{F}_t for every t[0,T]t\in[0,T], and τ\tau is a stopping time. \blacksquare

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Comments

Loading…