Deterministic Dyadic Hölder Chaining
ProvedLevyStochCalc.Brownian.Continuity.dyadic_holder_chaining_modularfunctional-inequalitieskls-conjecturekls-modularlog-concavevendored-levystochcalc
This is the deterministic dyadic Hölder-chaining lemma. Let , , and , with and . Assume that for every , every integer with and , the consecutive dyadic increment satisfies
Then there exists such that for all dyadic rationals with ,
This supplies the deterministic pathwise estimate used after obtaining eventual dyadic increment bounds.
Superseded upload. This snapshot was replaced by LevyStochCalc.Brownian.Continuity.dyadic_holder_chaining_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_ContinuityDyadicChaining /- 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/ContinuityDyadicChaining.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
Formal statement
lemma LevyStochCalc.Brownian.Continuity.dyadic_holder_chaining_modular {f : ℝ → ℝ} {α C : ℝ} {N : ℕ}
(hα : 0 < α) (hC : 0 ≤ C)
(hf : ∀ n, N ≤ n → ∀ k : ℤ, 0 ≤ k → k + 1 ≤ 2 ^ n →
|f ((k + 1 : ℤ) / 2 ^ n) - f ((k : ℤ) / 2 ^ n)| ≤ C * ((1 / 2 : ℝ) ^ α) ^ n) :
∃ K : ℝ, 0 ≤ K ∧ ∀ s ∈ dyadicRationals, ∀ t ∈ dyadicRationals,
0 ≤ s → s ≤ 1 → 0 ≤ t → t ≤ 1 → |s - t| ≤ (1 / 2 : ℝ) ^ N →
|f s - f t| ≤ K * |s - t| ^ α := by sorry
Source
Lean source: https://github.com/cgarryZA/LevyStochCalc/blob/984dbf0b790031eac05d56fe5a84b65e15e1e932/LevyStochCalc/Brownian/ContinuityDyadicChaining.lean#L402-L519 (repository human-ai-mathematics/kls-lean, commit 408915f, module `LevyStochCalc.Brownian.ContinuityDyadicChaining`, declaration `LevyStochCalc.Brownian.Continuity.dyadic_holder_chaining`; 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).