Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8, PDF p. 20 — there is an optimal affine solution with P̂_ij = μ (i ≠ j), P̂_jj = θ, q̂_j = λ

Proved
AffinePolicies.LargeGap.lemma_8

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

affine-policiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationsymmetry

Let m≥1m\ge 1m≥1, δ∈R\delta\in\mathbb Rδ∈R, and consider the instance (19). There exists an optimal affine solution (x,y^)(x,\hat y)(x,y^​),

y^(b)=P^b+q^(b∈U),\hat y(b)=\hat Pb+\hat q\qquad(b\in\mathcal U),y^​(b)=P^b+q^​(b∈U),

and real numbers μ,θ,λ\mu,\theta,\lambdaμ,θ,λ such that

  1. P^ij=μ\hat P_{ij}=\muP^ij​=μ for all i≠ji\ne ji=j and P^jj=θ\hat P_{jj}=\thetaP^jj​=θ for all j=1,…,mj=1,\dots,mj=1,…,m;
  2. q^j=λ\hat q_j=\lambdaq^​j​=λ for all j=1,…,mj=1,\dots,mj=1,…,m.

The lemma reduces the analysis of the best affine policy on this instance to three scalar parameters, which the proof of Theorem 3 then bounds.

Formalization Note The existence of an optimal affine solution (attainment of the minimum) is part of the conclusion, as on the page. The hypothesis m≥1m\ge1m≥1 excludes the empty instance; the threshold (18) is not needed.

Preamble
import Mathlib
import Definitions.Def_AffinePolicies_LargeGap_Setting
Formal statement
namespace AffinePolicies.LargeGap

theorem lemma_8 (δ : ℝ) (m : ℕ) (hm0 : 0 < m) :
    ∃ (x : Fin m → ℝ) (P : Matrix (Fin m) (Fin m) ℝ) (q : Fin m → ℝ) (μ θ lam : ℝ),
      AffinePolicies.Simplex.IsOptimalAff (A19 m) (B19 m δ) (c19 m) (d19 m) (U19 m δ) x P q ∧
        (∀ i j, i ≠ j → P i j = μ) ∧ (∀ j, P j j = θ) ∧ (∀ j, q j = lam) := by sorry

end AffinePolicies.LargeGap
Source
Bertsimas & Goyal, On the power and limitations of affine policies in two-stage adaptive optimization, Math. Program. Ser. A, DOI 10.1007/s10107-011-0444-4, Lemma 8, PDF p. 20
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