Throughout, for a σ-algebra G on Ω, a real-valued function f on Ω is called G-measurable when it is measurable with respect to G and the Borel σ-algebra B(R); by claim 3 of the Borel generator lemma this holds if and only if {f>a}∈G for every real a (the criterion). All set operations used are finite or countable, so they stay inside the σ-algebras involved (σ-algebra axioms).
Claim 1. For the constant c∈[0,T] and t∈[0,T], {c≤t} is Ω if c≤t and ∅ otherwise, both in Ft. For stopping times σ,τ: {min(σ,τ)≤t}={σ≤t}∪{τ≤t} and {max(σ,τ)≤t}={σ≤t}∩{τ≤t}, both in Ft. Let τ be a stopping time and t∈[0,T]. If t=0 then {τ<0}=∅. If t>0, then
{τ<t}=m∈N, t−1/m≥0⋃{τ≤t−1/m}:
the inclusion ⊇ is clear, and if τ(ω)<t there is, by the Archimedean property, a natural number m with 1/m≤t−τ(ω), so t−1/m≥τ(ω)≥0 and ω lies in the m-th set. Each {τ≤t−1/m} lies in Ft−1/m⊆Ft (the filtration being nondecreasing), so {τ<t}∈Ft as a countable union. Then {τ=t}={τ≤t}∖{τ<t}, {τ≥t}=Ω∖{τ<t} and {τ>t}=Ω∖{τ≤t} lie in Ft. Finally, for real a: {τ>a}=Ω if a<0; {τ>a}=∅ if a≥T; and {τ>a}=Ω∖{τ≤a} with {τ≤a}∈Fa⊆FT if 0≤a<T. By the criterion, τ is FT-measurable.
Claim 2. Fτ is a σ-algebra contained in FT. Containment holds by definition. Ω∈Fτ since Ω∩{τ≤t}={τ≤t}∈Ft. If A∈Fτ then Ω∖A∈FT and (Ω∖A)∩{τ≤t}={τ≤t}∖(A∩{τ≤t})∈Ft. If A1,A2,⋯∈Fτ then ⋃jAj∈FT and (⋃jAj)∩{τ≤t}=⋃j(Aj∩{τ≤t})∈Ft. Measurability of τ. For real a, {τ>a}∈FT by claim 1, and for t∈[0,T]: {τ>a}∩{τ≤t} equals {τ≤t} if a<0, equals ∅ if a≥t, and equals {τ≤t}∖{τ≤a} with {τ≤a}∈Fa⊆Ft if 0≤a<t; in every case it lies in Ft. Hence {τ>a}∈Fτ and the criterion applies. Constants. Let τ≡c. If A∈Fτ then A=A∩{τ≤c}∈Fc. Conversely if A∈Fc then A∈FT, and A∩{τ≤t} equals A∈Fc⊆Ft when t≥c and ∅ otherwise. Monotonicity. Let σ≤τ pointwise and A∈Fσ. Since {τ≤t}⊆{σ≤t}, we get A∩{τ≤t}=(A∩{σ≤t})∩{τ≤t}∈Ft, and A∈FT; so A∈Fτ. Splitting. Let s∈[0,T] and A∈Fs; put A′=A∩{τ>s}, which lies in Fs⊆FT by claim 1. Let t∈[0,T]. If t≥s then {min(s,τ)≤t}=Ω and A′∩{min(s,τ)≤t}=A′∈Fs⊆Ft. If t<s then {min(s,τ)≤t}={τ≤t}, which is disjoint from {τ>s}, so A′∩{min(s,τ)≤t}=∅∈Ft. Hence A′∈Fmin(s,τ).
Claim 3. Dn is a finite set containing 0 and T, so τn(ω) is well defined, lies in Dn, and satisfies τn(ω)≥τ(ω). Upper bound. Let d−=max{d∈Dn:d≤τ(ω)}, which exists since 0∈Dn. If d−=τ(ω) then τn(ω)=τ(ω). Otherwise d−<τ(ω)≤T, so d−=kT2−n with k<2n and d−+T2−n=(k+1)T2−n∈Dn; this point exceeds τ(ω) (otherwise it would be a grid point in (d−,τ(ω)], contradicting maximality of d−), hence τn(ω)≤d−+T2−n≤τ(ω)+T2−n. Monotonicity in n. Dn⊆Dn+1 because kT2−n=2kT2−(n+1); the minimum over the larger set {d∈Dn+1:d≥τ(ω)} is at most that over {d∈Dn:d≥τ(ω)}, so τn+1≤τn. The two-sided bound τ≤τn≤τ+T2−n and T2−n→0 give τn(ω)→τ(ω) for every ω. Level sets. τn(ω)=0 holds exactly when 0≥τ(ω), i.e. τ(ω)=0; for k≥1, τn(ω)=kT2−n holds exactly when kT2−n≥τ(ω) and (k−1)T2−n<τ(ω). Stopping time. Fix t∈[0,T] and let d−(t)=max{d∈Dn:d≤t}. Since τn takes values in Dn, τn(ω)≤t holds if and only if τn(ω)≤d−(t); and this holds if and only if τ(ω)≤d−(t) (if τ(ω)≤d−(t) then d−(t) is a grid point not below τ(ω), so τn(ω)≤d−(t); conversely τ≤τn). Thus {τn≤t}={τ≤d−(t)}∈Fd−(t)⊆Ft. The remaining assertions. Fτ⊆Fτn follows from the monotonicity part of claim 2, as τ≤τn. If σ≤τ pointwise, then {d∈Dn:d≥τ(ω)}⊆{d∈Dn:d≥σ(ω)}, so σn(ω)≤τn(ω).
Claim 4(i). Fix t∈[0,T] and put ρ=min(t,τ), a stopping time by claim 1 with values in [0,t]. ρ is Ft-measurable: for real a, {ρ>a} equals ∅ if a≥t, equals Ω if a<0, and equals {τ>a}∈Fa⊆Ft if 0≤a<t (claim 1); apply the criterion. Consider the map ϕ:Ω→[0,t]×Ω, ϕ(ω)=(ρ(ω),ω), and let C be the family of those sets E in the product σ-algebra B[0,t]⊗Ft (with B[0,t] as in the definition of progressive measurability) for which ϕ−1(E)∈Ft. Then C is a σ-algebra on [0,t]×Ω: it contains [0,t]×Ω because ϕ−1([0,t]×Ω)=Ω∈Ft, and preimages commute with relative complements and countable unions. It contains every measurable rectangle B×A with B∈B[0,t] and A∈Ft: indeed ϕ−1(B×A)={ρ∈B}∩A, and {ρ∈B}∈Ft, because for t>0 one has B=S∩[0,t] with S∈B(R) and then {ρ∈B}={ρ∈S} by ρ taking values in [0,t], which lies in Ft by the Ft-measurability of ρ; while for t=0 the only members of B[0,0] are ∅ and {0}, with preimages ∅ and Ω. Since the product σ-algebra is the σ-algebra generated by the measurable rectangles, minimality gives C=B[0,t]⊗Ft; that is, ϕ is measurable with respect to Ft and the product σ-algebra. Let Ψt denote the restriction of (s,ω)↦Xs(ω) to [0,t]×Ω, measurable with respect to B[0,t]⊗Ft and B(R) by progressive measurability. Then Xtτ(ω)=Xρ(ω)(ω)=Ψt(ϕ(ω)), and for S∈B(R), (Xtτ)−1(S)=ϕ−1(Ψt−1(S))∈Ft. So Xtτ is Ft-measurable, and Xτ is adapted.
Claim 4(ii). Let a be real and t∈[0,T]. On {τ≤t} one has min(t,τ)=τ, hence Xτ=Xtτ there, and
{Xτ>a}∩{τ≤t}={Xtτ>a}∩{τ≤t}∈Ft
by claim 4(i) and the stopping-time property. Taking t=T, where {τ≤T}=Ω, gives {Xτ>a}∈FT. Hence {Xτ>a}∈Fτ for every real a, and the criterion, applied with the σ-algebra Fτ of claim 2, shows that Xτ is Fτ-measurable, in particular FT-measurable.
Claim 4(iii). Fix ω at which the path of X is right-continuous. By claim 3, (τn(ω))n is a sequence in [τ(ω),T] converging to τ(ω), so right-continuity at s=τ(ω) gives Xτn(ω)(ω)→Xτ(ω)(ω), i.e. Xτn(ω)→Xτ(ω). For the path of Xτ, let t∈[0,T] and let (tj) be a sequence in [t,T] converging to t. If t≥τ(ω) then min(tj,τ(ω))=τ(ω)=min(t,τ(ω)) for all j, and the sequence Xtjτ(ω) is constant equal to Xtτ(ω). If t<τ(ω), put sj=min(tj,τ(ω)); then sj∈[t,T] and 0≤sj−t≤tj−t, so sj→t, and right-continuity of the path of X at t gives Xtjτ(ω)=Xsj(ω)→Xt(ω)=Xtτ(ω). Thus the path of Xτ at ω is right-continuous. Finally, if X is adapted with every path right-continuous, then X is progressively measurable by claim 2 of the progressive measurability toolkit, so Xτ is adapted by claim 4(i), every path of Xτ is right-continuous by what was just shown, and Xτ is progressively measurable by the same claim 2 of the toolkit.
Claim 5. Fix ω∈Ω and write H=H(ω), Yt=Yt(ω). Continuity of the path at a point t∈[0,T] means, by the definition of continuity for the metric of the real line: for every ε>0 there is δ>0 with ∣Ys−Yt∣<ε for all s∈[0,T] with ∣s−t∣<δ.
(a) The threshold is reached at τ when H=∅. Suppose H=∅; H is bounded below by 0, so τ(ω)=infH exists by the approximation lemma for infima, and by its claim 4 there is, for each natural number m, some sm∈H with sm<τ(ω)+1/m; also sm≥τ(ω) as τ(ω) is a lower bound of H. Hence sm→τ(ω), and by continuity of the path at τ(ω), Ysm→Yτ(ω). Since Ysm≥c for all m, we get Yτ(ω)≥c: otherwise, with ε=c−Yτ(ω)>0, all large m would give Ysm<Yτ(ω)+ε=c. If τ(ω)<T then H=∅ by the definition of τ, so the conclusion holds in that case too.
(b) Below τ the threshold is not reached. Let t<τ(ω). If H=∅ then Yt<c trivially. If H=∅ then τ(ω) is a lower bound of H, so t∈/H, i.e. Yt<c.
(c) τ is a stopping time. For t=T, {τ≤T}=Ω∈FT. For t=0: by (a) and the definition of τ (note T>0), τ(ω)=0 holds if and only if 0∈H(ω), i.e. {τ≤0}={Y0≥c}=Ω∖{Y0<c}, which lies in F0 because Y0 is F0-measurable. Now fix t∈(0,T) and let Et be the set of ω for which there is s∈[0,t] with Ys(ω)≥c. Then {τ≤t}=Et: if τ(ω)≤t<T then H(ω)=∅ (for H(ω)=∅ would give τ(ω)=T>t) and Yτ(ω)(ω)≥c by (a), with τ(ω)∈[0,t]; conversely, if s∈[0,t] and Ys(ω)≥c, then s∈H(ω) and τ(ω)=infH(ω)≤s≤t. We show
Et=j∈N⋂ m∈N⋃ k=0⋃m{Ykt/m>c−j1}.
For ⊆: let ω∈Et with Ys(ω)≥c, s∈[0,t], and let j∈N. By continuity of the path at s (with ε=1/j) there is δ>0 with ∣Yr(ω)−Ys(ω)∣<1/j whenever r∈[0,T] and ∣r−s∣<δ. Choose m∈N with t/m<δ (Archimedean property) and let k be the largest integer with kt/m≤s; then 0≤k≤m (as 0≤s≤t) and 0≤s−kt/m<t/m<δ, so Ykt/m(ω)>Ys(ω)−1/j≥c−1/j. For ⊇: let ω belong to the right side. The path s↦Ys(ω) restricted to [0,t] is continuous on [0,t] (the ε--δ condition at each point of [0,t], quantified over s∈[0,T], holds a fortiori when quantified over s∈[0,t]), so by the extreme value theorem it attains a maximum value at some s∗∈[0,t]. For every j there is a grid point qj∈[0,t] with Yqj(ω)>c−1/j, hence Ys∗(ω)≥Yqj(ω)>c−1/j for every j, and therefore Ys∗(ω)≥c (if Ys∗(ω)<c, the Archimedean property would give j with 1/j<c−Ys∗(ω), a contradiction); so ω∈Et. Finally, for each grid point q=kt/m∈[0,t] the set {Yq>c−1/j} lies in Fq⊆Ft, because Y is adapted; the displayed expression is a countable intersection of countable unions of finite unions of such sets, hence lies in Ft. Thus {τ≤t}∈Ft for every t∈[0,T], and τ is a stopping time. ■