brownian continuous modification kol aux
ProvedLevyStochCalc.Brownian.Continuity.brownian_continuous_modification_kol_auxcontext-reviewlevystochcalcsource-import
The source theorem LevyStochCalc.Brownian.Continuity.brownian_continuous_modification_kol_aux is extracted from LevyStochCalc.Brownian.Continuity. The original Lean proposition is retained verbatim, and its proof is tracked separately for remote certification.
Preamble
import Definitions.Def_LevyStochCalc_Brownian_Continuity_F001
/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/
/-!
# Kolmogorov-Chentsov continuous modification
Mathlib has only `IsKolmogorovProcess` (the *condition*); the modification
result is missing. We port the classical proof (Karatzas-Shreve §2.2 Thm 2.8 /
Le Gall 2016 Thm 2.9):
*If `(X_t)_{t ≥ 0}` satisfies `𝔼[ |X_t − X_s|^p ] ≤ M · |t − s|^q` for some
`p, q > 0` with `q > 1` and constant `M`, then there exists a modification
`X̃` with continuous paths.*
The sub-lemmas of the proof live in two imported modules of the same namespace:
`LevyStochCalc.Brownian.ContinuityDyadicChaining` (Hölder extension from a dense
set, the dyadic rationals, dyadic truncation and the deterministic chaining
bound) and `LevyStochCalc.Brownian.ContinuityKolmogorovBounds` (the Markov tail
bound, the per-level Borel-Cantelli estimates, almost-sure local Hölder
regularity and the modification identity). This module assembles them into
`kolmogorovChentsov_modification` and applies it to Brownian motion, whose
fourth increment moment is computed here from the Gaussian moment generating
function.
-/
open MeasureTheory ProbabilityTheory
open scoped NNReal ENNReal Topology
namespace LevyStochCalc.Brownian.Continuity
universe u
variable {Ω : Type u} [MeasurableSpace Ω]
Formal statement
theorem _root_.LevyStochCalc.Brownian.Continuity.brownian_continuous_modification_kol_aux
{P : Measure Ω} [IsProbabilityMeasure P]
(X : ℝ → Ω → ℝ)
(h_meas : ∀ s : ℝ, Measurable (X s))
(h_increment : ∀ {s t : ℝ} (hst : s < t),
P.map (fun ω => X t ω - X s ω)
= ProbabilityTheory.gaussianReal 0 ⟨t - s, by linarith⟩)
{s t : ℝ} (hst : s < t) :
∫⁻ ω, edist (X s ω) (X t ω) ^ 4 ∂P ≤ 3 * edist s t ^ 2 := by sorry
Source