Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.4: every symmetric restricted weight is a generator mixture

Proved
RiskUncSets.Symmetric.symRestrictedSimplex_subset_mixtures

by mikedeng1 · Oct 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1risk-measures

Let N≥1N\ge1N≥1 and take qqq in the symmetric restricted simplex Δ^symN\widehat\Delta^N_{\mathrm{sym}}ΔsymN​. There are nonnegative coefficients λ1,…,λN^\lambda_1,\ldots,\lambda_{\widehat N}λ1​,…,λN​ summing to one such that

q=∑j=1N^λjqˉj.q=\sum_{j=1}^{\widehat N}\lambda_j\bar q^{j}.q=j=1∑N​λj​qˉ​j.

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 qqq; 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 ∑jλj=1\sum_j\lambda_j=1∑j​λj​=1 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
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me