Lemma 5.1, first assertion, p. 24 — f₀(ξ, ·) convex; |f₀(ξ, x) − f₀(ξ̃, x̃)| ≤ α(‖ξ − ξ̃‖ + ‖x − x̃‖)
ProvedProbMetricStab.Portfolio.lemma_5_1_aconvexitylipschitz-continuityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming
Let , let be the unit sphere of , and . Then:
- for each the function is convex on ;
- for all and ,
The joint Lipschitz estimate is what makes , the dual Lipschitz metric on , the right distance for perturbations of the spectral measure.
Formalization Note Norms are Euclidean; the standing assumption of Section 5 is a hypothesis.
Preamble
import Mathlib import Definitions.Def_ProbMetricStab_Portfolio_Setting open MeasureTheory open scoped ENNReal
Formal statement
namespace ProbMetricStab.Portfolio
theorem lemma_5_1_a {s : ℕ} (α : ℝ) (hα1 : 1 < α) (hα2 : α < 2) :
(∀ ξ ∈ unitSphere s, ConvexOn ℝ Set.univ (fun x : Rs s => f0 α ξ x)) ∧
(∀ x ∈ simplex s, ∀ x' ∈ simplex s, ∀ ξ ∈ unitSphere s, ∀ ξ' ∈ unitSphere s,
|f0 α ξ x - f0 α ξ' x'| ≤ α * (‖ξ - ξ'‖ + ‖x - x'‖)) := by sorry
end ProbMetricStab.Portfolio
Source
Rachev & Römisch, Quantitative stability in stochastic programming: The method of probability metrics, preprint (edoc.hu-berlin.de), p. 24, Lemma 5.1 (first sentence)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.