Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1, finiteness paragraph, p. 35 — after at most n applications of Step 3 the maximal number of independent zeros increases

Proved
MunkresAlg.Assignment.step3_count_le_n

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

assignment-problemp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1termination

Let AAA be a real n×nn\times nn×n matrix and let s(0),s(1),…,s(L)s^{(0)},s^{(1)},\dots,s^{(L)}s(0),s(1),…,s(L) be a finite piece of a run of Munkres' algorithm (each state is obtained from the previous one by a move) whose first state is reachable from AAA. Let mmm be a natural number, and suppose that at every state s(ℓ)s^{(\ell)}s(ℓ) of the piece that is at Step 3, the maximal number of independent zeros of its matrix equals mmm. Then

#{ℓ:s(ℓ) is at Step 3}≤n.\#\{\ell : s^{(\ell)} \text{ is at Step 3}\}\le n .#{ℓ:s(ℓ) is at Step 3}≤n.

In the paper's words: after at most nnn applications of Step 3, the maximal number of (independent) zeros in the matrix must be increased.

Combined with the monotonicity nk+1≥nkn_{k+1}\ge n_knk+1​≥nk​ and the bound nk≤nn_k\le nnk​≤n, this gives the finiteness of the algorithm for real matrices, without the integrality assumption of p. 32.

Preamble
import Mathlib
import Definitions.Def_MunkresAlg_Assignment_Basic
import Definitions.Def_MunkresAlg_Assignment_Algorithm
Formal statement
namespace MunkresAlg.Assignment

/-- §1, finiteness paragraph, p. 35: along any finite piece of a run starting at a reachable
state, if the maximal number of independent zeros is the same value `m` at every Step 3 state of
the piece, then Step 3 is applied at most `n` times in it. -/
theorem step3_count_le_n {n : ℕ} (A : Matrix (Fin n) (Fin n) ℝ) (ss : List (State n))
    (hchain : List.IsChain Step ss) (hhead : ∀ s ∈ ss.head?, Reachable A s) (m : ℕ)
    (hm : ∀ s ∈ ss, s.phase = Phase.step3 → maxIndepZeros s.A = m) :
    (ss.filter (fun s => s.phase = Phase.step3)).length ≤ n := by sorry

end MunkresAlg.Assignment
Source
Munkres, Algorithms for the assignment and transportation problems, J. SIAM 5 (1957), p. 35, §1, finiteness paragraph
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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