Let R be the real numbers, let (Ω,F,P) be a probability space, let T>0 be real, and let (Ft)t∈[0,T] be a filtration on (Ω,F,P) with time index restricted to [0,T]. Stopping times are those of (Ft)t∈[0,T], the σ-algebra of events prior to a stopping time τ is denoted Fτ, and for a family X=(Xt)t∈[0,T] of real-valued functions on Ω the sampled function Xτ and stopped family Xτ are as defined there. A family X is adapted when Xt is an Ft-measurable random variable for every t∈[0,T], progressive measurability is with respect to (Ft)t∈[0,T], a path of X is a map s↦Xs(ω) on [0,T] at a fixed ω, and a path is right-continuous in the sense of the progressive measurability toolkit: for every s∈[0,T] and every sequence (sj)j∈N in [s,T] converging to s, the sequence (Xsj(ω))j∈N converges to Xs(ω). Throughout, a real-valued function on a subinterval I of the real numbers R is called continuous on I when it is continuous relative to I, both I and the codomain R carrying the metric of the real line. For a natural number n let
Dn={kT2−n: k∈{0,1,…,2n}}
be the n-th dyadic grid of [0,T]. For a function τ:Ω→[0,T] and t∈[0,T] write {τ≤t} for {ω∈Ω:τ(ω)≤t}, and similarly for <, =, ≥, >.
1. (Elementary stopping times.) Every constant function ω↦c with c∈[0,T] is a stopping time. If σ and τ are stopping times, then so are the pointwise minimum min(σ,τ) and the pointwise maximum max(σ,τ). If τ is a stopping time, then for every t∈[0,T] the four sets {τ<t}, {τ=t}, {τ≥t}, {τ>t} belong to Ft, and τ, regarded as a real-valued function on Ω, is measurable with respect to FT and the Borel σ-algebra of the real line.
2. (The prior σ-algebra.) Let σ and τ be stopping times. Then Fτ is a σ-algebra on Ω contained in FT; the function τ is measurable with respect to Fτ and the Borel σ-algebra; if τ is the constant c∈[0,T] then Fτ=Fc; if σ(ω)≤τ(ω) for every ω∈Ω, then Fσ⊆Fτ; and for every s∈[0,T] and every A∈Fs,
A∩{τ>s}∈Fmin(s,τ),
where min(s,τ) denotes the stopping time ω↦min(s,τ(ω)).
3. (Dyadic approximation from above.) Let τ be a stopping time and, for each natural number n, define
τn(ω)=min{d∈Dn: d≥τ(ω)}(ω∈Ω),
the least grid point of Dn not below τ(ω) (which exists since T∈Dn). Then τn is a stopping time with values in Dn; for every ω and n,
τ(ω)≤τn+1(ω)≤τn(ω)≤τ(ω)+T2−n,
so that (τn(ω))n∈N converges to τ(ω) for every ω∈Ω; {τn=0}={τ=0} and, for k∈{1,…,2n}, {τn=kT2−n}={(k−1)T2−n<τ≤kT2−n}; Fτ⊆Fτn; and if σ is a stopping time with σ≤τ pointwise, then σn≤τn pointwise, where σn is defined from σ in the same way.
4. (Sampling a progressively measurable process.) Let X=(Xt)t∈[0,T] be progressively measurable and let τ be a stopping time.
(i) For every t∈[0,T] the function Xtτ=Xmin(t,τ) is Ft-measurable; thus the stopped family Xτ is adapted.
(ii) The sampled function Xτ is measurable with respect to Fτ and the Borel σ-algebra; in particular it is an FT-measurable random variable.
(iii) Let ω∈Ω be a point at which the path of X is right-continuous, and let τn be as in claim 3. Then the sequence (Xτn(ω))n∈N converges to Xτ(ω), and the path of Xτ at ω is right-continuous. Consequently, if X is adapted and every path of X is right-continuous, then Xτ is adapted with every path right-continuous, hence progressively measurable.
5. (Hitting times of continuous adapted processes.) Let Y=(Yt)t∈[0,T] be adapted with every path continuous on [0,T], and let c be a real number. For ω∈Ω let H(ω)={t∈[0,T]:Yt(ω)≥c} and define
τ(ω)={infH(ω)Tif H(ω)=∅,if H(ω)=∅,
the infimum in the first case being the greatest lower bound, which exists by the existence theorem for infima since there H(ω) is nonempty and bounded below by 0. Then τ is a stopping time; Yt(ω)<c for every ω and every t∈[0,T] with t<τ(ω); and Yτ(ω)(ω)≥c whenever H(ω)=∅, in particular for every ω with τ(ω)<T.