Proof of Theorem 6(c), p. 39 — on 𝕌₁, ∂±f_δ/∂λ = √δ(1 − E[βᵀA(X)⁻¹β inf/sup_{g∈Γ*} g²])
ProvedOTDRO.WorstCase.dual_lambda_derivativesAssume Assumptions 1 and 2, , convex, and fix with . Then is finite for every , and for every such : for -almost every the set is nonempty and is bounded, the functions and are -integrable, and the right and left derivatives of are
At a dual optimizer the first-order conditions turn these formulas into , which is what lets the randomized worst case of Theorem 6(c) spend exactly the budget .
Formalization Note This is an unnumbered display in the proof of Theorem 6(c), which the page derives from Proposition 2 and a general result on directional derivatives of integral functionals ([2, Proposition 2.1]); it is stated here under Assumptions 1–2 only, without Proposition 2's max-of- form, which is what the proof of Theorem 6 uses. is the hypothesis of Theorem 6, in whose proof the display appears; at , and . Finiteness of (neither nor ) on is a conjunct, so the derivatives of are taken of its real values. Infimum and supremum over are real sInf/sSup of ; nonemptiness and boundedness are conjuncts, and integrability is a conjunct so that the expectations are genuine.
import Mathlib import Definitions.Def_OTDRO_Dual_Setting open MeasureTheory
namespace OTDRO.WorstCase
/-- **One-sided `λ`-derivatives of `f_δ` on `𝕌₁`** (arXiv:1810.02403v3, §5.4, proof of
Theorem 6(c), p. 39; unnumbered). Under Assumptions 1–2, for `β ∈ B`, `β ≠ 0`: `f_δ(β, λ)` is
finite for `λ > λ_thr(β)`, and at every such `λ`
`∂₊f_δ/∂λ(β, λ) = √δ(1 − E[βᵀA(X)⁻¹β inf_{g∈Γ*(β,λ;X)} g²])`,
`∂₋f_δ/∂λ(β, λ) = √δ(1 − E[βᵀA(X)⁻¹β sup_{g∈Γ*(β,λ;X)} g²])`. -/
theorem dual_lambda_derivatives {d : ℕ} (P0 : Measure (EuclideanSpace ℝ (Fin d)))
[IsProbabilityMeasure P0] (A : EuclideanSpace ℝ (Fin d) → Matrix (Fin d) (Fin d) ℝ)
(ρmin ρmax : ℝ) (hA : OTDRO.Dual.Assumption1 P0 A ρmin ρmax) (ℓ : ℝ → ℝ) (h2 : OTDRO.Dual.Assumption2 P0 ℓ)
(δ : ℝ) (hδ : 0 < δ) (B : Set (EuclideanSpace ℝ (Fin d))) (hB : Convex ℝ B)
(β : EuclideanSpace ℝ (Fin d)) (hβB : β ∈ B) (hβ : β ≠ 0) :
(∀ l : ℝ, OTDRO.Dual.lamThr P0 ℓ A δ β < l → OTDRO.Dual.fDelta P0 ℓ A δ β l ≠ ⊤ ∧ OTDRO.Dual.fDelta P0 ℓ A δ β l ≠ ⊥) ∧
∀ lam : ℝ, OTDRO.Dual.lamThr P0 ℓ A δ β < lam →
(∀ᵐ x ∂P0, (OTDRO.Dual.maximizers ℓ A δ β lam x).Nonempty ∧
BddAbove ((fun g : ℝ => g ^ 2) '' OTDRO.Dual.maximizers ℓ A δ β lam x)) ∧
Integrable (fun x => OTDRO.Dual.quadInv A β x *
sInf ((fun g : ℝ => g ^ 2) '' OTDRO.Dual.maximizers ℓ A δ β lam x)) P0 ∧
Integrable (fun x => OTDRO.Dual.quadInv A β x *
sSup ((fun g : ℝ => g ^ 2) '' OTDRO.Dual.maximizers ℓ A δ β lam x)) P0 ∧
HasDerivWithinAt (fun l => (OTDRO.Dual.fDelta P0 ℓ A δ β l).toReal)
(Real.sqrt δ * (1 - ∫ x, OTDRO.Dual.quadInv A β x *
sInf ((fun g : ℝ => g ^ 2) '' OTDRO.Dual.maximizers ℓ A δ β lam x) ∂P0))
(Set.Ici lam) lam ∧
HasDerivWithinAt (fun l => (OTDRO.Dual.fDelta P0 ℓ A δ β l).toReal)
(Real.sqrt δ * (1 - ∫ x, OTDRO.Dual.quadInv A β x *
sSup ((fun g : ℝ => g ^ 2) '' OTDRO.Dual.maximizers ℓ A δ β lam x) ∂P0))
(Set.Iic lam) lam := by sorry
end OTDRO.WorstCase
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.