Almost-Sure Equality of a Continuous Modification
ProvedLevyStochCalc.Brownian.Continuity.kolmogorov_modification_ae_eq_readableThis is the fixed-time modification-identification lemma. Let be a probability measure on , let satisfy IsKolmogorovProcess X P p q M, and let . Assume that is continuous for -almost every , and that for every dyadic rational , almost surely. Then for every ,
The conclusion is pointwise in the time parameter; it is not a single exceptional null set uniform over all .
Original Lean declaration header
Within namespace LevyStochCalc.Brownian.Continuity. Shown in its original module context. Proof omitted.
lemma kolmogorov_modification_ae_eq
(P : Measure Ω) [IsProbabilityMeasure P]
(X : ℝ → Ω → ℝ) {p q : ℝ} {M : ℝ≥0}
(hX : ProbabilityTheory.IsKolmogorovProcess X P p q M)
(Y : ℝ → Ω → ℝ)
(h_continuous : ∀ᵐ ω ∂P, Continuous (fun t => Y t ω))
(h_dyadic_eq : ∀ s ∈ dyadicRationals, ∀ᵐ ω ∂P, Y s ω = X s ω) :
∀ t : ℝ, ∀ᵐ ω ∂P, Y t ω = X t ω
Module navigation
Module: LevyStochCalc/Brownian/ContinuityKolmogorovBounds.
Definition modules: LevyStochCalc/Brownian/ContinuityDyadicChaining.
Supporting theorems: dense_dyadicRationals, kolmogorov_markov_bound.
Previous: kc_ae_nbhd_holder.
Source excerpt, lines 419–426 · Frozen source 408915f.
import Definitions.Def_KLSModular_LevyStochCalc_Brownian_ContinuityKolmogorovBounds
/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/
-- Vendored from https://github.com/cgarryZA/LevyStochCalc at commit 984dbf0b790031eac05d56fe5a84b65e15e1e932 (upstream path LevyStochCalc/Brownian/ContinuityKolmogorovBounds.lean; Apache-2.0; provenance in formalization/vendor/vendor-lock.json of the KLS repository)
open MeasureTheory ProbabilityTheory
open scoped NNReal ENNReal Topology
universe u
variable {Ω : Type u} [MeasurableSpace Ω]
lemma LevyStochCalc.Brownian.Continuity.kolmogorov_modification_ae_eq_readable
(P : Measure Ω) [IsProbabilityMeasure P]
(X : ℝ → Ω → ℝ) {p q : ℝ} {M : ℝ≥0}
(hX : ProbabilityTheory.IsKolmogorovProcess X P p q M)
(Y : ℝ → Ω → ℝ)
(h_continuous : ∀ᵐ ω ∂P, Continuous (fun t => Y t ω))
(h_dyadic_eq : ∀ s ∈ dyadicRationals, ∀ᵐ ω ∂P, Y s ω = X s ω) :
∀ t : ℝ, ∀ᵐ ω ∂P, Y t ω = X t ω := by sorry