§7, p. 724 — a concave Lipschitz coefficient is the minimum of its affine minorants
ProvedReflectedBSDE.StoppingControl.conjugate_representationbackward-sdeconcave-conjugateconvex-dualityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a coefficient such that, for each fixed with , is concave on , and which satisfies the Lipschitz condition (iii). Let be its conjugate function and . Then for every and every ,
the infimum is achieved, and the set is a.s. bounded.
This conjugacy is what turns the concave coefficient into a family of affine ones, indexed by the controls .
Formalization Note The infimum is stated as an attained minimum: every gives an upper bound, and some gives equality; is read as a real number on , where it is finite. "A.s. bounded" is read as: for a.e. , is bounded for every . Only concavity and (iii) are assumed, since the display is a statement of convex analysis about each .
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
/-- §7, p. 724 (conjugacy display). If `f(ω, t, ·, ·)` is concave on `ℝ × ℝ^d` for each
`(ω, t)` and `f` satisfies the Lipschitz condition (iii), then for each `(ω, t)` and `(y, z)`,
`f(t, y, z) = inf_{(β, γ) ∈ D^F_t} {F(t, β, γ) + βy + ⟨γ, z⟩}` with the infimum achieved, and
a.s. the set `D^F_t` is bounded (for every `t ∈ [0, T]`). -/
theorem conjugate_representation {Ω : Type*} [MeasurableSpace Ω] {d : ℕ} (P : Measure Ω)
(T : ℝ≥0) (f : ℝ≥0 → Ω → ℝ → (Fin d → ℝ) → ℝ)
(hconc : ∀ ω, ∀ t ≤ T, ConcaveOn ℝ Set.univ (fun p : ℝ × (Fin d → ℝ) => f t ω p.1 p.2))
(hLip : ∃ K : ℝ, IsLipschitzCoeff P T f K) :
(∀ ω, ∀ t ≤ T, ∀ (y : ℝ) (z : Fin d → ℝ),
(∀ p ∈ conjDomain f ω t, f t ω y z ≤ (conj f ω t p.1 p.2).toReal + p.1 * y + dot p.2 z) ∧
∃ p ∈ conjDomain f ω t, f t ω y z = (conj f ω t p.1 p.2).toReal + p.1 * y + dot p.2 z) ∧
∀ᵐ ω ∂P, ∀ t ≤ T, Bornology.IsBounded (conjDomain f ω t) := 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), p. 724, §7 (display following the definition of F and D^F_t), https://doi.org/10.1214/aop/1024404416
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.