Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3, proof, third Claim, PDF p. 24 — −1/m^{1+δ/2} ≤ μ < 0

Proved
AffinePolicies.LargeGap.claim_mu_bounds

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

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

Let δ>0\delta>0δ>0 and mδ>200m^\delta>200mδ>200, and consider the instance (19). Let μ,θ,λ∈R\mu,\theta,\lambda\in\mathbb Rμ,θ,λ∈R, let P^\hat PP^ have diagonal entries θ\thetaθ and off-diagonal entries μ\muμ, and let q^=λe\hat q=\lambda eq^​=λe. If for some first-stage xxx the affine policy y^(b)=P^b+q^\hat y(b)=\hat Pb+\hat qy^​(b)=P^b+q^​ is feasible and

max⁡b∈Ud⊤(P^b+q^)≤m1/2−δ4(27),\max_{b\in\mathcal U} d^\top(\hat Pb+\hat q)\le\frac{m^{1/2-\delta}}{4}\qquad\text{(27)},b∈Umax​d⊤(P^b+q^​)≤4m1/2−δ​(27),

then

−1m1+δ/2≤μ<0.-\frac{1}{m^{1+\delta/2}}\le\mu<0 .−m1+δ/21​≤μ<0.

This is the third parameter bound in the proof by contradiction of Theorem 3; combined with the first two, it forces the cost at bm+1=e/mb^{m+1}=e/\sqrt mbm+1=e/m​ above m/4\sqrt m/4m​/4.

Formalization Note As for the other Claims, the statement covers every symmetric feasible affine policy satisfying (27); the hypotheses are jointly unsatisfiable by Theorem 3, as is inherent in a step of a proof by contradiction.

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

theorem claim_mu_bounds (δ : ℝ) (hδ : 0 < δ) (m : ℕ) (hm : 200 < (m : ℝ) ^ δ)
    (x : Fin m → ℝ) (μ θ lam : ℝ)
    (hfeas : AffinePolicies.Simplex.Feasible (A19 m) (B19 m δ) (U19 m δ) x
      (AffinePolicies.Simplex.affinePolicy (fun i j => if i = j then θ else μ) (fun _ => lam)))
    (hcost : AffinePolicies.Simplex.CostLE (c19 m) (d19 m) (U19 m δ) x
      (AffinePolicies.Simplex.affinePolicy (fun i j => if i = j then θ else μ) (fun _ => lam))
      ((m : ℝ) ^ ((1 : ℝ) / 2 - δ) / 4)) :
    -(1 / (m : ℝ) ^ (1 + δ / 2)) ≤ μ ∧ μ < 0 := 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, Theorem 3, proof, third Claim, PDF p. 24–25
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