Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.1 — the backward reflection problem (fff independent of (y,z)(y,z)(y,z)) has a unique solution

Disproved
ReflectedBSDE.Existence.proposition_5_1

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

existenceoptimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reflected-bsdeuniqueness

Suppose that the coefficient does not depend on (y,z)(y,z)(y,z): f=f(t)f=f(t)f=f(t) is a given Ft\mathcal F_tFt​-progressively measurable process with

(ii′)E∫0Tf(t)2 dt<∞.\text{(ii}'\text{)}\qquad E\int_0^Tf(t)^2\,dt<\infty.(ii′)E∫0T​f(t)2dt<∞.

Let ξ\xiξ satisfy (i), let SSS satisfy (iv), and let ST≤ξS_T\le\xiST​≤ξ almost surely. A solution of the backward reflection problem (BRP) is a triple (Y,Z,K)(Y,Z,K)(Y,Z,K) satisfying (v), (vii), (viii) and

(vi′)Yt=ξ+∫tTf(s) ds+KT−Kt−∫tT(Zs,dBs),0≤t≤T.\text{(vi}'\text{)}\qquad Y_t=\xi+\int_t^Tf(s)\,ds+K_T-K_t-\int_t^T(Z_s,dB_s),\qquad 0\le t\le T.(vi′)Yt​=ξ+∫tT​f(s)ds+KT​−Kt​−∫tT​(Zs​,dBs​),0≤t≤T.

Then the BRP has a solution, and any two solutions coincide: the YYY's and KKK's are indistinguishable on [0,T][0,T][0,T], and the ZZZ's agree dP⊗dtdP\otimes dtdP⊗dt-almost everywhere.

The BRP is the linear building block of the existence proof. Theorem 5.2 obtains the solution of the general reflected BSDE as a fixed point of the map that sends (U,V)(U,V)(U,V) to the solution of the BRP with coefficient f(s,Us,Vs)f(s,U_s,V_s)f(s,Us​,Vs​).

Formalization Note The BRP is the reflected BSDE of ReflectedBSDE.Existence.Solution with the coefficient (t,ω,y,z)↦f(t,ω)(t,\omega,y,z)\mapsto f(t,\omega)(t,ω,y,z)↦f(t,ω), so no separate definition is introduced. The paper's "(ii)" in the statement of Proposition 5.1 is (ii′), and no Lipschitz condition is needed.

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

/-- Proposition 5.1 (p. 716): if the coefficient `f(t)` does not depend on `(y, z)` and is a
progressively measurable process with (ii′) `E ∫₀ᵀ f(t)² dt < ∞`, then under (i), (iv) and
`S_T ≤ ξ` the backward reflection problem (v), (vi′), (vii), (viii) has a unique solution. -/
theorem proposition_5_1 {d : ℕ} {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω}
    [IsProbabilityMeasure P] {B : ℝ≥0 → Ω → Fin d → ℝ} (hB : IsStdBrownian P B)
    (T : ℝ≥0) (ξ : Ω → ℝ) (f : ℝ≥0 → Ω → ℝ) (S : ℝ≥0 → Ω → ℝ)
    (hξ : IsTerminalValue (augmentedFiltration P hB) P T ξ)
    (hf : L2F (augmentedFiltration P hB) P T f)
    (hS : IsObstacle (augmentedFiltration P hB) P T S)
    (hST : ∀ᵐ ω ∂P, S T ω ≤ ξ ω) :
    (∃ (Y : ℝ≥0 → Ω → ℝ) (Z : ℝ≥0 → Ω → Fin d → ℝ) (K : ℝ≥0 → Ω → ℝ),
        SatisfiesV (augmentedFiltration P hB) P T Z ∧
        SolvesRBSDE (augmentedFiltration P hB) P T B ξ (fun t ω _ _ => f t ω) S Y Z K) ∧
    ∀ (Y : ℝ≥0 → Ω → ℝ) (Z : ℝ≥0 → Ω → Fin d → ℝ) (K : ℝ≥0 → Ω → ℝ)
      (Y' : ℝ≥0 → Ω → ℝ) (Z' : ℝ≥0 → Ω → Fin d → ℝ) (K' : ℝ≥0 → Ω → ℝ),
      SatisfiesV (augmentedFiltration P hB) P T Z →
      SolvesRBSDE (augmentedFiltration P hB) P T B ξ (fun t ω _ _ => f t ω) S Y Z K →
      SatisfiesV (augmentedFiltration P hB) P T Z' →
      SolvesRBSDE (augmentedFiltration P hB) P T B ξ (fun t ω _ _ => f t ω) S Y' Z' K' →
      SameSolution P T Y Z K Y' Z' K' := 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. 716 (PDF p. 15), (ii′), (vi′) and Proposition 5.1
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