Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.6 — stability of the reflected BSDE with respect to (ξ,f,S)(\xi, f, S)(ξ,f,S)

Disproved
ReflectedBSDE.Existence.proposition_3_6

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

a-priori-estimatep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reflected-bsdestability

For every horizon TTT and Lipschitz constant K>0K>0K>0 there is a constant ccc, uniform in the Brownian dimension ddd, with the following property. Let (ξ,f,S)(\xi,f,S)(ξ,f,S) and (ξ′,f′,S′)(\xi',f',S')(ξ′,f′,S′) be two triples satisfying (i)–(iv) with Lipschitz constant KKK, and ST≤ξS_T\le\xiST​≤ξ, ST′≤ξ′S'_T\le\xi'ST′​≤ξ′. Let (Y,Z,K)(Y,Z,K)(Y,Z,K) and (Y′,Z′,K′)(Y',Z',K')(Y′,Z′,K′) be square-integrable solutions ((v), (v′), (vi)–(viii)) of the corresponding reflected BSDEs. Put Δξ=ξ−ξ′\Delta\xi=\xi-\xi'Δξ=ξ−ξ′, Δf=f−f′\Delta f=f-f'Δf=f−f′, ΔS=S−S′\Delta S=S-S'ΔS=S−S′, ΔY=Y−Y′\Delta Y=Y-Y'ΔY=Y−Y′, ΔZ=Z−Z′\Delta Z=Z-Z'ΔZ=Z−Z′, ΔK=K−K′\Delta K=K-K'ΔK=K−K′. Then

E(sup⁡0≤t≤T∣ΔYt∣2+∫0T∣ΔZt∣2dt+∣ΔKT∣2)≤c E(∣Δξ∣2+∫0T∣Δf(t,Yt,Zt)∣2dt)+c[E(sup⁡0≤t≤T∣ΔSt∣2)]1/2ΨT1/2,E\Big(\sup_{0\le t\le T}|\Delta Y_t|^2+\int_0^T|\Delta Z_t|^2dt+|\Delta K_T|^2\Big)\le c\,E\Big(|\Delta\xi|^2+\int_0^T|\Delta f(t,Y_t,Z_t)|^2dt\Big)+c\Big[E\Big(\sup_{0\le t\le T}|\Delta S_t|^2\Big)\Big]^{1/2}\Psi_T^{1/2},E(0≤t≤Tsup​∣ΔYt​∣2+∫0T​∣ΔZt​∣2dt+∣ΔKT​∣2)≤cE(∣Δξ∣2+∫0T​∣Δf(t,Yt​,Zt​)∣2dt)+c[E(0≤t≤Tsup​∣ΔSt​∣2)]1/2ΨT1/2​,

where

ΨT=E[ξ2+∫0Tf2(t,0,0) dt+sup⁡0≤t≤T(St+)2+ξ′2+∫0Tf′2(t,0,0) dt+sup⁡0≤t≤T(St′+)2].\Psi_T=E\Big[\xi^2+\int_0^Tf^2(t,0,0)\,dt+\sup_{0\le t\le T}(S_t^+)^2+\xi'^2+\int_0^Tf'^2(t,0,0)\,dt+\sup_{0\le t\le T}(S_t'^+)^2\Big].ΨT​=E[ξ2+∫0T​f2(t,0,0)dt+0≤t≤Tsup​(St+​)2+ξ′2+∫0T​f′2(t,0,0)dt+0≤t≤Tsup​(St′+​)2].

The solution depends continuously on the terminal value, the coefficient and the obstacle. With identical data the right side vanishes, which gives uniqueness (Corollary 3.7).

Formalization Note As in Proposition 3.5, ccc is quantified before the dimension, probability space, data and solutions, and depends only on (T,K)(T,K)(T,K); both coefficients share the Lipschitz constant. All quantities lie in [0,∞][0,\infty][0,∞], the exponents 1/21/21/2 are real powers there, and 0⋅∞=00\cdot\infty=00⋅∞=0. If Esup⁡∣ΔS∣2=∞E\sup|\Delta S|^2=\inftyEsup∣ΔS∣2=∞ the bound is trivial unless ΨT=0\Psi_T=0ΨT​=0.

Preamble
import Mathlib
import Definitions.Def_Peng1990_SMP_Stochastic
import Definitions.Def_ReflectedBSDE_Existence_Skorohod
import Definitions.Def_ReflectedBSDE_Existence_Setting
import Definitions.Def_ReflectedBSDE_Existence_Solution

open MeasureTheory ProbabilityTheory Set
open scoped NNReal ENNReal
open Peng1990.SMP
Formal statement
namespace ReflectedBSDE.Existence

universe u

/-- Proposition 3.6 (p. 711): stability. For every `T` and Lipschitz constant `L` there is
a constant `c`, uniform in the Brownian dimension, such that for two data triples `(ξ, f, S)`, `(ξ', f', S')` satisfying (i)–(iv)
with Lipschitz constant `L` and square-integrable solutions `(Y, Z, K)`, `(Y', Z', K')`,
`E(sup|ΔY_t|² + ∫₀ᵀ|ΔZ_t|² dt + |ΔK_T|²) ≤ c E(|Δξ|² + ∫₀ᵀ|Δf(t, Y_t, Z_t)|² dt)
  + c [E(sup|ΔS_t|²)]^{1/2} Ψ_T^{1/2}`. -/
theorem proposition_3_6 :
    ∀ (T : ℝ≥0) (L : ℝ), ∃ c : ℝ≥0,
      ∀ (d : ℕ) (Ω : Type u) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
        (B : ℝ≥0 → Ω → Fin d → ℝ) (hB : IsStdBrownian P B)
        (ξ : Ω → ℝ) (f : ℝ≥0 → Ω → ℝ → (Fin d → ℝ) → ℝ) (S : ℝ≥0 → Ω → ℝ)
        (ξ' : Ω → ℝ) (f' : ℝ≥0 → Ω → ℝ → (Fin d → ℝ) → ℝ) (S' : ℝ≥0 → Ω → ℝ)
        (Y : ℝ≥0 → Ω → ℝ) (Z : ℝ≥0 → Ω → Fin d → ℝ) (K : ℝ≥0 → Ω → ℝ)
        (Y' : ℝ≥0 → Ω → ℝ) (Z' : ℝ≥0 → Ω → Fin d → ℝ) (K' : ℝ≥0 → Ω → ℝ),
        IsStandardData (augmentedFiltration P hB) P T L ξ f S →
        IsStandardData (augmentedFiltration P hB) P T L ξ' f' S' →
        SatisfiesV (augmentedFiltration P hB) P T Z →
        SolvesRBSDE (augmentedFiltration P hB) P T B ξ f S Y Z K →
        SatisfiesVPrime (augmentedFiltration P hB) P T Y K →
        SatisfiesV (augmentedFiltration P hB) P T Z' →
        SolvesRBSDE (augmentedFiltration P hB) P T B ξ' f' S' Y' Z' K' →
        SatisfiesVPrime (augmentedFiltration P hB) P T Y' K' →
        ∫⁻ ω, ((⨆ t ∈ Iic T, ‖Y t ω - Y' t ω‖ₑ ^ 2)
            + (∫⁻ s in Icc (0 : ℝ) T,
                ENNReal.ofReal (euclSq (Z s.toNNReal ω - Z' s.toNNReal ω)))
            + ‖K T ω - K' T ω‖ₑ ^ 2) ∂P
          ≤ (c : ℝ≥0∞) * ∫⁻ ω, (‖ξ ω - ξ' ω‖ₑ ^ 2
              + ∫⁻ s in Icc (0 : ℝ) T,
                ‖f s.toNNReal ω (Y s.toNNReal ω) (Z s.toNNReal ω)
                  - f' s.toNNReal ω (Y s.toNNReal ω) (Z s.toNNReal ω)‖ₑ ^ 2) ∂P
            + (c : ℝ≥0∞) * (supSqMoment P T (fun t ω => S t ω - S' t ω)) ^ (1 / 2 : ℝ)
              * (∫⁻ ω, (‖ξ ω‖ₑ ^ 2
                  + (∫⁻ s in Icc (0 : ℝ) T, ‖f s.toNNReal ω 0 0‖ₑ ^ 2)
                  + (⨆ t ∈ Iic T, ‖max (S t ω) 0‖ₑ ^ 2)
                  + ‖ξ' ω‖ₑ ^ 2
                  + (∫⁻ s in Icc (0 : ℝ) T, ‖f' s.toNNReal ω 0 0‖ₑ ^ 2)
                  + ⨆ t ∈ Iic T, ‖max (S' t ω) 0‖ₑ ^ 2) ∂P) ^ (1 / 2 : ℝ) := by sorry

end ReflectedBSDE.Existence
Source
El Karoui, Kapoudjian, Pardoux, Peng & Quenez, Reflected solutions of backward SDE's, and related obstacle problems for PDE's, Ann. Probab. 25(2) (1997), p. 711 (PDF p. 10), Proposition 3.6
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