Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.5, p. 1493 — Π_q(𝒜) ⊆ 𝒰 iff there exist s₁, …, s_m, t₁, …, t_m with e′(s_k + t_k) ≥ v_k and s_{k,i} + t_{k,j} ≤ (u′_k a_j)q_i

Proved
RiskUncSets.InnerApprox.permutohull_subset_polytope_iff

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

linear-optimizationlp-dualityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1permutohullrobust-optimization

Let A={a1,…,aN}⊂Rn\mathcal A = \{a_1,\dots,a_N\} \subset \mathbb R^nA={a1​,…,aN​}⊂Rn, let q∈RNq \in \mathbb R^Nq∈RN be any vector, and let U={a∈Rn:uk′a≥vk, k=1,…,m}\mathcal U = \{a \in \mathbb R^n : u_k' a \ge v_k,\ k = 1,\dots,m\}U={a∈Rn:uk′​a≥vk​, k=1,…,m} be the polyhedron (14). Then Πq(A)⊆U\Pi_q(\mathcal A) \subseteq \mathcal UΠq​(A)⊆U if and only if there exist s1,…,sm,t1,…,tm∈RNs_1,\dots,s_m, t_1,\dots,t_m \in \mathbb R^Ns1​,…,sm​,t1​,…,tm​∈RN such that

e′(sk+tk)≥vk∀k∈{1,…,m},sk,i+tk,j≤(uk′aj) qi∀(i,j)∈{1,…,N}2, ∀k∈{1,…,m}.e'(s_k + t_k) \ge v_k\quad \forall k \in \{1,\dots,m\},\qquad s_{k,i} + t_{k,j} \le (u_k' a_j)\, q_i\quad \forall (i,j) \in \{1,\dots,N\}^2,\ \forall k \in \{1,\dots,m\}.e′(sk​+tk​)≥vk​∀k∈{1,…,m},sk,i​+tk,j​≤(uk′​aj​)qi​∀(i,j)∈{1,…,N}2, ∀k∈{1,…,m}.

Containment of the permutohull in each half-space is a minimization over doubly stochastic matrices, and the displayed system is its dual (an assignment problem and its dual). This turns the containment constraint of Theorem 4.5 into the linear constraints of (15).

Formalization Note The vector qqq is arbitrary in RN\mathbb R^NRN, with no sign or ordering condition: the linear program (15) applies this equivalence at q=λq^+(1−λ)eNq = \lambda\hat q + (1-\lambda) e_Nq=λq^​+(1−λ)eN​, which may have negative entries. Indices are 000-based in Lean. For m=0m = 0m=0 both sides hold trivially.

Preamble
import Mathlib
import Definitions.Def_RiskUncSets_InnerApprox_Setting
noncomputable section
Formal statement
namespace RiskUncSets.InnerApprox

/-- Proof of Theorem 4.5: `Π_q(𝒜) ⊆ 𝒰` iff there are `s_k, t_k ∈ ℝᴺ` with
`e′(s_k + t_k) ≥ v_k` and `s_{k,i} + t_{k,j} ≤ (u_k′ a_j) q_i`; for every `q ∈ ℝᴺ`. -/
theorem permutohull_subset_polytope_iff {N n m : ℕ} (q : Fin N → ℝ)
    (a : Fin N → Fin n → ℝ) (u : Fin m → Fin n → ℝ) (v : Fin m → ℝ) :
    permutohull q a ⊆ polytope u v ↔
      ∃ s t : Fin m → Fin N → ℝ, (∀ k, v k ≤ ∑ i, (s k i + t k i)) ∧
        ∀ k i j, s k i + t k j ≤ (u k ⬝ᵥ a j) * q i := by sorry

end RiskUncSets.InnerApprox
Source
Bertsimas & Brown, Constructing uncertainty sets for robust linear optimization, Oper. Res. 57(6) (2009), p. 1493, proof of Theorem 4.5
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