The strong Markov property for arbitrary stopping times (Davis §25.5) #
SHSLib/Foundations/DavisCh2.lean proves the strong Markov property for
stopping times with countably many values
(Davis.pdp_strong_markov_of_countable_range). This file removes the
countability restriction by the classical dyadic discretisation
τₙ := (⌊τ·2ⁿ⌋ + 1)/2ⁿ ↓ τ, τ < τₙ ≤ τ + 2⁻ⁿ,
each τₙ being a stopping time with countably many values, and then passing
to the limit using right continuity of the paths and continuity of f and of
Pₛf.
The file contains three groups of results.
- Dyadic upper approximation (
dyadicUpperand its basic properties,isStoppingTime_dyadicUpper): reusable discretisation machinery forℝ≥0-indexed stopping times. - Measurability at a stopping time
(
measurable_apply_stoppingTime_of_countable_range,measurable_apply_stoppingTime_of_progMeasurable,isStoppingTime_add_const): the two ways of obtainingℱ_τ-measurability ofω ↦ h (τ ω) ω. - The general strong Markov property
(
pdp_strong_markov_of_rightContinuous).
References #
- [Dav93], §25.5
The n-th dyadic upper approximation of t : ℝ≥0:
dyadicUpper n t = (⌊t·2ⁿ⌋ + 1)/2ⁿ, the smallest dyadic rational of level n
that is strictly larger than t.
Instances For
The dyadic upper approximation is strictly larger than the point it approximates.
The dyadic upper approximation overshoots by at most 2⁻ⁿ.
Comparison of dyadicUpper n t with an arbitrary threshold u.
dyadicUpper n takes values in the countable set of level-n dyadic
rationals.
dyadicUpper n t → t as n → ∞.
dyadicUpper n t → t from the right: the approximations converge to t
inside Set.Ioi t.
The dyadic upper approximation of a stopping time is a stopping time.
Shifting an ℝ≥0-valued stopping time by a constant gives a stopping
time.
If τ is a stopping time with countably many values and h u is
ℱ u-measurable for every u, then ω ↦ h (τ ω) ω is ℱ_τ-measurable.
For a progressively measurable process, the value at a stopping time is
ℱ_τ-measurable.
Countable-valued time change. If r takes countably many values and
Y v is measurable for each of them, then (a, b) ↦ Y (r a) b is measurable
for the product σ-algebra.
A right-continuous adapted process is progressively measurable.
The dyadic right-endpoint approximations Xⁿ(t, ω) = X(min (dyadicUpper n t) i, ω)
are measurable on Set.Iic i × Ω (they take countably many time values, all
≤ i) and converge pointwise to X(t, ω) by right continuity of the paths.
Mathlib provides the analogous statement for continuous processes
(StronglyAdapted.progMeasurable_of_continuous); this is the càdlàg version,
which is the one needed for PDPs.
(25.5) Strong Markov property, general stopping times.
If X is right-continuous, progressively measurable and satisfies the simple
Markov property IsPDPMarkovProcess for the PDP semigroup, then for every
stopping time τ and every bounded continuous f whose semigroup image
Pₛ f is continuous,
𝔼[f(X_{τ+s}) | ℱ_τ] = (Pₛ f)(X_τ) almost surely.
This removes the countable-range restriction in
pdp_strong_markov_of_countable_range by dyadic discretisation of τ.
(25.5) Strong Markov property from adaptedness and right continuity.
Same as pdp_strong_markov_of_rightContinuous, with progressive measurability
replaced by the more primitive hypothesis that X is adapted (it is then
progressively measurable by progMeasurable_of_rightContinuous).
(25.5) Strong Markov property for a Feller PDP.
For a standard PDP satisfying the §27 regularity conditions (bounded continuous
jump rate, continuous flow, Q preserving continuity), the continuity and
boundedness of Pₛ f are automatic — they are the Feller property
(pdp_feller_property) and pdpSemigroup_abs_le. So the strong Markov
property holds for every stopping time and every bounded continuous f.
Countable-range strong Markov property, with the technical hypotheses
discharged. A restatement of pdp_strong_markov_of_countable_range in which
the ℱ_τ-measurability and integrability of (Pₛ f)(X_τ) are derived from
adaptedness of X and boundedness of f (via
measurable_apply_stoppingTime_of_countable_range) instead of assumed.
Expectation form of the strong Markov property. Taking expectations in
pdp_strong_markov_of_rightContinuous gives
𝔼[f(X_{τ+s})] = 𝔼[(Pₛ f)(X_τ)].
A worked instance: the jump-free (deterministic) PDP #
All the hypotheses of the general strong Markov theorem are simultaneously
satisfiable: for a PDP with vanishing jump rate the semigroup is composition
with the flow, the flow process is a PDP-Markov process, and the strong Markov
property at an arbitrary stopping time is the flow (semigroup) identity
φ(τ + s, z) = φ(s, φ(τ, z)).
With no jumps the survivor function is identically 1.
The semigroup of a jump-free PDP is composition with the flow:
Pₜ f (x) = f(φ(t, x)).
The flow process of a jump-free PDP is a PDP-Markov process.
Its increments are deterministic, so the conditional expectation is just the
ℱ t-measurable value f(φ(s, φ(t, Z))), which is exactly (Pₛ f)(Xₜ).
Strong Markov property of the deterministic flow process at an arbitrary
stopping time. A concrete, hypothesis-free-in-spirit instance of
pdp_strong_markov_of_rightContinuous_adapted: it shows that the hypotheses of
the general theorem are simultaneously satisfiable.
Every measurable ℝ≥0-valued time is a stopping time for the constant
filtration.
A concrete jump-free PDP on ℝ: the uniform translation flow
φ(t, x) = x + t, zero jump rate and (never used) unit-shift jump kernel.
Equations
- One or more equations did not get rendered due to their size.
Instances For
A fully concrete instance of the general strong Markov property.
For the translation flow x ↦ x + t on ℝ, an arbitrary random initial state
Z, the constant filtration and an arbitrary measurable random time τ,
𝔼[f(Z + τ + s) | ℱ_τ] = f((Z + τ) + s) almost surely. This certifies that the
hypotheses of pdp_strong_markov_of_rightContinuous_adapted are simultaneously
satisfiable.