Proof of Theorem 4.4: every symmetric restricted weight is a generator mixture
ProvedRiskUncSets.Symmetric.symRestrictedSimplex_subset_mixturesconvex-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1risk-measures
Let and take in the symmetric restricted simplex . There are nonnegative coefficients summing to one such that
This gives the reverse inclusion and establishes that the displayed generator family spans the entire symmetric subclass.
Formalization Note The source constructs the coefficients from the final coordinates of ; the Lean statement records the resulting existence claim. The source's printed intermediate sum on p. 1492 has an indexing slip, while its claimed conclusion is retained.
Preamble
import Definitions.Def_RiskUncSets_Symmetric_Setting
Formal statement
namespace RiskUncSets.Symmetric
theorem symRestrictedSimplex_subset_mixtures {N : ℕ} (hN : 0 < N)
(q : Fin N → ℝ) (hq : q ∈ symRestrictedSimplex N) :
∃ lam : Fin (Nhat N) → ℝ,
(∀ j, 0 ≤ lam j) ∧
∑ j, lam j = 1 ∧
q = ∑ j, lam j • qbar j := by sorry
end RiskUncSets.Symmetric
Source
Bertsimas & Brown, Constructing uncertainty sets for robust linear optimization, Oper. Res. 57(6) (2009), p. 1492, proof of Theorem 4.4, reverse inclusion; DOI 10.1287/opre.1080.0646
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.