Almost-Everywhere Congruence Of The Frozen Picard Step
ProvedLevyStochCalc.Ito.Picard.picardStepOnRawStop_congr_ae_readableThis is an auxiliary locality statement for the frozen Picard step. In the setting of a probability space , a sigma-finite mark measure , Brownian motion , Poisson random measure , filtration , regular Lipschitz coefficients, initial state , and two jointly measurable progressively measurable processes with finite Bielecki norms, assume
- and agree -almost surely at every coordinate for every time in ;
- and .
Then, for every , their frozen Picard steps agree almost surely, coordinatewise:
This technical congruence lemma allows almost-sure equality of inputs to be propagated through the Picard operator.
Original Lean declaration header
Within namespace LevyStochCalc.Ito.Picard. Shown in its original module context. Proof omitted.
theorem picardStepOnRawStop_congr_ae
{Z₁ : ℝ → Ω → (Fin n → ℝ)} (h₁m : Measurable (Function.uncurry Z₁))
(h₁a : ∀ i : Fin n, Probability.ProgressivelyMeasurable ℱ' fun ω s => Z₁ s ω i)
(h₁b : bieleckiNorm (P := P) 0 T Z₁ < ⊤)
{Z₂ : ℝ → Ω → (Fin n → ℝ)} (h₂m : Measurable (Function.uncurry Z₂))
(h₂a : ∀ i : Fin n, Probability.ProgressivelyMeasurable ℱ' fun ω s => Z₂ s ω i)
(h₂b : bieleckiNorm (P := P) 0 T Z₂ < ⊤)
(heq : ∀ t ∈ Set.Icc (0 : ℝ) T, ∀ᵐ ω ∂P, ∀ i, Z₁ t ω i = Z₂ t ω i)
{β : ℝ} (hβ : 0 < β) (hT : 0 < T) {t : ℝ} (ht : t ∈ Set.Icc (0 : ℝ) T) :
∀ᵐ ω ∂P, ∀ i,
picardStepOnRawStop W N hℱW hℱN coeffs hReg hLip h₁m h₁a h₁b hT.le x₀ t ω i
= picardStepOnRawStop W N hℱW hℱN coeffs hReg hLip h₂m h₂a h₂b hT.le x₀ t ω i
Module navigation
Module: LevyStochCalc/Ito/PicardContractionFixedPoint.
Definition modules: LevyStochCalc/Poisson/Filtered, LevyStochCalc/Brownian/Filtered, LevyStochCalc/Ito/Setting, LevyStochCalc/Brownian/Multidim, LevyStochCalc/Ito/PicardBieleckiNorm, LevyStochCalc/Poisson/RandomMeasure, LevyStochCalc/Probability/Progressive, LevyStochCalc/Ito/PicardIntegrandFrozen.
Supporting theorems: ae_eq_zero_of_bieleckiNorm_eq_zero, bieleckiNorm_picardStepOnRawStop_diff_le, measurable_picardStepOnRawStop_slice.
Previous: bieleckiNorm_picardStepOnRawStop_diff_le · Next: picardSelfMapRaw_isFixedPoint.
Source excerpt, lines 376–387 · Frozen source 408915f.
import Definitions.Def_KLSModular_LevyStochCalc_Ito_PicardContractionFixedPoint
/-
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/PicardContractionFixedPoint.lean; Apache-2.0; provenance in formalization/vendor/vendor-lock.json of the KLS repository)
open MeasureTheory ProbabilityTheory
variable {Ω : Type*} [MeasurableSpace Ω] {E : Type*} [MeasurableSpace E]
variable {P : MeasureTheory.Measure Ω} [MeasureTheory.IsProbabilityMeasure P] {ν : MeasureTheory.Measure E} [MeasureTheory.SigmaFinite ν]
variable {n d : ℕ} {ℱ : MeasureTheory.Filtration ℝ ‹MeasurableSpace Ω›} {T : ℝ}
variable (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 ν)
variable {L : ℝ}
(hLip : LevyStochCalc.Ito.Setting.JumpDiffusionCoeffs.IsLipschitz coeffs ν L)
(x₀ : Fin n → ℝ)
omit [ℱ'.IsRightContinuous]
theorem LevyStochCalc.Ito.Picard.picardStepOnRawStop_congr_ae_readable
{Z₁ : ℝ → Ω → (Fin n → ℝ)} (h₁m : Measurable (Function.uncurry Z₁))
(h₁a : ∀ i : Fin n, Probability.ProgressivelyMeasurable ℱ' fun ω s => Z₁ s ω i)
(h₁b : bieleckiNorm (P := P) 0 T Z₁ < ⊤)
{Z₂ : ℝ → Ω → (Fin n → ℝ)} (h₂m : Measurable (Function.uncurry Z₂))
(h₂a : ∀ i : Fin n, Probability.ProgressivelyMeasurable ℱ' fun ω s => Z₂ s ω i)
(h₂b : bieleckiNorm (P := P) 0 T Z₂ < ⊤)
(heq : ∀ t ∈ Set.Icc (0 : ℝ) T, ∀ᵐ ω ∂P, ∀ i, Z₁ t ω i = Z₂ t ω i)
{β : ℝ} (hβ : 0 < β) (hT : 0 < T) {t : ℝ} (ht : t ∈ Set.Icc (0 : ℝ) T) :
∀ᵐ ω ∂P, ∀ i,
picardStepOnRawStop W N hℱW hℱN coeffs hReg hLip h₁m h₁a h₁b hT.le x₀ t ω i
= picardStepOnRawStop W N hℱW hℱN coeffs hReg hLip h₂m h₂a h₂b hT.le x₀ t ω i := by sorry