Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1, Step 2, second bracket, p. 34 — after the exchange the starred zeros are independent and larger by one

Proved
MunkresAlg.Assignment.step2_starred_count

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

assignment-problemaugmenting-pathinvariantp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let AAA be a real n×nn\times nn×n matrix, let sss be a state reachable by Munkres' algorithm from AAA that is at Step 2, and let ttt be the state after the Step 2 move (unstar each starred zero of the sequence, star each primed zero of the sequence, reset the marks). Then the starred zeros of ttt form a set of independent zeros of the matrix of ttt, and

#{starred zeros of t}=#{starred zeros of s}+1.\#\{\text{starred zeros of } t\}=\#\{\text{starred zeros of } s\}+1 .#{starred zeros of t}=#{starred zeros of s}+1.

Each pass through Step 2 therefore adds one independent zero; as there can be at most nnn, Step 2 occurs at most nnn times in a run.

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

/-- §1, Step 2, second bracket, p. 34: after exchanging stars and primes along the sequence, the
starred zeros are independent zeros and there is one more of them. -/
theorem step2_starred_count {n : ℕ} (A : Matrix (Fin n) (Fin n) ℝ) (s t : State n)
    (z₀ : Fin n × Fin n) (hs : Reachable A s) (hph : s.phase = Phase.step2 z₀)
    (hst : Step s t) :
    IsIndepZeros t.A t.starred ∧ t.starred.card = s.starred.card + 1 := by sorry

end MunkresAlg.Assignment
Source
Munkres, Algorithms for the assignment and transportation problems, J. SIAM 5 (1957), p. 34, §1, Step 2, second bracket
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