Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.2, p. 1493 — for q̃ = λq + (1 − λ)e_N and λ ≠ 0, ‖a − â‖_{q̃,𝒜} = (1/|λ|)‖a − â‖_{q,𝒜}

Proved
RiskUncSets.InnerApprox.lemma_4_2

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

gaugep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1permutohullrobust-optimization

Let N≥1N \ge 1N≥1, let q∈Δ^symNq \in \hat\Delta^N_{\mathrm{sym}}q∈Δ^symN​ be a centrally symmetric generator, let A={a1,…,aN}⊂Rn\mathcal A = \{a_1,\dots,a_N\} \subset \mathbb R^nA={a1​,…,aN​}⊂Rn have sample mean a^\hat aa^, and let λ∈R\lambda \in \mathbb Rλ∈R with λ≠0\lambda \ne 0λ=0. Then the vector q~=λq+(1−λ)eN\tilde q = \lambda q + (1-\lambda) e_Nq~​=λq+(1−λ)eN​ satisfies

∥a−a^∥q~,A=1∣λ∣ ∥a−a^∥q,Afor all a∈Rn,\|a - \hat a\|_{\tilde q,\mathcal A} = \frac{1}{|\lambda|}\,\|a - \hat a\|_{q,\mathcal A}\qquad\text{for all } a \in \mathbb R^n,∥a−a^∥q~​,A​=∣λ∣1​∥a−a^∥q,A​for all a∈Rn,

where ∥⋅∥q,A\|\cdot\|_{q,\mathcal A}∥⋅∥q,A​ is the Minkowski functional (12) of π~q(A)=Πq(A)−a^\tilde\pi_q(\mathcal A) = \Pi_q(\mathcal A) - \hat aπ~q​(A)=Πq​(A)−a^.

So, in the norm of a fixed centrally symmetric generator, mixing with eNe_NeN​ shrinks or enlarges the unit ball by exactly the factor ∣λ∣|\lambda|∣λ∣; maximizing λ\lambdaλ therefore maximizes the inner approximation in Theorem 4.5.

Formalization Note The statement is written for w=a−a^w = a - \hat aw=a−a^ ranging over Rn\mathbb R^nRn. Two corrections to the printed (13) are made and disclosed: the right-hand side uses qqq, not q~\tilde qq~​ (the page prints q~\tilde qq~​ on both sides, which would make the identity false for ∣λ∣≠1|\lambda| \ne 1∣λ∣=1), and λ≠0\lambda \ne 0λ=0 is assumed because the right-hand side contains 1/∣λ∣1/|\lambda|1/∣λ∣. When Πq(A)\Pi_q(\mathcal A)Πq​(A) has empty interior the page's two sides are both +∞+\infty+∞ off a^\hat aa^; with Mathlib's gauge both are the junk value 000 there, so the identity remains consistent.

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

/-- Lemma 4.2, (13): `‖a − â‖_{q̃,𝒜} = (1/|λ|) ‖a − â‖_{q,𝒜}` for `q̃ = λq + (1−λ)e_N`,
`q ∈ Δ̂ᴺ_sym`, `λ ≠ 0`. -/
theorem lemma_4_2 {N n : ℕ} (hN : 0 < N) (q : Fin N → ℝ)
    (hq : q ∈ symRestrictedSimplex N) (a : Fin N → Fin n → ℝ)
    (lam : ℝ) (hlam : lam ≠ 0) :
    ∀ w : Fin n → ℝ, normQ (mix q lam) a w = (1 / |lam|) * normQ q a w := by sorry

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