Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4, (48)–(55), PDF pp. 30–31 — the affine solution x̃ = 3√m x*, ỹ(b) is feasible

Proved
AffinePolicies.SqrtBound.constructed_feasible

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

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

Assume A≥0A\ge0A≥0 and U⊆R+m\mathcal U\subseteq\mathbb R^m_+U⊆R+m​. Let μj=max⁡{bj:b∈U}>0\mu_j=\max\{b_j:b\in\mathcal U\}>0μj​=max{bj​:b∈U}>0, let βj∈U\beta^j\in\mathcal Uβj∈U satisfy βjj=μj\beta^j_j=\mu_jβjj​=μj​, and take any complete run of Algorithm A\mathcal AA with KKK iterations, choices u1,…,uKu^1,\dots,u^Ku1,…,uK and final index set J1J_1J1​. Let (x∗,y∗)(x^*,y^*)(x∗,y∗) be any feasible solution of ΠAdapt(U)\Pi_{Adapt}(\mathcal U)ΠAdapt​(U). Define

y^=2mK∑k=1Ky∗(uk),x~=3m x∗,y~(b)=∑j∈J11μj y∗(βj) bj+y^.\hat y=\frac{2\sqrt m}{K}\sum_{k=1}^K y^*(u^k),\qquad \tilde x=3\sqrt m\,x^*,\qquad \tilde y(b)=\sum_{j\in J_1}\frac{1}{\mu_j}\,y^*(\beta^j)\,b_j+\hat y .y^​=K2m​​k=1∑K​y∗(uk),x~=3m​x∗,y~​(b)=j∈J1​∑​μj​1​y∗(βj)bj​+y^​.

Then (x~,y~)(\tilde x,\tilde y)(x~,y~​) is feasible for ΠAdapt(U)\Pi_{Adapt}(\mathcal U)ΠAdapt​(U): x~≥0\tilde x\ge0x~≥0 and, for every b∈Ub\in\mathcal Ub∈U, y~(b)≥0\tilde y(b)\ge0y~​(b)≥0 and Ax~+By~(b)≥bA\tilde x+B\tilde y(b)\ge bAx~+By~​(b)≥b.

This is the first half of the proof of Theorem 4; y~\tilde yy~​ is an affine policy.

Formalization Note The paper starts from an optimal (x∗,y∗)(x^*,y^*)(x∗,y∗); the statement is made for every feasible one, which is stronger and avoids assuming that an optimum is attained. When K=0K=0K=0, y^=0\hat y=0y^​=0 (the empty sum). Only A≥0A\ge0A≥0 and U⊆R+m\mathcal U\subseteq\mathbb R^m_+U⊆R+m​ of the standing assumptions are used; μ>0\mu>0μ>0 is assumed (it follows from full-dimensionality, see the milestone on (38)).

Preamble
import Mathlib
import Definitions.Def_AffinePolicies_SqrtBound_Setting

open Matrix
Formal statement
namespace AffinePolicies.SqrtBound

theorem constructed_feasible {m n₁ n₂ : ℕ} (A : Matrix (Fin m) (Fin n₁) ℝ)
    (B : Matrix (Fin m) (Fin n₂) ℝ) (U : Set (Fin m → ℝ))
    (hA : ∀ i j, 0 ≤ A i j) (hUnn : ∀ b ∈ U, 0 ≤ b)
    (μ : Fin m → ℝ) (hμ : ∀ j, IsGreatest ((fun b : Fin m → ℝ => b j) '' U) (μ j))
    (hμpos : ∀ j, 0 < μ j)
    (bstar : Fin m → Fin m → ℝ) (hbstar : ∀ j, bstar j ∈ U ∧ bstar j j = μ j)
    (K : ℕ) (u : ℕ → Fin m → ℝ) (hrun : IsRun U μ K u)
    (xs : Fin n₁ → ℝ) (ys : (Fin m → ℝ) → Fin n₂ → ℝ) (hfs : AffinePolicies.Simplex.Feasible A B U xs ys) :
    AffinePolicies.Simplex.Feasible A B U ((3 * Real.sqrt m) • xs)
      (AffinePolicies.Simplex.affinePolicy (thmPolicyP ys bstar μ (J1 μ u K)) (thmPolicyq ys u K)) := 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, Proof of Theorem 4, (48)–(55), PDF pp. 30–31
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