(10), proof of Theorem 2.1, p. 5 — sup_{x∈M_t(ū)} d(x, M_t(ũ)) ≤ l_t‖ū − ũ‖
ProvedMultistageStab.Value.display_10lipschitzp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedral-multifunctionstochastic-programming
Consider the multistage data of program (1) and, for each stage , the set-valued map
where is the polyhedral cone of stage . Assume complete fixed recourse (A1): for . Then for every there is a constant such that
where is the Euclidean distance of to the set .
This is the Lipschitz continuity of the polyhedral maps in the Hausdorff sense; it is what lets a feasible policy for one input be moved to a nearby feasible policy for another input with a controlled error.
Formalization Note The supremum is stated pointwise, for every . The sets are nonempty by (A1), so the distance is not the junk value of an empty set.
Preamble
import Mathlib import Definitions.Def_MultistageStab_Value_Setting open MeasureTheory ProbabilityTheory open scoped ENNReal
Formal statement
namespace MultistageStab.Value
theorem display_10 (D : Data) (hA1 : CompleteRecourse D) :
∀ t ∈ Finset.Icc 2 D.T, ∃ l : ℝ, 0 < l ∧
∀ ubar util : E (D.n t), ∀ x ∈ {x : E (D.m t) | x ∈ Xc D t ∧ D.A₀ t x = ubar},
Metric.infDist x {x : E (D.m t) | x ∈ Xc D t ∧ D.A₀ t x = util} ≤ l * ‖ubar - util‖ := by sorry
end MultistageStab.Value
Source
Heitsch, Römisch & Strugarek, Stability of multistage stochastic programs, author manuscript (edoc.hu-berlin.de, c. 2005), p. 5, proof of Theorem 2.1, (10)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.