Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 177 — Beale's simplex method for a convex quadratic function terminates

Proved
BealeConvexMin.QuadSimplex.iteration_terminates

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-programmingsimplex-methodtermination

Consider Beale's extension of the simplex method to minimizing a convex quadratic function CCC of nonnegative variables subject to linear equations. The current state is a tableau: each restricted variable xhx_hxh​ is written as xh=ah0+∑l=1Nahlzlx_h=a_{h0}+\sum_{l=1}^{N}a_{hl}z_lxh​=ah0​+∑l=1N​ahl​zl​ in the nonbasic variables z1,…,zNz_1,\dots,z_Nz1​,…,zN​, which are restricted or free, and C=∑k,l=0NcklzkzlC=\sum_{k,l=0}^{N}c_{kl}z_kz_lC=∑k,l=0N​ckl​zk​zl​ with z0=1z_0=1z0​=1.

Let the initial tableau have

  1. a symmetric matrix (ckl)(c_{kl})(ckl​) whose quadratic block (ckl)k,l=1N(c_{kl})_{k,l=1}^{N}(ckl​)k,l=1N​ is positive semidefinite (convexity of CCC), and
  2. consistent labels (each restricted nonbasic variable in exactly one slot, with the unit row).

Then there is no infinite sequence of tableaux T0,T1,T2,…T_0,T_1,T_2,\dotsT0​,T1​,T2​,… starting at the given one such that each Tk+1T_{k+1}Tk+1​ arises from TkT_kTk​ by one step of the iteration and every basic restricted variable is strictly positive in the associated solution of every TkT_kTk​:

¬ ∃ (Tk)k≥0: T0=T,Tk→Tk+1 for all k,ah0(k)>0 for all k and all basic xh.\neg\,\exists\,(T_k)_{k\ge0}:\ T_0=T,\quad T_k\to T_{k+1}\ \text{for all }k,\quad a^{(k)}_{h0}>0\ \text{for all }k\text{ and all basic }x_h .¬∃(Tk​)k≥0​: T0​=T,Tk​→Tk+1​ for all k,ah0(k)​>0 for all k and all basic xh​.

In the paper's words, "the iteration must terminate". Every run therefore reaches a tableau from which no step is possible; what such a tableau looks like (an absolute minimum, by the optimality criterion of p. 175, or a ray along which CCC decreases indefinitely) is not part of this statement.

Formalization Note The paper keeps every ah0a_{h0}ah0​ of a basic variable positive with Charnes's ε\varepsilonε-perturbations; here this is a hypothesis on the run rather than a perturbation scheme. The problem data A,BA,BA,B enter only through the initial tableau, and phase 1 is out of scope. No bound on the number of steps is claimed, as in the paper.

Preamble
import Mathlib
import Definitions.Def_BealeConvexMin_QuadSimplex_pivotC
import Definitions.Def_BealeConvexMin_QuadSimplex_Tableau
import Definitions.Def_BealeConvexMin_QuadSimplex_BealeStep
Formal statement
namespace BealeConvexMin.QuadSimplex

/-- Beale (1955), §3, p. 177: the iteration for a convex quadratic `C` terminates. From an initial
tableau with symmetric `(c_kl)`, positive semidefinite quadratic block (convex `C`) and consistent
labels, there is no infinite run `T 0 → T 1 → ⋯` of steps along which every basic restricted
variable stays strictly positive in the associated solution (the ε-perturbation device of p. 174,
stated as a hypothesis on the run). -/
theorem iteration_terminates {n N : ℕ} (T₀ : Tableau n N) (hsymm : T₀.c.IsSymm)
    (hpsd : (T₀.c.submatrix Fin.succ Fin.succ).PosSemidef) (hlab : LabelsConsistent T₀) :
    ¬ ∃ T : ℕ → Tableau n N, T 0 = T₀ ∧ (∀ k, BealeStep (T k) (T (k + 1))) ∧
      ∀ k, BasicPositive (T k) := by sorry

end BealeConvexMin.QuadSimplex
Source
Beale, On Minimizing a Convex Function Subject to Linear Inequalities, J. R. Statist. Soc. B 17(2), 1955, https://doi.org/10.1111/j.2517-6161.1955.tb00191.x, p. 177 (PDF p. 5), §3, paragraphs after Lemma 2 (announced on p. 175)
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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