Stopping Times on a Compact Time Interval: Elementary Operations, the Prior Sigma-Algebra, Dyadic Approximation, Sampling, and Hitting Times
lemmaProbabilitylem:stopping-time-toolkit-2026aLet be the real numbers, let be a probability space, let be real, and let be a filtration on with time index restricted to . Stopping times are those of , the -algebra of events prior to a stopping time is denoted , and for a family of real-valued functions on the sampled function and stopped family are as defined there. A family is adapted when is an -measurable random variable for every , progressive measurability is with respect to , a path of is a map on at a fixed , and a path is right-continuous in the sense of the progressive measurability toolkit: for every and every sequence in converging to , the sequence converges to . Throughout, a real-valued function on a subinterval of the real numbers is called continuous on when it is continuous relative to , both and the codomain carrying the metric of the real line. For a natural number let
be the -th dyadic grid of . For a function and write for , and similarly for , , , .
1. (Elementary stopping times.) Every constant function with is a stopping time. If and are stopping times, then so are the pointwise minimum and the pointwise maximum . If is a stopping time, then for every the four sets , , , belong to , and , regarded as a real-valued function on , is measurable with respect to and the Borel -algebra of the real line.
2. (The prior -algebra.) Let and be stopping times. Then is a -algebra on contained in ; the function is measurable with respect to and the Borel -algebra; if is the constant then ; if for every , then ; and for every and every ,
where denotes the stopping time .
3. (Dyadic approximation from above.) Let be a stopping time and, for each natural number , define
the least grid point of not below (which exists since ). Then is a stopping time with values in ; for every and ,
so that converges to for every ; and, for , ; ; and if is a stopping time with pointwise, then pointwise, where is defined from in the same way.
4. (Sampling a progressively measurable process.) Let be progressively measurable and let be a stopping time.
(i) For every the function is -measurable; thus the stopped family is adapted.
(ii) The sampled function is measurable with respect to and the Borel -algebra; in particular it is an -measurable random variable.
(iii) Let be a point at which the path of is right-continuous, and let be as in claim 3. Then the sequence converges to , and the path of at is right-continuous. Consequently, if is adapted and every path of is right-continuous, then is adapted with every path right-continuous, hence progressively measurable.
5. (Hitting times of continuous adapted processes.) Let be adapted with every path continuous on , and let be a real number. For let and define
the infimum in the first case being the greatest lower bound, which exists by the existence theorem for infima since there is nonempty and bounded below by . Then is a stopping time; for every and every with ; and whenever , in particular for every with .
Loading…
Prerequisites
No prerequisites tracked.
Dependents
No dependents yet.
Dependent proofs
No dependent proofs yet.
No relations recorded yet.