Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Second-Moment Bound by the Variance Clock

Proved
LevyStochCalc.Brownian.Ito.SimplePredictable.integral_partialSum_sq_le_varClock_readable

by Lazyfill · Oct 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-inequalitieskls-conjecturekls-modularkls-readablelog-concavevendored-levystochcalc

This theorem bounds the second moment of every partial sum by its coefficient variance budget.

Let GGG be a simple predictable integrand, WWW a Brownian motion with Brownian filtration F\mathcal FF, and assume the coefficients are strongly measurable. Let C≥0C\ge0C≥0, assume ∣ξi(ω)∣≤C|\xi_i(\omega)|\le C∣ξi​(ω)∣≤C, and let cic_ici​ be another coefficient bound satisfying ∣ξi(ω)∣≤ci|\xi_i(\omega)|\le c_i∣ξi​(ω)∣≤ci​ for every tile iii and outcome ω\omegaω. For every k≤Nk\le Nk≤N,

∫(G.partialSum⁡(W,k))2 dP≤varClock⁡(G,c,k).\int \bigl(G.\operatorname{partialSum}(W,k)\bigr)^2\,dP \le \operatorname{varClock}(G,c,k).∫(G.partialSum(W,k))2dP≤varClock(G,c,k).

Here SimplePredictable.varClock is the finite sum of ci2(τi+1−τi)c_i^2(\tau_{i+1}-\tau_i)ci2​(τi+1​−τi​) over the first kkk tiles. The theorem is a reusable L2L^2L2 estimate with per-tile rather than uniform coefficient bounds.

Original Lean declaration header

Within namespace LevyStochCalc.Brownian.Ito.SimplePredictable. Shown in its original module context. Proof omitted.

theorem integral_partialSum_sq_le_varClock {c : Fin G.N → ℝ}
    (hc : ∀ (i : Fin G.N) (ω : Ω), |G.ξ i ω| ≤ c i) :
    ∀ (k : ℕ) (_hk : k ≤ G.N),
      ∫ ω, (G.partialSum W k ω) ^ 2 ∂P ≤ G.varClock c k

Module navigation

Module: LevyStochCalc/Brownian/ItoFourthMomentPartialSums.

Definition modules: LevyStochCalc/Brownian/Filtered, LevyStochCalc/Brownian/ItoSimpleIntegrand, LevyStochCalc/Brownian/ItoFourthMomentIncrements, LevyStochCalc/Brownian/Construction.

Supporting theorems: integral_partialSum_sq_succ.

Previous: integral_partialSum_pow_four_succ · Next: integral_partialSum_pow_four_le_varClock.

Source excerpt, lines 438–441 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_LevyStochCalc_Brownian_ItoFourthMomentPartialSums

/-
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/ItoFourthMomentPartialSums.lean; Apache-2.0; provenance in formalization/vendor/vendor-lock.json of the KLS repository)
universe u
variable {Ω : Type u} [MeasurableSpace Ω]
variable {T : ℝ} (G : LevyStochCalc.Brownian.Ito.SimplePredictable Ω T)
  {P : MeasureTheory.Measure Ω} [MeasureTheory.IsProbabilityMeasure P] (W : LevyStochCalc.Brownian.BrownianMotion P)
variable (ℱ : MeasureTheory.Filtration ℝ ‹MeasurableSpace Ω›) (hℱ : LevyStochCalc.Brownian.IsBrownianFiltration W ℱ)
  (h_adapt : ∀ i : Fin G.N, @MeasureTheory.StronglyMeasurable Ω ℝ _
    (ℱ (G.partition i.castSucc)) (G.ξ i))
  {C : ℝ} (hC0 : 0 ≤ C) (hC : ∀ (i : Fin G.N) (ω : Ω), |G.ξ i ω| ≤ C)
include hℱ h_adapt hC0 hC
Formal statement

theorem LevyStochCalc.Brownian.Ito.SimplePredictable.integral_partialSum_sq_le_varClock_readable {c : Fin G.N → ℝ}
    (hc : ∀ (i : Fin G.N) (ω : Ω), |G.ξ i ω| ≤ c i) :
    ∀ (k : ℕ) (_hk : k ≤ G.N),
      ∫ ω, (G.partialSum W k ω) ^ 2 ∂P ≤ G.varClock c k := by sorry
Source
Lean source: https://github.com/cgarryZA/LevyStochCalc/blob/984dbf0b790031eac05d56fe5a84b65e15e1e932/LevyStochCalc/Brownian/ItoFourthMomentPartialSums.lean#L436-L459 (repository human-ai-mathematics/kls-lean, commit 408915f, module `LevyStochCalc.Brownian.ItoFourthMomentPartialSums`, declaration `LevyStochCalc.Brownian.Ito.SimplePredictable.integral_partialSum_sq_le_varClock`; 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).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me