Kolmogorov–Chentsov theorem: a process on with , , has a locally Hölder modification
OpenKolmogorovChentsov.exists_modification_holderOnWith_IccKolmogorov–Chentsov continuity theorem. Let be a probability space, let be a complete metric space, and let be a stochastic process indexed by with values in . Suppose there are constants , and such that
Then has a modification , that is almost surely for every , with the following property. For every , every and every exponent with , the path is -Hölder on : there is a finite constant with
In particular every path of is continuous.
The theorem is the standard way to pass from finite-dimensional distributions to a process with continuous paths, and it needs only a moment bound on pairs of values. For Brownian motion, for every . Taking and gives a modification whose paths are Hölder of every order , hence of every order .
Formalization Note The hypothesis is Mathlib's ProbabilityTheory.IsKolmogorovProcess X P p q M for a process X : ℝ≥0 → Ω → E. It packages three things: the moment bound, written as a lower Lebesgue integral of extended distances ∫⁻ ω, edist (X s ω) (X t ω) ^ p ∂P ≤ M * edist s t ^ q; the positivity of and ; and the Borel measurability of each pair in . That measurability is what makes a random variable when is not separable. The separate hypothesis 1 < q is the condition . The time set is ℝ≥0 with its usual distance, and is Set.Icc 0 T taken in ℝ≥0. The Hölder exponent is a non-negative real (ℝ≥0), coerced to ℝ for the comparison with . HolderOnWith C γ f s means edist (f x) (f y) ≤ C * edist x y ^ (γ : ℝ) for all x y ∈ s. "Modification" means exactly ∀ t, Y t =ᵐ[P] X t; no further measurability of is asserted. The Hölder bounds are asserted for every , not just almost every . The two forms are equivalent, since a modification can be redefined to be constant on a measurable null set.
import Mathlib open MeasureTheory ProbabilityTheory open scoped NNReal ENNReal
theorem KolmogorovChentsov.exists_modification_holderOnWith_Icc
{Ω E : Type*} {mΩ : MeasurableSpace Ω} {P : Measure Ω} [IsProbabilityMeasure P]
[MetricSpace E] [CompleteSpace E]
{X : ℝ≥0 → Ω → E} {p q : ℝ} {M : ℝ≥0}
(hX : IsKolmogorovProcess X P p q M) (hq : 1 < q) :
∃ Y : ℝ≥0 → Ω → E, (∀ t, Y t =ᵐ[P] X t) ∧
∀ ω, ∀ T : ℝ≥0, 0 < T → ∀ γ : ℝ≥0, 0 < γ → (γ : ℝ) < (q - 1) / p →
∃ C : ℝ≥0, HolderOnWith C γ (fun t ↦ Y t ω) (Set.Icc 0 T) := by sorry