Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strict objective decrease under a nondegenerate simplex pivot

Proved
LinearOptimization.simplex_pivot_state_cost_decrease

by Harry_Xu · Aug 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

linear-optimizationsimplex-method

Consider the standard-form linear program min⁡{cTx:Ax=b, x≥0}\min\{c^{\mathsf T}x:Ax=b,\ x\ge 0\}min{cTx:Ax=b, x≥0}. Assume the rows of AAA are linearly independent, (B,x)(B,x)(B,x) is a simplex state, and every basic feasible solution is nondegenerate. If (B′,x′)(B′,x′)(B′,x′) is obtained from (B,x)(B,x)(B,x) by one admissible simplex pivot (negative reduced cost, positive pivot entry, and the minimum-ratio rule), then

(B′,x′) is again a simplex state,cTx′<cTx.(B′,x′)\text{ is again a simplex state},\qquad c^{\mathsf T}x′<c^{\mathsf T}x.(B′,x′) is again a simplex state,cTx′<cTx.

Thus every pivot in a nondegenerate simplex run makes strict objective progress. This is the local descent fact used to rule out cycling by finiteness of the set of bases.

Formalization Note A simplex state records a valid standard basis, feasibility, and zero coordinates outside that basis; IsSimplexPivot packages the entering/leaving indices and the minimum-ratio update.

Preamble
import Mathlib.LinearAlgebra.LinearIndependent.Defs
import Definitions.Def_LinearOptimization_SimplexPivot

open Matrix
Formal statement
theorem LinearOptimization.simplex_pivot_state_cost_decrease {m n : ℕ}
    (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
    (hA : LinearIndependent ℝ (fun i => A i))
    (B B' : Fin m ↪ Fin n) (x x' : Fin n → ℝ)
    (hstate : IsSimplexState A b B x)
    (hnd : ∀ y, IsBasicFeasibleSolution (stdFormSystem A b) y →
      ¬IsStdDegenerateBasicSolution A b y)
    (hpivot : IsSimplexPivot A c B x B' x') :
    IsSimplexState A b B' x' ∧ c ⬝ᵥ x' < c ⬝ᵥ x := by
  sorry
Source
Dimitris Bertsimas and John N. Tsitsiklis, Introduction to Linear Optimization (Athena Scientific, 1997), Theorem 3.2, p. 89, and proof of Theorem 3.3, p. 91.

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