Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.2 — KT−KtK_T-K_tKT​−Kt​ is a running supremum of the negative part

Disproved
ReflectedBSDE.Existence.proposition_2_2

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reflected-bsdeskorohod-problem

Let (ξ,f,S)(\xi,f,S)(ξ,f,S) satisfy (i)–(iv) and ST≤ξS_T\le\xiST​≤ξ, and let (Y,Z,K)(Y,Z,K)(Y,Z,K) satisfy (vi)–(viii) of the reflected BSDE with stochastic integrals Jtj=∫0tZsj dBsjJ^j_t=\int_0^tZ^j_s\,dB^j_sJtj​=∫0t​Zsj​dBsj​. Then almost surely, for every t∈[0,T]t\in[0,T]t∈[0,T],

KT−Kt=sup⁡t≤u≤T(ξ+∫uTf(s,Ys,Zs) ds−∫uT(Zs,dBs)−Su)−,K_T-K_t=\sup_{t\le u\le T}\Big(\xi+\int_u^Tf(s,Y_s,Z_s)\,ds-\int_u^T(Z_s,dB_s)-S_u\Big)^-,KT​−Kt​=t≤u≤Tsup​(ξ+∫uT​f(s,Ys​,Zs​)ds−∫uT​(Zs​,dBs​)−Su​)−,

where ∫uT(Zs,dBs)=∑j(JTj−Juj)\int_u^T(Z_s,dB_s)=\sum_j(J^j_T-J^j_u)∫uT​(Zs​,dBs​)=∑j​(JTj​−Juj​) and a−=max⁡(−a,0)a^-=\max(-a,0)a−=max(−a,0).

The proposition comes from the Skorohod lemma applied in reversed time. It writes the reflecting process in terms of the other components of the solution, and it is the starting point of the integrability estimates for KKK.

Formalization Note Because the Itô integral is only defined for square-integrable integrands, the hypothesis "(vi)–(viii)" contains Z∈H2Z\in\mathbb H^2Z∈H2, condition (v), which the paper does not assume here (recorded deviation). The identity is stated almost surely for all ttt at once, which implies the paper's "for each ttt". It is stated for the solution's own continuous version JJJ of the stochastic integrals. The supremum is a real supremum over the compact interval [t,T][t,T][t,T], which is finite almost surely because the expression is continuous in uuu.

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 2.2 (p. 705): for a solution of (vi)–(viii), almost surely, for every
`t ∈ [0, T]`,
`K_T − K_t = sup_{t≤u≤T} (ξ + ∫ᵤᵀ f(s, Y_s, Z_s) ds − ∫ᵤᵀ (Z_s, dB_s) − S_u)⁻`,
where `∫ᵤᵀ (Z_s, dB_s) = Σⱼ (Jʲ_T − Jʲ_u)` for the stochastic integrals `J` of the solution. -/
theorem proposition_2_2 {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)
    (Y : ℝ≥0 → Ω → ℝ) (Z : ℝ≥0 → Ω → Fin d → ℝ) (K : ℝ≥0 → Ω → ℝ)
    (J : Fin d → ℝ≥0 → Ω → ℝ)
    (hsol : SolvesRBSDEWith (augmentedFiltration P hB) P T B ξ f S Y Z K J) :
    ∀ᵐ ω ∂P, ∀ t ≤ T,
      K T ω - K t ω = ⨆ u : Icc t T,
        max (-(ξ ω
          + (∫ s in Icc ((u : ℝ≥0) : ℝ) T, f s.toNNReal ω (Y s.toNNReal ω) (Z s.toNNReal ω))
          - ∑ j, (J j T ω - J j u ω) - S u ω)) 0 := 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.2, (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