Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.3 — YtY_tYt​ is the value of an optimal stopping problem

Disproved
ReflectedBSDE.Existence.proposition_2_3

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

essential-supremumoptimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reflected-bsde

Let (ξ,f,S)(\xi,f,S)(ξ,f,S) satisfy (i)–(iv) and ST≤ξS_T\le\xiST​≤ξ, with moreover S∈S2S\in\mathcal S^2S∈S2. Let (Y,Z,K)(Y,Z,K)(Y,Z,K) be a solution of the reflected BSDE satisfying (v)–(viii) and (v′). Then for each t∈[0,T]t\in[0,T]t∈[0,T],

Yt=ess sup⁡v∈TtE[∫tvf(s,Ys,Zs) ds+Sv1{v<T}+ξ 1{v=T} ∣ Ft],Y_t=\operatorname*{ess\,sup}_{v\in\mathcal T_t}E\Big[\int_t^vf(s,Y_s,Z_s)\,ds+S_v\mathbf 1_{\{v<T\}}+\xi\,\mathbf 1_{\{v=T\}}\ \Big|\ \mathcal F_t\Big],Yt​=v∈Tt​esssup​E[∫tv​f(s,Ys​,Zs​)ds+Sv​1{v<T}​+ξ1{v=T}​ ​ Ft​],

where Tt\mathcal T_tTt​ is the set of stopping times vvv with t≤v≤Tt\le v\le Tt≤v≤T, and the essential supremum is taken relative to Ft\mathcal F_tFt​.

The solution of the reflected BSDE is the value process of an optimal stopping problem: stop at v<Tv<Tv<T and receive the obstacle, or wait until TTT and receive ξ\xiξ, with running reward f(s,Ys,Zs)f(s,Y_s,Z_s)f(s,Ys​,Zs​) in between.

Formalization Note Two hypotheses are added. The first is S∈S2S\in\mathcal S^2S∈S2: under (iv) alone only S+S^+S+ is square integrable, so SvS_vSv​ need not be integrable, and Lean's conditional expectation of a non-integrable variable is 000. The paper's Remark 3.2 shows that this is no loss of generality. The second is (v′), which follows from (v) by Corollary 3.3 and which the paper's proof uses ("From (v) and (v′)"). The essential supremum is the predicate IsEssSupOver relative to Ft\mathcal F_tFt​.

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
import Definitions.Def_ReflectedBSDE_Existence_OptimalStopping

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

/-- Proposition 2.3 (p. 705): for a solution of (v)–(viii) (hence of (v′)), and with the obstacle
in `𝒮²` (Remark 3.2), for each `t ∈ [0, T]`,
`Y_t = ess sup_{v ∈ 𝒯_t} E[∫ₜᵛ f(s, Y_s, Z_s) ds + S_v 1_{v<T} + ξ 1_{v=T} | 𝓕_t]`. -/
theorem proposition_2_3 {d : ℕ} {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω}
    [IsProbabilityMeasure P] {B : ℝ≥0 → Ω → Fin d → ℝ} (hB : IsStdBrownian P B)
    (T : ℝ≥0) (L : ℝ) (ξ : Ω → ℝ) (f : ℝ≥0 → Ω → ℝ → (Fin d → ℝ) → ℝ) (S : ℝ≥0 → Ω → ℝ)
    (hdata : IsStandardData (augmentedFiltration P hB) P T L ξ f S)
    (hS2 : IsS2 (augmentedFiltration P hB) P T S)
    (Y : ℝ≥0 → Ω → ℝ) (Z : ℝ≥0 → Ω → Fin d → ℝ) (K : ℝ≥0 → Ω → ℝ)
    (hZ : SatisfiesV (augmentedFiltration P hB) P T Z)
    (hsol : SolvesRBSDE (augmentedFiltration P hB) P T B ξ f S Y Z K)
    (hYK : SatisfiesVPrime (augmentedFiltration P hB) P T Y K) :
    ∀ t ≤ T, IsEssSupOver P (augmentedFiltration P hB t)
      (fun v : stoppingTimesBetween (augmentedFiltration P hB) t T =>
        condExp (augmentedFiltration P hB t) P (stoppingReward T ξ f S Y Z t v))
      (Y t) := 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. 705 (PDF p. 4), Proposition 2.3, (2)
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