Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9, PDF p. 28 — after Algorithm 𝒜: Σ_{j∈J₁} b_j/μ_j ≤ √m and b_j ≤ β_j on J₂

Proved
AffinePolicies.SqrtBound.lemma_9

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

affine-policiesalgorithm-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let U⊆R+m\mathcal U\subseteq\mathbb R^m_+U⊆R+m​, let μj=max⁡{bj:b∈U}\mu_j=\max\{b_j:b\in\mathcal U\}μj​=max{bj​:b∈U} for each jjj, and consider any complete run of Algorithm A\mathcal AA with KKK iterations and choices u1,…,uKu^1,\dots,u^Ku1,…,uK, with output β=u1+⋯+uK\beta=u^1+\dots+u^Kβ=u1+⋯+uK and partition J1,J2J_1,J_2J1​,J2​. Then for every b∈Ub\in\mathcal Ub∈U,

∑j∈J1bjμj≤m,\sum_{j\in J_1}\frac{b_j}{\mu_j}\le\sqrt m,j∈J1​∑​μj​bj​​≤m​,

and bj≤βjb_j\le\beta_jbj​≤βj​ for all j∈J2j\in J_2j∈J2​.

The two properties are exactly what the affine policy of Theorem 4 needs: coordinates in J1J_1J1​ are covered by the linear part of the policy at cost m\sqrt mm​, and coordinates in J2J_2J2​ are dominated by the fixed vector β\betaβ.

Formalization Note The statement holds for every run of the algorithm (the argmax choices are not unique). J2J_2J2​ is the complement of J1J_1J1​. Positivity of μ\muμ, convexity, compactness and full-dimensionality of U\mathcal UU are not assumed.

Preamble
import Mathlib
import Definitions.Def_AffinePolicies_SqrtBound_Setting

open Matrix
Formal statement
namespace AffinePolicies.SqrtBound

theorem lemma_9 {m : ℕ} (U : Set (Fin m → ℝ)) (hUnn : ∀ b ∈ U, 0 ≤ b)
    (μ : Fin m → ℝ) (hμ : ∀ j, IsGreatest ((fun b : Fin m → ℝ => b j) '' U) (μ j))
    (K : ℕ) (u : ℕ → Fin m → ℝ) (hrun : IsRun U μ K u) :
    (∀ b ∈ U, scaledSum μ (J1 μ u K) b ≤ Real.sqrt m) ∧
      ∀ j, j ∉ J1 μ u K → ∀ b ∈ U, b j ≤ betaSum u K j := by sorry

end AffinePolicies.SqrtBound
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 9, PDF p. 28
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