Theorem 7.2 (proof) — the stopping time is optimal against every control:
OpenReflectedBSDE.StoppingControl.stopping_lower_boundLet be a standard -dimensional Brownian motion on a probability space with augmented natural filtration . Let the data satisfy the standing assumptions (i)–(iv) of §2 with a.s., let , let be Lipschitz in (iii), and let be concave on for each , . Let be the conjugate of , and let be the class of bounded progressively measurable processes with . For each let be continuous Itô integrals , which define
the solution of , , and let
be the payoff of Theorem 7.2, for and (stopping times with ). Let be the solution of the reflected BSDE with coefficient , terminal value and obstacle .
Then for every there is a stopping time — namely — such that for every ,
This is the half of the saddle-point property of in the proof of Theorem 7.2 that concerns the stopping player: stopping at guarantees at least against every control, which yields .
Formalization Note The statement asserts existence of a suitable ; the source's choice is .
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
namespace ReflectedBSDE.StoppingControl
open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal NNReal
/-- Proof of Theorem 7.2 (El Karoui et al. 1997, p. 725): the stopping time
`D_t = inf{t ≤ u ≤ T ; Y_u = S_u} ∧ T` is optimal against every control. Let the data
`(ξ, f, S)` satisfy (i)–(iv) with `S ∈ 𝒮²`, `f` Lipschitz and concave in `(y, z)`, let
`(Y, Z, K)` solve the reflected BSDE with coefficient `f`, and for each `(β, γ) ∈ 𝒜` let
`J^{β,γ}` be continuous Itô integrals of `γ`. Then for every `t ∈ [0, T]` there is a stopping
time `v ∈ 𝒯_t` (namely `D_t`) with `Y_t ≤ E[Φ(t, v, β, γ) | 𝓕_t]` a.s. for every
`(β, γ) ∈ 𝒜`. -/
theorem stopping_lower_bound {Ω : 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))
(Y : ℝ≥0 → Ω → ℝ) (Z : ℝ≥0 → Ω → Fin d → ℝ) (K : ℝ≥0 → Ω → ℝ)
(hsol : IsRBSDESolution (augFiltration hB) P T B ξ f S Y Z K)
(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, ∃ v ∈ stoppingTimesFrom (augFiltration hB) T t,
∀ c ∈ admissible (augFiltration hB) P T f,
Y t ≤ᵐ[P] P[payoff T ξ f S c (J c) t v | augFiltration hB t] := by sorry
end ReflectedBSDE.StoppingControl