Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Restriction of a Simple Predictable Integrand to an Interval

Proved
LevyStochCalc.Brownian.Ito.SimplePredictable.exists_restrict_Ioc_readable

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

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

This theorem establishes existence of a simple predictable representation restricted to the interval (a,b](a,b](a,b].

Let PPP be a probability measure, WWW a Brownian motion, and F\mathcal FF a filtration. Let GGG be a simple predictable integrand whose coefficients are strongly measurable with respect to the sigma-algebra at the left endpoint of each tile. Assume:

  1. C≥0C\ge0C≥0;
  2. every coefficient of GGG has absolute value at most CCC;
  3. 0≤a<b0\le a<b0≤a<b.

Then there exist a real horizon T3T_3T3​ and a simple predictable integrand QQQ such that its coefficients are adapted and strongly measurable, its evaluation is the restriction of GGG to (a,b](a,b](a,b],

Q.eval⁡(s,ω)=1(a,b](s) G.eval⁡(s,ω),Q.\operatorname{eval}(s,\omega)=\mathbf 1_{(a,b]}(s)\,G.\operatorname{eval}(s,\omega),Q.eval(s,ω)=1(a,b]​(s)G.eval(s,ω),

and every coefficient ξjQ(ω)\xi^Q_j(\omega)ξjQ​(ω) satisfies

∣ξjQ(ω)∣≤{C,a≤τjQ and τj+1Q≤b,0,otherwise.|\xi^Q_j(\omega)|\le \begin{cases} C,&a\le \tau^Q_{j}\text{ and }\tau^Q_{j+1}\le b,\\ 0,&\text{otherwise.} \end{cases}∣ξjQ​(ω)∣≤{C,0,​a≤τjQ​ and τj+1Q​≤b,otherwise.​

The construction is provided by SimplePredictable.exists_restrict_Ioc_readable and is useful for localizing elementary Itô integrands while retaining adaptation and coefficient bounds.

Original Lean declaration header

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

theorem SimplePredictable.exists_restrict_Ioc
    {P : Measure Ω} [IsProbabilityMeasure P] (W : LevyStochCalc.Brownian.BrownianMotion P)
    (ℱ : Filtration ℝ ‹MeasurableSpace Ω›)
    {T : ℝ} (G : SimplePredictable Ω T)
    (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)
    {a b : ℝ} (ha : 0 ≤ a) (hab : a < b) :
    ∃ (T₃ : ℝ) (Q : SimplePredictable Ω T₃),
      (∀ i : Fin Q.N, @MeasureTheory.StronglyMeasurable Ω ℝ _
        (ℱ (Q.partition i.castSucc)) (Q.ξ i))
      ∧ (∀ s ω, Q.eval s ω = (Set.Ioc a b).indicator (fun _ => (1 : ℝ)) s * G.eval s ω)
      ∧ (∀ (j : Fin Q.N) (ω : Ω), |Q.ξ j ω|
          ≤ if a ≤ Q.partition j.castSucc ∧ Q.partition j.succ ≤ b then C else 0)

Module navigation

Module: LevyStochCalc/Brownian/ItoIncrementMomentRestrict.

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

Supporting theorems: SimplePredictable.abs_eval_le, SimplePredictable.exists_mul_simple, stepIoc_eval, stepIoc₀_eval.

Previous: SimplePredictable.varClock_le_Ioc.

Source excerpt, lines 184–197 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_LevyStochCalc_Brownian_ItoIncrementMomentRestrict

/-
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/ItoIncrementMomentRestrict.lean; Apache-2.0; provenance in formalization/vendor/vendor-lock.json of the KLS repository)
open MeasureTheory ProbabilityTheory
universe u
variable {Ω : Type u} [MeasurableSpace Ω]
Formal statement

theorem LevyStochCalc.Brownian.Ito.SimplePredictable.exists_restrict_Ioc_readable
    {P : Measure Ω} [IsProbabilityMeasure P] (W : LevyStochCalc.Brownian.BrownianMotion P)
    (ℱ : Filtration ℝ ‹MeasurableSpace Ω›)
    {T : ℝ} (G : SimplePredictable Ω T)
    (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)
    {a b : ℝ} (ha : 0 ≤ a) (hab : a < b) :
    ∃ (T₃ : ℝ) (Q : SimplePredictable Ω T₃),
      (∀ i : Fin Q.N, @MeasureTheory.StronglyMeasurable Ω ℝ _
        (ℱ (Q.partition i.castSucc)) (Q.ξ i))
      ∧ (∀ s ω, Q.eval s ω = (Set.Ioc a b).indicator (fun _ => (1 : ℝ)) s * G.eval s ω)
      ∧ (∀ (j : Fin Q.N) (ω : Ω), |Q.ξ j ω|
          ≤ if a ≤ Q.partition j.castSucc ∧ Q.partition j.succ ≤ b then C else 0) := by sorry
Source
Lean source: https://github.com/cgarryZA/LevyStochCalc/blob/984dbf0b790031eac05d56fe5a84b65e15e1e932/LevyStochCalc/Brownian/ItoIncrementMomentRestrict.lean#L180-L236 (repository human-ai-mathematics/kls-lean, commit 408915f, module `LevyStochCalc.Brownian.ItoIncrementMomentRestrict`, declaration `LevyStochCalc.Brownian.Ito.SimplePredictable.exists_restrict_Ioc`; 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