Almost-Sure Local Hölder Bounds on Unit Intervals
ProvedLevyStochCalc.Brownian.Continuity.kc_ae_interval_holder_readableThis is the almost-sure intervalwise Hölder estimate for a Kolmogorov process. Under the probability-space, process, and IsKolmogorovProcess assumptions above, let satisfy . Then for -almost every , every integer admits and such that for dyadic rationals with ,
The constants may depend on the path and on the interval index .
Original Lean declaration header
Within namespace LevyStochCalc.Brownian.Continuity. Shown in its original module context. Proof omitted.
lemma kc_ae_interval_holder
(P : Measure Ω) [IsProbabilityMeasure P]
(X : ℝ → Ω → ℝ) {p q : ℝ} {M : ℝ≥0}
(hX : ProbabilityTheory.IsKolmogorovProcess X P p q M)
{α : ℝ} (hα0 : 0 < α) (hαpq : α * p < q - 1) :
∀ᵐ ω ∂P, ∀ j : ℤ, ∃ (K : ℝ) (N : ℕ), 0 ≤ K ∧
∀ s ∈ dyadicRationals, ∀ t ∈ dyadicRationals,
(j : ℝ) ≤ s → s ≤ (j : ℝ) + 1 → (j : ℝ) ≤ t → t ≤ (j : ℝ) + 1 →
|s - t| ≤ (1 / 2 : ℝ) ^ N → |X s ω - X t ω| ≤ K * |s - t| ^ α
Module navigation
Module: LevyStochCalc/Brownian/ContinuityKolmogorovBounds.
Definition modules: LevyStochCalc/Brownian/ContinuityDyadicChaining.
Supporting theorems: dyadic_holder_chaining, kc_ae_increment_bound.
Previous: kc_ae_increment_bound · Next: kc_ae_nbhd_holder.
Source excerpt, lines 276–284 · 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.kc_ae_interval_holder_readable
(P : Measure Ω) [IsProbabilityMeasure P]
(X : ℝ → Ω → ℝ) {p q : ℝ} {M : ℝ≥0}
(hX : ProbabilityTheory.IsKolmogorovProcess X P p q M)
{α : ℝ} (hα0 : 0 < α) (hαpq : α * p < q - 1) :
∀ᵐ ω ∂P, ∀ j : ℤ, ∃ (K : ℝ) (N : ℕ), 0 ≤ K ∧
∀ s ∈ dyadicRationals, ∀ t ∈ dyadicRationals,
(j : ℝ) ≤ s → s ≤ (j : ℝ) + 1 → (j : ℝ) ≤ t → t ≤ (j : ℝ) + 1 →
|s - t| ≤ (1 / 2 : ℝ) ^ N → |X s ω - X t ω| ≤ K * |s - t| ^ α := by sorry