Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7 — the payoffs Φ(t,v,β,γ)\Phi(t,v,\beta,\gamma)Φ(t,v,β,γ) and Γ0,tβ,γΦ(t,v,β,γ)\Gamma^{\beta,\gamma}_{0,t}\Phi(t,v,\beta,\gamma)Γ0,tβ,γ​Φ(t,v,β,γ) are integrable

Open
ReflectedBSDE.StoppingControl.payoff_integrable

by tianyipeng · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

backward-sdeminimaxoptimal-stoppingreflected-bsdestochastic-control

Let BBB be a standard ddd-dimensional Brownian motion on a probability space (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) with augmented natural filtration (Ft)(\mathcal F_t)(Ft​). Let the data (ξ,f,S)(\xi,f,S)(ξ,f,S) satisfy the standing assumptions (i)–(iv) of §2 with ST≤ξS_T\le\xiST​≤ξ a.s., let S∈S2S\in\mathcal S^2S∈S2, let fff be Lipschitz in (y,z)(y,z)(y,z) (iii), and let f(ω,t,⋅,⋅)f(\omega,t,\cdot,\cdot)f(ω,t,⋅,⋅) be concave on R×Rd\mathbb R\times\mathbb R^dR×Rd for each (ω,t)(\omega,t)(ω,t), t≤Tt\le Tt≤T. Let F(t,β,γ)=sup⁡(y,z)[f(t,y,z)−βy−⟨γ,z⟩]F(t,\beta,\gamma)=\sup_{(y,z)}[f(t,y,z)-\beta y-\langle\gamma,z\rangle]F(t,β,γ)=sup(y,z)​[f(t,y,z)−βy−⟨γ,z⟩] be the conjugate of fff, and let A\mathcal AA be the class of bounded progressively measurable processes (β,γ)(\beta,\gamma)(β,γ) with E∫0TF(t,βt,γt)2 dt<∞E\int_0^T F(t,\beta_t,\gamma_t)^2\,dt<\inftyE∫0T​F(t,βt​,γt​)2dt<∞. For each (β,γ)∈A(\beta,\gamma)\in\mathcal A(β,γ)∈A let Jβ,γJ^{\beta,\gamma}Jβ,γ be continuous Itô integrals ∫0⋅γsj dBsj\int_0^\cdot\gamma^j_s\,dB^j_s∫0⋅​γsj​dBsj​, which define

Γt,sβ,γ=exp⁡(∫tsβr dr+∫tsγr dBr−12∫ts∣γr∣2 dr),\Gamma^{\beta,\gamma}_{t,s}=\exp\Big(\int_t^s\beta_r\,dr+\int_t^s\gamma_r\,dB_r-\tfrac12\int_t^s|\gamma_r|^2\,dr\Big),Γt,sβ,γ​=exp(∫ts​βr​dr+∫ts​γr​dBr​−21​∫ts​∣γr​∣2dr),

the solution of dΓt,s=Γt,s(βs ds+(γs,dBs))d\Gamma_{t,s}=\Gamma_{t,s}(\beta_s\,ds+(\gamma_s,dB_s))dΓt,s​=Γt,s​(βs​ds+(γs​,dBs​)), Γt,t=1\Gamma_{t,t}=1Γt,t​=1, and let

Φ(t,v,β,γ)=Γt,vβ,γ[Sv1{v<T}+ξ1{v=T}]+∫tvΓt,sβ,γF(s,βs,γs) ds\Phi(t,v,\beta,\gamma)=\Gamma^{\beta,\gamma}_{t,v}\big[S_v1_{\{v<T\}}+\xi1_{\{v=T\}}\big]+\int_t^v\Gamma^{\beta,\gamma}_{t,s}F(s,\beta_s,\gamma_s)\,dsΦ(t,v,β,γ)=Γt,vβ,γ​[Sv​1{v<T}​+ξ1{v=T}​]+∫tv​Γt,sβ,γ​F(s,βs​,γs​)ds

be the payoff of Theorem 7.2, for t∈[0,T]t\in[0,T]t∈[0,T] and v∈Ttv\in\mathcal T_tv∈Tt​ (stopping times with t≤v≤Tt\le v\le Tt≤v≤T).

Then for every t∈[0,T]t\in[0,T]t∈[0,T], every (β,γ)∈A(\beta,\gamma)\in\mathcal A(β,γ)∈A and every v∈Ttv\in\mathcal T_tv∈Tt​:

  1. Φ(t,v,β,γ)\Phi(t,v,\beta,\gamma)Φ(t,v,β,γ) is integrable;
  2. Γ0,tβ,γ Φ(t,v,β,γ)=Γv[Sv1{v<T}+ξ1{v=T}]+∫tvΓsF(s,βs,γs) ds\Gamma^{\beta,\gamma}_{0,t}\,\Phi(t,v,\beta,\gamma)=\Gamma_v\big[S_v1_{\{v<T\}}+\xi1_{\{v=T\}}\big]+\int_t^v\Gamma_sF(s,\beta_s,\gamma_s)\,dsΓ0,tβ,γ​Φ(t,v,β,γ)=Γv​[Sv​1{v<T}​+ξ1{v=T}​]+∫tv​Γs​F(s,βs​,γs​)ds (with Γ=Γ0,⋅β,γ\Gamma=\Gamma^{\beta,\gamma}_{0,\cdot}Γ=Γ0,⋅β,γ​, the payoff of Proposition 7.1) is integrable.

These integrability facts are used implicitly in §7 whenever conditional expectations of the payoffs are taken (they are the reason the assumption S∈S2S\in\mathcal S^2S∈S2 of Remark 3.2 is imposed); they allow passing between the representations of Proposition 7.1 and Theorem 7.2 by pulling the Ft\mathcal F_tFt​-measurable factor Γ0,t\Gamma_{0,t}Γ0,t​ out of E[ ⋅∣Ft]E[\,\cdot\mid\mathcal F_t]E[⋅∣Ft​].

Formalization Note FFF is read as a real number (value 000 where it is +∞+\infty+∞, a dt×dPdt\times dPdt×dP-null set for (β,γ)∈A(\beta,\gamma)\in\mathcal A(β,γ)∈A); the Itô integrals are given as a family indexed by A\mathcal AA, as in the goal theorem minimax_representation.

Preamble
import Mathlib
import Definitions.Def_Peng1990_SMP_Stochastic
import Definitions.Def_MultiperiodRisk_Bellman_EssInf
import Definitions.Def_ReflectedBSDE_StoppingControl_Setting
import Definitions.Def_ReflectedBSDE_StoppingControl_Control
Formal statement
namespace ReflectedBSDE.StoppingControl

open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal NNReal

/-- Integrability of the payoffs of §7 (El Karoui et al. 1997, pp. 724–725; Remark 3.2 and the
standing assumption `S ∈ 𝒮²`). Let the data `(ξ, f, S)` satisfy (i)–(iv) with `S ∈ 𝒮²`, `f`
Lipschitz and concave in `(y, z)`, and for each `(β, γ) ∈ 𝒜` let `J^{β,γ}` be continuous Itô
integrals of `γ`. Then for every `t ∈ [0, T]`, every `(β, γ) ∈ 𝒜` and every `v ∈ 𝒯_t`, the
payoff `Φ(t, v, β, γ)` of Theorem 7.2 is integrable, and so is
`Γ^{β,γ}_{0,t} Φ(t, v, β, γ) = Γ_v[S_v 1_{v<T} + ξ 1_{v=T}] + ∫ₜᵛ Γ_s F(s, β_s, γ_s) ds`
(the payoff of Proposition 7.1, with `Γ = Γ^{β,γ}_{0,·}`). -/
theorem payoff_integrable {Ω : Type*} [MeasurableSpace Ω] {d : ℕ} {P : Measure Ω}
    [IsProbabilityMeasure P] {B : ℝ≥0 → Ω → Fin d → ℝ} (hB : Peng1990.SMP.IsStdBrownian P B)
    (T : ℝ≥0) (ξ : Ω → ℝ) (f : ℝ≥0 → Ω → ℝ → (Fin d → ℝ) → ℝ) (S : ℝ≥0 → Ω → ℝ)
    (hdata : StandingData (augFiltration hB) P T ξ f S)
    (hLip : ∃ K : ℝ, IsLipschitzCoeff P T f K)
    (hS2 : InS2 (augFiltration hB) P T S)
    (hconc : ∀ ω, ∀ t ≤ T, ConcaveOn ℝ Set.univ (fun p : ℝ × (Fin d → ℝ) => f t ω p.1 p.2))
    (J : Control Ω d → Fin d → ℝ≥0 → Ω → ℝ)
    (hJ : ∀ c ∈ admissible (augFiltration hB) P T f,
      IsContItoIntegral (augFiltration hB) P T B c.2 (J c)) :
    ∀ t ≤ T, ∀ c ∈ admissible (augFiltration hB) P T f,
      ∀ v ∈ stoppingTimesFrom (augFiltration hB) T t,
        Integrable (payoff T ξ f S c (J c) t v) P ∧
        Integrable (fun ω => linGamma c.1 c.2 (J c) 0 t ω * payoff T ξ f S c (J c) t v ω) P := by sorry

end ReflectedBSDE.StoppingControl
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), pp. 724-725, Section 7 (Proposition 7.1, Theorem 7.2 and its proof), https://doi.org/10.1214/aop/1024404416

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