Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.5 — a priori estimate E(sup⁡Y2+∫∣Z∣2+KT2)≤C E(ξ2+∫f2(t,0,0)+sup⁡(S+)2)E(\sup Y^2+\int|Z|^2+K_T^2)\le C\,E(\xi^2+\int f^2(t,0,0)+\sup(S^+)^2)E(supY2+∫∣Z∣2+KT2​)≤CE(ξ2+∫f2(t,0,0)+sup(S+)2)

Disproved
ReflectedBSDE.Existence.proposition_3_5

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

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

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) satisfy (i)–(iv) with Lipschitz constant KKK, and ST≤ξS_T\le\xiST​≤ξ. Let (Y,Z,K)(Y,Z,K)(Y,Z,K) be a square-integrable solution of the reflected BSDE, i.e. one satisfying (v), (v′) and (vi)–(viii). Then

E(sup⁡0≤t≤TYt2+∫0T∣Zt∣2 dt+KT2)≤C E(ξ2+∫0Tf2(t,0,0) dt+sup⁡0≤t≤T(St+)2).E\Big(\sup_{0\le t\le T}Y_t^2+\int_0^T|Z_t|^2\,dt+K_T^2\Big)\le C\,E\Big(\xi^2+\int_0^Tf^2(t,0,0)\,dt+\sup_{0\le t\le T}(S_t^+)^2\Big).E(0≤t≤Tsup​Yt2​+∫0T​∣Zt​∣2dt+KT2​)≤CE(ξ2+∫0T​f2(t,0,0)dt+0≤t≤Tsup​(St+​)2).

The estimate bounds the size of the solution by the size of the data. It is the basic tool for the contraction argument behind existence and for the stability estimate (Proposition 3.6).

Formalization Note The paper says "there exists a constant CCC" after fixing a solution. Read that way the statement is trivial, since the left side is finite. Its proof gives a constant that depends only on the Lipschitz constant and TTT, so the formal statement puts ∃C\exists C∃C before the dimension, probability space, data and solution. Expectations are lower Lebesgue integrals in [0,∞][0,\infty][0,∞]. ∣Z∣|Z|∣Z∣ is the Euclidean norm, and the Lipschitz constant is called L in Lean.

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.5 (p. 709): a priori estimate. For every dimension `d`, horizon `T` and
Lipschitz constant `L` there is a constant `C`, uniform in the Brownian dimension, such that every square-integrable solution
`(Y, Z, K)` (conditions (v)–(viii) and (v′)) of the RBSDE with data `(ξ, f, S)` satisfying
(i)–(iv) with Lipschitz constant `L` obeys
`E(sup_{0≤t≤T} Y_t² + ∫₀ᵀ |Z_t|² dt + K_T²) ≤ C E(ξ² + ∫₀ᵀ f²(t, 0, 0) dt + sup_{0≤t≤T} (S_t⁺)²)`. -/
theorem proposition_3_5 :
    ∀ (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 → Ω → ℝ)
        (Y : ℝ≥0 → Ω → ℝ) (Z : ℝ≥0 → Ω → Fin d → ℝ) (K : ℝ≥0 → Ω → ℝ),
        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 →
        ∫⁻ ω, ((⨆ t ∈ Iic T, ‖Y t ω‖ₑ ^ 2)
            + (∫⁻ s in Icc (0 : ℝ) T, ENNReal.ofReal (euclSq (Z s.toNNReal ω)))
            + ‖K T ω‖ₑ ^ 2) ∂P
          ≤ (C : ℝ≥0∞) * ∫⁻ ω, (‖ξ ω‖ₑ ^ 2
            + (∫⁻ s in Icc (0 : ℝ) T, ‖f s.toNNReal ω 0 0‖ₑ ^ 2)
            + ⨆ t ∈ Iic T, ‖max (S t ω) 0‖ₑ ^ 2) ∂P := 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. 709 (PDF p. 8), Proposition 3.5
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