Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A lexicographic simplex pivot preserves positive rows and increases the zeroth row

Proved
LinearOptimization.simplex_lexicographic_pivot_step

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

linear-optimizationsimplex-method

Consider one iteration of the simplex method for the standard-form problem min⁡cTx\min c^{\mathsf T}xmincTx subject to Ax=bAx=bAx=b and x≥0x\ge 0x≥0. Let BBB be the current basis, let every nonzeroth row of its tableau

[ B−1b∣B−1A ]\left[\,B^{-1}b\mid B^{-1}A\,\right][B−1b∣B−1A]

be lexicographically positive, and perform a pivot according to the lexicographic pivoting rule, producing the new basis B′B'B′.

Then every nonzeroth row of the new tableau is lexicographically positive, and the new zeroth row

[ −cB′T(B′)−1b∣cT−cB′T(B′)−1A ]\left[\,-c_{B'}^{\mathsf T}(B')^{-1}b\mid c^{\mathsf T}-c_{B'}^{\mathsf T}(B')^{-1}A\,\right][−cB′T​(B′)−1b∣cT−cB′T​(B′)−1A]

is strictly lexicographically larger than the old zeroth row.

This is the one-iteration invariant underlying lexicographic anticycling; iterating it and using the finiteness of the set of bases yields finite termination.

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

open Matrix
Formal statement
theorem LinearOptimization.simplex_lexicographic_pivot_step {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)
    (hpos : ∀ i, LexPos (tableauRow A b B i))
    (hpivot : IsLexicographicPivot A b c B x B' x') :
    (∀ i, LexPos (tableauRow A b B' i)) ∧
      LexLt (tableauZerothRow A b c B) (tableauZerothRow A b c B') := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 3.4(a,b), p. 110, especially Eq. (3.5). https://studylib.net/doc/28617911/bertsimas-linear-cap-1-a-5

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