Finite Window Norm of the Raw Picard Self-Map
ProvedLevyStochCalc.Ito.Picard.lintegral_sq_iSup_picardSelfMapRaw_lt_top_readableThis proves that the raw Picard self-map has finite windowwise norm.
Let be a probability measure, and be compatible Brownian and Poisson drivers, and let be right-continuous with the stated null-set and pre-zero assumptions. Let the coefficients be regular and Lipschitz. Let be measurable and progressively measurable coordinatewise, with finite Bielecki norm on a window , where . For any ,
The integral and supremum are represented in ENNReal. This supplies the control needed for subsequent fixed-point arguments.
Original Lean declaration header
Within namespace LevyStochCalc.Ito.Picard. Shown in its original module context. Proof omitted.
theorem lintegral_sq_iSup_picardSelfMapRaw_lt_top
(W : LevyStochCalc.Brownian.Multidim.MultidimBrownianMotion P d)
(N : LevyStochCalc.Poisson.PoissonRandomMeasure P ν)
(ℱ : MeasureTheory.Filtration ℝ ‹MeasurableSpace Ω›) [ℱ.IsRightContinuous]
(hℱW : ∀ j : Fin d, LevyStochCalc.Brownian.IsBrownianFiltration (W.W j) ℱ)
(hℱN : LevyStochCalc.Poisson.IsPoissonFiltration N ℱ)
(hℱ0 : ∀ t : ℝ, t ≤ 0 → ℱ 0 ≤ ℱ t)
(hnull : ∀ s : Set Ω, MeasurableSet s → P s = 0 → MeasurableSet[ℱ 0] s)
(coeffs : LevyStochCalc.Ito.Setting.JumpDiffusionCoeffs n d E)
(hReg : LevyStochCalc.Ito.Setting.JumpDiffusionCoeffs.IsRegular coeffs ν)
{L : ℝ} (hLip : LevyStochCalc.Ito.Setting.JumpDiffusionCoeffs.IsLipschitz coeffs ν L)
(x₀ : Fin n → ℝ) {T : ℝ} (hT : 0 < T)
{Z : ℝ → Ω → (Fin n → ℝ)} (hZm : Measurable (Function.uncurry Z))
(hZa : ∀ i : Fin n, Probability.ProgressivelyMeasurable ℱ fun ω s => Z s ω i)
(hZb : bieleckiNorm (P := P) 0 T Z < ⊤) {T' : ℝ} (hT' : 0 < T') :
∫⁻ ω, (⨆ t : Set.Icc (0 : ℝ) T', ∑ i,
(‖(picardSelfMapRaw W N ℱ hℱW hℱN hℱ0 hnull coeffs hReg hLip x₀ hT hZm hZa hZb).X
(t : ℝ) ω i‖₊ : ℝ≥0∞) ^ 2) ∂P < ⊤
Module navigation
Module: LevyStochCalc/Ito/PicardSupL2.
Definition modules: LevyStochCalc/Ito/PicardBieleckiNorm, LevyStochCalc/Poisson/Filtered, LevyStochCalc/Brownian/Filtered, LevyStochCalc/Ito/Setting, LevyStochCalc/Brownian/Multidim, LevyStochCalc/Ito/PicardOutputModification, LevyStochCalc/Poisson/RandomMeasure, LevyStochCalc/Probability/Progressive.
Supporting theorems: lintegral_sq_iSup_picardStep_lt_top, measurable_picardStepOnRawStop_slice, picardSelfMapRaw_ae_eq, enorm_dyadicRunMax, iSup_enorm_eq_iSup_dyadicRunMax.
Previous: lintegral_sq_iSup_picardStep_lt_top.
Source excerpt, lines 334–351 · 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_picardSelfMapRaw_lt_top_readable
(W : LevyStochCalc.Brownian.Multidim.MultidimBrownianMotion P d)
(N : LevyStochCalc.Poisson.PoissonRandomMeasure P ν)
(ℱ : MeasureTheory.Filtration ℝ ‹MeasurableSpace Ω›) [ℱ.IsRightContinuous]
(hℱW : ∀ j : Fin d, LevyStochCalc.Brownian.IsBrownianFiltration (W.W j) ℱ)
(hℱN : LevyStochCalc.Poisson.IsPoissonFiltration N ℱ)
(hℱ0 : ∀ t : ℝ, t ≤ 0 → ℱ 0 ≤ ℱ t)
(hnull : ∀ s : Set Ω, MeasurableSet s → P s = 0 → MeasurableSet[ℱ 0] s)
(coeffs : LevyStochCalc.Ito.Setting.JumpDiffusionCoeffs n d E)
(hReg : LevyStochCalc.Ito.Setting.JumpDiffusionCoeffs.IsRegular coeffs ν)
{L : ℝ} (hLip : LevyStochCalc.Ito.Setting.JumpDiffusionCoeffs.IsLipschitz coeffs ν L)
(x₀ : Fin n → ℝ) {T : ℝ} (hT : 0 < T)
{Z : ℝ → Ω → (Fin n → ℝ)} (hZm : Measurable (Function.uncurry Z))
(hZa : ∀ i : Fin n, Probability.ProgressivelyMeasurable ℱ fun ω s => Z s ω i)
(hZb : bieleckiNorm (P := P) 0 T Z < ⊤) {T' : ℝ} (hT' : 0 < T') :
∫⁻ ω, (⨆ t : Set.Icc (0 : ℝ) T', ∑ i,
(‖(picardSelfMapRaw W N ℱ hℱW hℱN hℱ0 hnull coeffs hReg hLip x₀ hT hZm hZa hZb).X
(t : ℝ) ω i‖₊ : ℝ≥0∞) ^ 2) ∂P < ⊤ := by sorry