Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10, PDF p. 29 — Algorithm 𝒜 executes at most 2√m iterations

Proved
AffinePolicies.SqrtBound.lemma_10

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⊆Rm\mathcal U\subseteq\mathbb R^mU⊆Rm, let μj=max⁡{bj:b∈U}\mu_j=\max\{b_j:b\in\mathcal U\}μj​=max{bj​:b∈U} and assume μj>0\mu_j>0μj​>0 for every jjj. If iterations 1,…,K1,\dots,K1,…,K of Algorithm A\mathcal AA are executed (each with the loop test satisfied and a maximizing choice uk∈Uu^k\in\mathcal Uuk∈U), then

K≤2m.K\le 2\sqrt m .K≤2m​.

In particular the number of iterations KKK of a complete run is at most 2m2\sqrt m2m​, and the algorithm terminates. The bound is used in the proof of Theorem 4 to show that 2m/K≥12\sqrt m/K\ge12m​/K≥1.

Formalization Note The statement is made for every executed prefix of iterations, without the stopping test; this is stronger than the paper's statement about the number of iterations of a finished run, and it is what yields termination. Nonnegativity, convexity and compactness 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_10 {m : ℕ} (U : Set (Fin m → ℝ))
    (μ : Fin m → ℝ) (hμ : ∀ j, IsGreatest ((fun b : Fin m → ℝ => b j) '' U) (μ j))
    (hμpos : ∀ j, 0 < μ j)
    (K : ℕ) (u : ℕ → Fin m → ℝ) (hiter : ∀ k < K, IsIteration U μ u k) :
    (K : ℝ) ≤ 2 * Real.sqrt m := 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 10, PDF p. 29
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