Theorem 2.1, p. 4 — |v(ξ) − v(ξ̃)| ≤ L(‖ξ − ξ̃‖_r + Σ_{t=2}^{T−1} D_t(F_t, F̃_t))
ProvedMultistageStab.Value.theorem_2_1Consider the linear multistage stochastic program (1) with input process , polyhedral , polyhedral cones (), fixed recourse matrices, and costs and right-hand sides affine in , under one of the three randomness patterns with exponents . Assume
- (A1) complete fixed recourse: for ;
- (A2) is finite and the objective is level-bounded locally uniformly at ;
- (A3) , with deterministic;
- is bounded.
Then there are positive constants , , such that
for every admissible input with and finite. Here and are the filtrations generated by and , and
both level sets taken at threshold .
The theorem shows that the optimal value of a multistage program depends on the input not only through an distance but also through a distance between the information structures, and that the two together control it in a Lipschitz way.
Formalization Note The estimate is stated in (ENNReal.ofReal |v(ξ) − v(ξ̃)| ≤ …); both optimal values are finite extended reals, so their real parts are the values themselves. The randomness pattern is a hypothesis on the data, and all three rows of the paper's table are covered. Admissible inputs are measurable, in , and have a deterministic first component, as the model's requires.
import Mathlib import Definitions.Def_MultistageStab_Value_Setting open MeasureTheory ProbabilityTheory open scoped ENNReal
namespace MultistageStab.Value
theorem theorem_2_1 (D : Data) (pat : Pattern) (hpat : pat.Holds D)
{Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
(ξ : ℕ → Ω → E D.d) (hA1 : CompleteRecourse D) (hA2 : A2 P D pat ξ)
(hA3 : Admissible P D pat ξ) (hX1 : Bornology.IsBounded (X1 D)) :
∃ L : ℝ, 0 < L ∧ ∃ α : ℝ, 0 < α ∧ ∃ δ : ℝ, 0 < δ ∧
∀ ξ' : ℕ → Ω → E D.d, Admissible P D pat ξ' →
inputDist P D pat ξ ξ' ≤ ENNReal.ofReal δ →
value P D pat ξ' ≠ ⊥ → value P D pat ξ' ≠ ⊤ →
ENNReal.ofReal |(value P D pat ξ).toReal - (value P D pat ξ').toReal| ≤
ENNReal.ofReal L * (inputDist P D pat ξ ξ' +
∑ t ∈ Finset.Icc 2 (D.T - 1), filtDist P D pat ξ ξ' α t) := by sorry
end MultistageStab.Value
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.