Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim in the proof of Theorem 5.8.1 — a cycle of the simplex method stays at one basic feasible solution

Proved
MatousekLP.Simplex.cycle_same_bfs

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

linear-programmingp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1simplex-method

Let AAA be a real m×nm\times nm×n matrix of rank mmm with n≥mn\ge mn≥m, b∈Rmb\in\mathbb{R}^mb∈Rm, c∈Rnc\in\mathbb{R}^nc∈Rn. Suppose the simplex method, with any pivot rule, cycles: there are bases

B0→B1→⋯→Bk=B0,k≥1,B_0\to B_1\to\dots\to B_k=B_0,\qquad k\ge1,B0​→B1​→⋯→Bk​=B0​,k≥1,

where each Bt+1B_{t+1}Bt+1​ arises from the feasible basis BtB_tBt​ by a pivot step (an entering variable with positive coefficient in the last row of T(Bt)T(B_t)T(Bt​) and a leaving variable satisfying the ratio rule (5.3)). Call a variable fickle if it enters the basis at some step of the cycle. Then there is a single feasible solution xxx that is the basic feasible solution of every BtB_tBt​, 0≤t≤k0\le t\le k0≤t≤k, and xj=0x_j=0xj​=0 for every fickle variable xjx_jxj​.

This is the first step of the proof that Bland's rule prevents cycling: it reduces a cycle to a sequence of degenerate pivots at one vertex.

Formalization Note Indices are 0-based. The cycle is a function t↦Btt\mapsto B_tt↦Bt​ on {0,…,k}\{0,\dots,k\}{0,…,k}; a fickle variable is an index j∈Bt+1∖Btj\in B_{t+1}\setminus B_tj∈Bt+1​∖Bt​ for some t<kt<kt<k. The standing assumption of §4.2 is a hypothesis.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_Simplex_Tableau
open Matrix Filter
Formal statement
namespace MatousekLP.Simplex

/-- Claim in the proof of Theorem 5.8.1 (p. 73), valid for any pivot rule. Suppose the simplex
method cycles: `B₀, B₁, …, B_k = B₀` (`k ≥ 1`) with each `B_{t+1}` obtained from `B_t` by a pivot
step. Then all bases of the cycle yield the same basic feasible solution `x`, and every fickle
variable (one that enters the basis at some step of the cycle) is `0` in `x`.
Standing assumption of §4.2 (p. 44): `n ≥ m` and `A` has rank `m`. -/
theorem cycle_same_bfs {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (c : Fin n → ℝ) (hmn : m ≤ n) (hrank : A.rank = m) (k : ℕ) (hk : 1 ≤ k)
    (Bs : ℕ → Finset (Fin n)) (hstep : ∀ t, t < k → SimplexStep A b c (Bs t) (Bs (t + 1)))
    (hcycle : Bs k = Bs 0) :
    ∃ x : Fin n → ℝ, MatousekLP.BFS.IsFeasible A b x ∧
      (∀ t, t ≤ k → IsBasicSolutionFor A b (Bs t) x) ∧
      ∀ t, t < k → ∀ j, j ∈ Bs (t + 1) → j ∉ Bs t → x j = 0 := by sorry

end MatousekLP.Simplex
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 73, Claim in the proof of Theorem 5.8.1
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