Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Euler–Maruyama iterates are square integrable

Proved
AppliedSDE.SarkkaSolin.euler_maruyama_scheme_memLp_two

by Himan · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

probabilitystochastic-analysis

Setting. Let WWW be a Brownian motion on a probability space (Ω,P)(\Omega,P)(Ω,P) with a filtration F\mathcal FF to which WWW is adapted and whose future increments are independent of the past. Let b,σ:R→Rb,\sigma:\mathbb R\to\mathbb Rb,σ:R→R be globally Lipschitz with a common constant LLL, and let T>0T>0T>0. For each n≥1n\ge 1n≥1 let E0n,…,EnnE^n_0,\dots,E^n_nE0n​,…,Enn​ be the Euler–Maruyama scheme on the grid tk=kT/nt_k=kT/ntk​=kT/n with step h=T/nh=T/nh=T/n: E0n=x0E^n_0=x_0E0n​=x0​ and

Ek+1n=Ekn+b(Ekn) h+σ(Ekn) (Wtk+1−Wtk).E^n_{k+1}=E^n_k+b(E^n_k)\,h+\sigma(E^n_k)\,(W_{t_{k+1}}-W_{t_k}).Ek+1n​=Ekn​+b(Ekn​)h+σ(Ekn​)(Wtk+1​​−Wtk​​).

Claim. For every n≥1n\ge 1n≥1 and every k∈{0,…,n}k\in\{0,\dots,n\}k∈{0,…,n} the iterate EknE^n_kEkn​ belongs to L2(P)L^2(P)L2(P).

Proof idea. Induction on kkk. The iterate EknE^n_kEkn​ is Ftk\mathcal F_{t_k}Ftk​​-measurable, the maps b,σb,\sigmab,σ have linear growth, and the increment Wtk+1−WtkW_{t_{k+1}}-W_{t_k}Wtk+1​​−Wtk​​ is Gaussian and independent of Ftk\mathcal F_{t_k}Ftk​​, so E[σ(Ekn)2(Wtk+1−Wtk)2]=h E[σ(Ekn)2]<∞E[\sigma(E^n_k)^2(W_{t_{k+1}}-W_{t_k})^2]=h\,E[\sigma(E^n_k)^2]<\inftyE[σ(Ekn​)2(Wtk+1​​−Wtk​​)2]=hE[σ(Ekn​)2]<∞.

Preamble
import Mathlib
import Definitions.Def_KLSModular_LevyStochCalc_Brownian_Filtered
import Definitions.Def_KLSModular_LevyStochCalc_Brownian_ItoL2CompletionMaster
open MeasureTheory ProbabilityTheory Filter LevyStochCalc.Brownian
open scoped ENNReal NNReal Topology BigOperators
Formal statement
theorem AppliedSDE.SarkkaSolin.euler_maruyama_scheme_memLp_two
    {Ω : Type*} [MeasurableSpace Ω]
    (P : Measure Ω) [IsProbabilityMeasure P]
    (W : LevyStochCalc.Brownian.BrownianMotion P)
    (ℱ : Filtration ℝ ‹MeasurableSpace Ω›)
    (hW : LevyStochCalc.Brownian.IsBrownianFiltration W ℱ)
    (T x₀ : ℝ) (hT : 0 < T)
    (b σ : ℝ → ℝ)
    (hLip : ∃ L : ℝ, 0 ≤ L ∧
      (∀ x y : ℝ, |b x - b y| ≤ L * |x - y|) ∧
      (∀ x y : ℝ, |σ x - σ y| ≤ L * |x - y|))
    (E : (n : ℕ) → Fin (n + 1) → Ω → ℝ)
    (hE0 : ∀ (n : ℕ) (ω : Ω), E n 0 ω = x₀)
    (hErec : ∀ (n : ℕ), 0 < n →
      ∀ (k : Fin n) (ω : Ω),
        E n k.succ ω = E n k.castSucc ω +
          b (E n k.castSucc ω) * (T / n) +
          σ (E n k.castSucc ω) *
          (W.W ((((k.val + 1 : ℕ) : ℝ) * T / n)) ω -
            W.W (((k.val : ℝ) * T / n)) ω)) :
    ∀ (n : ℕ), 0 < n → ∀ k : Fin (n + 1), MemLp (E n k) 2 P := by
  sorry
Source
Särkkä and Solin, Applied Stochastic Differential Equations (Cambridge University Press, 2019), https://doi.org/10.1017/9781108186735, Chapter 8, Algorithm 8.1 and Section 8.2 (Euler–Maruyama method and its strong convergence). Child lemma of the Prove2Me theorem AppliedSDE.SarkkaSolin.euler_maruyama_grid_l2_local_error.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me