Finite Dyadic Bound for the Picard Step
ProvedLevyStochCalc.Ito.Picard.lintegral_sq_iSup_picardStep_lt_top_readableThis states that each coordinate of the Picard step has finite dyadic norm on every positive window.
Let be a probability measure, a multidimensional Brownian motion, a Poisson random measure with sigma-finite intensity, and compatible filtrations. Let be the jump-diffusion coefficients and a state process. Assume the diffusion and jump coefficients are measurable, progressively measurable, and have finite squared energies on every positive window; assume also that the drift is measurable and has finite squared energy on every positive window.
For every coordinate and every ,
The conclusion is an ENNReal strict-finiteness statement and is used to show that the Picard step belongs to the required class.
Original Lean conclusion excerpt
Within namespace LevyStochCalc.Ito.Picard. Shown in its original module context. Earlier hypotheses and the proof are omitted from this excerpt; the complete verified statement remains below.
Probability.MarkedProgressivelyMeasurable ℱ (fun ω s e => coeffs.γ s (X s ω) e i))
(h_γ_sq : ∀ i : Fin n, ∀ T : ℝ, 0 < T →
∫⁻ ω, ∫⁻ s in Set.Icc (0 : ℝ) T, ∫⁻ e,
(‖coeffs.γ s (X s ω) e i‖₊ : ℝ≥0∞) ^ 2 ∂ν ∂volume ∂P < ⊤)
(hμm : ∀ i : Fin n, Measurable (Function.uncurry fun ω s => coeffs.μ s (X s ω) i))
(hμsq : ∀ i : Fin n, ∀ b : ℝ, 0 < b →
∫⁻ ω, ∫⁻ s in Set.Icc (0 : ℝ) b,
(‖coeffs.μ s (X s ω) i‖₊ : ℝ≥0∞) ^ 2 ∂volume ∂P < ⊤)
(i : Fin n) {T' : ℝ} (hT' : 0 < T') :
∫⁻ ω, (⨆ m, (‖dyadicRunMax (fun t ω =>
picardStep W N ℱ hℱW hℱN coeffs X x₀ h_σ_meas h_σ_progMeas h_σ_sq
h_γ_meas h_γ_progMeas h_γ_sq t ω i) T' m ω‖₊ : ℝ≥0∞)) ^ 2 ∂P < ⊤
Module navigation
Module: LevyStochCalc/Ito/PicardSupL2.
Definition modules: LevyStochCalc/Brownian/Multidim, LevyStochCalc/Poisson/RandomMeasure, LevyStochCalc/Ito/Setting, LevyStochCalc/Poisson/Filtered, LevyStochCalc/Brownian/Filtered, LevyStochCalc/Ito/PicardStepMap, LevyStochCalc/Probability/Progressive, LevyStochCalc/Probability/DoobContinuous.
Supporting theorems: iSup_dyadicRunMax_drift_le, lintegral_sq_drift_bound_lt_top, lintegral_sq_iSup_diffusion_lt_top, enorm_dyadicRunMax, lintegral_sq_dyadicRunMax_le.
Previous: lintegral_sq_iSup_diffusion_lt_top · Next: lintegral_sq_iSup_picardSelfMapRaw_lt_top.
Source excerpt, lines 272–283 · Frozen source 408915f.
import Definitions.Def_KLSModular_LevyStochCalc_Ito_PicardSupL2
/-
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/Ito/PicardSupL2.lean; Apache-2.0; provenance in formalization/vendor/vendor-lock.json of the KLS repository)
open MeasureTheory ProbabilityTheory LevyStochCalc.Probability
open scoped NNReal ENNReal
universe u v
variable {Ω : Type u} [MeasurableSpace Ω] {E : Type v} [MeasurableSpace E]
variable {P : MeasureTheory.Measure Ω} [MeasureTheory.IsProbabilityMeasure P] {n d : ℕ}
variable {ν : MeasureTheory.Measure E} [MeasureTheory.SigmaFinite ν]
theorem LevyStochCalc.Ito.Picard.lintegral_sq_iSup_picardStep_lt_top_readable
(W : LevyStochCalc.Brownian.Multidim.MultidimBrownianMotion P d)
(N : LevyStochCalc.Poisson.PoissonRandomMeasure P ν)
(ℱ : MeasureTheory.Filtration ℝ ‹MeasurableSpace Ω›)
(hℱW : ∀ j : Fin d, LevyStochCalc.Brownian.IsBrownianFiltration (W.W j) ℱ)
(hℱN : LevyStochCalc.Poisson.IsPoissonFiltration N ℱ)
(coeffs : LevyStochCalc.Ito.Setting.JumpDiffusionCoeffs n d E)
(X : ℝ → Ω → (Fin n → ℝ)) (x₀ : Fin n → ℝ)
(h_σ_meas : ∀ i : Fin n, ∀ j : Fin d,
Measurable (Function.uncurry (fun ω s => coeffs.σ s (X s ω) i j)))
(h_σ_progMeas : ∀ i : Fin n, ∀ j : Fin d,
Probability.ProgressivelyMeasurable ℱ (fun ω s => coeffs.σ s (X s ω) i j))
(h_σ_sq : ∀ i : Fin n, ∀ j : Fin d, ∀ T : ℝ, 0 < T →
∫⁻ ω, ∫⁻ s in Set.Icc (0 : ℝ) T,
(‖coeffs.σ s (X s ω) i j‖₊ : ℝ≥0∞) ^ 2 ∂volume ∂P < ⊤)
(h_γ_meas : ∀ i : Fin n,
Measurable (fun p : Ω × ℝ × E => coeffs.γ p.2.1 (X p.2.1 p.1) p.2.2 i))
(h_γ_progMeas : ∀ i : Fin n,
Probability.MarkedProgressivelyMeasurable ℱ (fun ω s e => coeffs.γ s (X s ω) e i))
(h_γ_sq : ∀ i : Fin n, ∀ T : ℝ, 0 < T →
∫⁻ ω, ∫⁻ s in Set.Icc (0 : ℝ) T, ∫⁻ e,
(‖coeffs.γ s (X s ω) e i‖₊ : ℝ≥0∞) ^ 2 ∂ν ∂volume ∂P < ⊤)
(hμm : ∀ i : Fin n, Measurable (Function.uncurry fun ω s => coeffs.μ s (X s ω) i))
(hμsq : ∀ i : Fin n, ∀ b : ℝ, 0 < b →
∫⁻ ω, ∫⁻ s in Set.Icc (0 : ℝ) b,
(‖coeffs.μ s (X s ω) i‖₊ : ℝ≥0∞) ^ 2 ∂volume ∂P < ⊤)
(i : Fin n) {T' : ℝ} (hT' : 0 < T') :
∫⁻ ω, (⨆ m, (‖dyadicRunMax (fun t ω =>
picardStep W N ℱ hℱW hℱN coeffs X x₀ h_σ_meas h_σ_progMeas h_σ_sq
h_γ_meas h_γ_progMeas h_γ_sq t ω i) T' m ω‖₊ : ℝ≥0∞)) ^ 2 ∂P < ⊤ := by sorry