Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8.2.5 — the incidence matrix of a bipartite graph is totally unimodular

Proved
MatousekLP.Integrality.incidenceMatrix_totallyUnimodular

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

bipartite-graphgraph-theoryp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1total-unimodularity

Let G=(X ∪˙ Y,E)G = (X \,\dot\cup\, Y, E)G=(X∪˙Y,E) be a finite bipartite graph and let AAA be its vertex–edge incidence matrix, with ave=1a_{ve} = 1ave​=1 if v∈ev \in ev∈e and ave=0a_{ve} = 0ave​=0 otherwise. Then

A is totally unimodular,A \text{ is totally unimodular,}A is totally unimodular,

that is, every square submatrix of AAA has determinant 000, 111 or −1-1−1.

Together with Lemma 8.2.4 this shows that the matching and vertex-cover integer programs of a bipartite graph have the same optima as their LP relaxations, which is the link between total unimodularity and König's theorem.

Formalization Note Rows are indexed by the vertex type and columns by the edge set of GGG; bipartiteness is the existence of some bipartition IsBipartite G.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_Integrality_BipartiteGraph
import Definitions.Def_MatousekLP_Integrality_IncidenceMatrix
Formal statement
namespace MatousekLP.Integrality

theorem incidenceMatrix_totallyUnimodular {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) (hG : IsBipartite G) :
    (incidenceMatrix G).IsTotallyUnimodular := by sorry

end MatousekLP.Integrality
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 146, Lemma 8.2.5
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