Almost-Everywhere Dyadic Increment Bound
ProvedLevyStochCalc.Brownian.Continuity.kc_ae_increment_bound_modularfunctional-inequalitieskls-conjecturekls-modularlog-concavevendored-levystochcalc
This is the almost-sure dyadic increment estimate for a Kolmogorov process. Let be a probability space, , , , and assume IsKolmogorovProcess X P p q M. If , then for -almost every there exists such that for every and every integer with and ,
This is the probabilistic input for dyadic_holder_chaining_modular.
Superseded upload. This snapshot was replaced by LevyStochCalc.Brownian.Continuity.kc_ae_increment_bound_readable: open the readable replacement. The replacement preserves the frozen source and mathematical statement, with a compact declaration context. This historical node remains available for existing imports.
Preamble
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
section
namespace LevyStochCalc
end LevyStochCalc
open LevyStochCalc
section
namespace LevyStochCalc.Brownian
end LevyStochCalc.Brownian
open LevyStochCalc LevyStochCalc.Brownian
section
namespace LevyStochCalc.Brownian.Continuity
end LevyStochCalc.Brownian.Continuity
open LevyStochCalc LevyStochCalc.Brownian LevyStochCalc.Brownian.Continuity
universe u
variable {Ω : Type u} [MeasurableSpace Ω]
Formal statement
lemma LevyStochCalc.Brownian.Continuity.kc_ae_increment_bound_modular
(P : Measure Ω) [IsProbabilityMeasure P]
(X : ℝ → Ω → ℝ) {p q : ℝ} {M : ℝ≥0}
(hX : ProbabilityTheory.IsKolmogorovProcess X P p q M)
{α : ℝ} (hαpq : α * p < q - 1) :
∀ᵐ ω ∂P, ∃ N : ℕ, ∀ n, N ≤ n → ∀ k : ℤ, 0 ≤ k → k + 1 ≤ 2 ^ n →
|X (((k : ℝ) + 1) / 2 ^ n) ω - X ((k : ℝ) / 2 ^ n) ω|
≤ ((1 / 2 : ℝ) ^ α) ^ n := by sorry
Source
Lean source: https://github.com/cgarryZA/LevyStochCalc/blob/984dbf0b790031eac05d56fe5a84b65e15e1e932/LevyStochCalc/Brownian/ContinuityKolmogorovBounds.lean#L223-L269 (repository human-ai-mathematics/kls-lean, commit 408915f, module `LevyStochCalc.Brownian.ContinuityKolmogorovBounds`, declaration `LevyStochCalc.Brownian.Continuity.kc_ae_increment_bound`; the repository is private at upload time). Vendored from https://github.com/cgarryZA/LevyStochCalc at commit 984dbf0b790031eac05d56fe5a84b65e15e1e932 (Apache-2.0; upstream copyright notice retained in the Lean text).