Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.1, p. 787 — pointwise Lipschitz estimates for F and G against dD

Proved
AntonelliBFSDE.BackwardForward.lipschitz_estimates

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

backward-stochastic-differential-equationforward-backward-sdelipschitzp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Under the hypotheses of §3 and the domination of ∣dA∣|dA|∣dA∣, ∣dC∣|dC|∣dC∣ by dDdDdD, let (U,V),(U~,V~)∈L1(μ)⊗L1(μ)(U,V), (\tilde U,\tilde V) \in L^1(\mu) \otimes L^1(\mu)(U,V),(U~,V~)∈L1(μ)⊗L1(μ) and write

Δs,t(ω)=∫(s,t](∣Ur−U~r∣+∣Vr−V~r∣) dDr(ω)∈[0,∞].\Delta_{s,t}(\omega) = \int_{(s,t]} \big(|U_r - \tilde U_r| + |V_r - \tilde V_r|\big)\,dD_r(\omega) \in [0,\infty].Δs,t​(ω)=∫(s,t]​(∣Ur​−U~r​∣+∣Vr​−V~r​∣)dDr​(ω)∈[0,∞].
  1. For every ω\omegaω and every t≤Tt \le Tt≤T,
∣F(U,V)t−F(U~,V~)t∣≤k Δ0,t.|F(U,V)_t - F(\tilde U,\tilde V)_t| \le k\,\Delta_{0,t}.∣F(U,V)t​−F(U~,V~)t​∣≤kΔ0,t​.
  1. For every càdlàg version WWW of G(U,V)G(U,V)G(U,V) and W~\tilde WW~ of G(U~,V~)G(\tilde U,\tilde V)G(U~,V~) and every t≤Tt \le Tt≤T, Δt,T\Delta_{t,T}Δt,T​ is integrable and, PPP-a.s.,
∣Wt−W~t∣≤k E(Δt,T∣Ft).|W_t - \tilde W_t| \le k\,E\big(\Delta_{t,T} \mid \mathcal F_t\big).∣Wt​−W~t​∣≤kE(Δt,T​∣Ft​).

These are the two estimates from which the proof of Theorem 3.1 derives the contraction property: the Lipschitz condition in (x,y)(x,y)(x,y), and then ∣dA∣≤dD|dA| \le dD∣dA∣≤dD, ∣dC∣≤dD|dC| \le dD∣dC∣≤dD.

Formalization Note The step from ∣dA∣|dA|∣dA∣, ∣dC∣|dC|∣dC∣ to dDdDdD is the paper's "by absolute continuity", which rests on the domination hypothesis Dominated. In clause 1 the left side is compared in [0,∞][0,\infty][0,∞]; in clause 2 Δt,T\Delta_{t,T}Δt,T​ is turned into a real number, and its integrability is part of the conclusion, so the conditional expectation is not the junk value 000.

Preamble
import Mathlib
import Definitions.Def_AntonelliBFSDE_BackwardForward_Setting
import Definitions.Def_AntonelliBFSDE_BackwardForward_System

open MeasureTheory
open scoped NNReal ENNReal
Formal statement
namespace AntonelliBFSDE.BackwardForward

theorem lipschitz_estimates {Ω : Type*} [mΩ : MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (𝓕 : Filtration ℝ≥0 mΩ) (T : ℝ≥0) (β : ℝ) (hT : 0 < T)
    (husual : UsualHypotheses 𝓕 P) (IA IC : BVIntegrator 𝓕 T β) (hdom : Dominated IA IC)
    (k : ℝ) (f g : ℝ≥0 → Ω → ℝ → ℝ → ℝ) (Y : Ω → ℝ) (J : ℝ≥0 → Ω → ℝ)
    (hyp : StandingHyp 𝓕 P IA IC k f g Y J)
    (U V U' V' : ℝ≥0 → Ω → ℝ) (hU : MemL1D P IA IC U) (hV : MemL1D P IA IC V)
    (hU' : MemL1D P IA IC U') (hV' : MemL1D P IA IC V') :
    (∀ ω, ∀ t ≤ T, ENNReal.ofReal |Fop IA J f U V t ω - Fop IA J f U' V' t ω| ≤
        ENNReal.ofReal k * pathDist IA IC U V U' V' 0 t ω) ∧
    ∀ W W' : ℝ≥0 → Ω → ℝ, IsGVersion 𝓕 P IC g Y U V W → IsGVersion 𝓕 P IC g Y U' V' W' →
      ∀ t ≤ T, Integrable (fun ω => (pathDist IA IC U V U' V' t T ω).toReal) P ∧
        ∀ᵐ ω ∂P, |W t ω - W' t ω| ≤
          k * (P[fun ω => (pathDist IA IC U V U' V' t T ω).toReal | 𝓕 t]) ω := by sorry

end AntonelliBFSDE.BackwardForward
Source
Antonelli, Backward-forward stochastic differential equations, Ann. Appl. Probab. 3(3) (1993), p. 787, proof of Theorem 3.1, the two displays after 'by absolute continuity, we have that'
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

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