Clamped Simple-Integrand Square Integral
ProvedLevyStochCalc.Brownian.Ito.setIntegral_eval_sq_Icc_clamped_readableThis technical identity concerns a simple predictable integrand on a measurable space , a point , a horizon parameter , and a time . Writing , , and for the integrand value, the real integral over the interval equals the partition sum
The clamping by minima makes each partition length nonnegative, including when . This is the real-valued companion of the corresponding nonnegative integral formula and provides a closed sum representation for the simple-level compensator.
Original Lean declaration header
Within namespace LevyStochCalc.Brownian.Ito. Shown in its original module context. Proof omitted.
lemma setIntegral_eval_sq_Icc_clamped {T : ℝ} (G : SimplePredictable Ω T) (ω : Ω)
{t : ℝ} :
∫ u in Set.Icc (0 : ℝ) t, (G.eval u ω) ^ 2 ∂volume
= ∑ i : Fin G.N,
(min (G.partition i.succ) t - min (G.partition i.castSucc) t) * (G.ξ i ω) ^ 2
Module navigation
Module: LevyStochCalc/Brownian/ItoL2CompletionCompensator.
Definition modules: LevyStochCalc/Brownian/ItoSimpleIntegrand.
Previous: simpleIntegral_sub_sq_bochner_clamped_weighted · Next: martingale_simpleIntegral_sq_sub_compensator.
Source excerpt, lines 288–292 · Frozen source 408915f.
import Definitions.Def_KLSModular_LevyStochCalc_Brownian_ItoL2CompletionCompensator
/-
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/ItoL2CompletionCompensator.lean; Apache-2.0; provenance in formalization/vendor/vendor-lock.json of the KLS repository)
open MeasureTheory
universe u
variable {Ω : Type u} [MeasurableSpace Ω]
lemma LevyStochCalc.Brownian.Ito.setIntegral_eval_sq_Icc_clamped_readable {T : ℝ} (G : SimplePredictable Ω T) (ω : Ω)
{t : ℝ} :
∫ u in Set.Icc (0 : ℝ) t, (G.eval u ω) ^ 2 ∂volume
= ∑ i : Fin G.N,
(min (G.partition i.succ) t - min (G.partition i.castSucc) t) * (G.ξ i ω) ^ 2 := by sorry