Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1, Step 3, first bracket, p. 34 — lines containing all the zeros are at least the maximal number of independent zeros

Proved
MunkresAlg.Assignment.lines_ge_independent

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

assignment-problemindependent-zeroskonigp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let BBB be a real n×nn\times nn×n matrix, and let RRR be a set of rows and CCC a set of columns such that every zero entry of BBB lies in a row of RRR or a column of CCC. Then, with ν(B)\nu(B)ν(B) the maximal number of independent zeros of BBB,

ν(B)≤∣R∣+∣C∣.\nu(B)\le |R|+|C| .ν(B)≤∣R∣+∣C∣.

Any set of lines containing all the zeros of a matrix has at least as many lines as the maximal number of independent zeros.

This is the easy half of König's theorem in matrix form; it is the step that turns the count "covered lines = starred zeros" at Step 3 into the optimality of both.

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

/-- §1, Step 3, first bracket, p. 34: any set of lines containing all the zeros of a matrix has
at least as many lines as the maximal number of independent zeros. -/
theorem lines_ge_independent {n : ℕ} (B : Matrix (Fin n) (Fin n) ℝ) (R C : Finset (Fin n))
    (hcov : CoversZeros B R C) :
    maxIndepZeros B ≤ R.card + C.card := by sorry

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