Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.1 — a minimum-weight odd-splitting edge of the Gomory–Hu cut-tree defines an odd minimum cut-set

Proved
PadbergRao.OddCut.theorem_1_1

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatorial-optimizationgraph-theoryp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G=(V,E)G = (V, E)G=(V,E) be a finite undirected graph without loops and multiple edges, with edge weights ce≥0c_e \ge 0ce​≥0, whose nodes are labelled odd and even such that the set V1V_1V1​ of odd nodes is nonempty and the total label of GGG is even (∣V1∣|V_1|∣V1​∣ even). Let GT=(N,F)G_T = (N, F)GT​=(N,F) be the Gomory–Hu cut-tree of GGG for all pairs of odd nodes, with edge weights dfd_fdf​. Call a tree edge fff odd-splitting if its removal decomposes GTG_TGT​ into two subtrees of odd cardinality. Then:

  1. GTG_TGT​ has at least one odd-splitting edge; and
  2. if f∗=[r,s]f^* = [r, s]f∗=[r,s] is an odd-splitting edge of minimum weight among all odd-splitting edges, and MMM is the node set of GGG corresponding to the subtree containing rrr after removing f∗f^*f∗, then (M:V−M)(M : V - M)(M:V−M) is an odd minimum cut-set:
c(M:V−M)  =  min⁡{ c(U:V−U):U⊆V, λ(U) odd }.c(M : V - M) \;=\; \min\{\, c(U : V - U) : U \subseteq V,\ \lambda(U) \text{ odd} \,\}.c(M:V−M)=min{c(U:V−U):U⊆V, λ(U) odd}.

Thus the odd minimum cut-set problem is solved by one Gomory–Hu computation on the odd nodes, followed by a search over the edges of the tree.

Since ∣N∣=∣V1∣|N| = |V_1|∣N∣=∣V1​∣ is even, one of the two subtrees has odd cardinality exactly when the other has, so the statement checks the parity of the rrr-side subtree only.

Formalization Note The cut-tree is IsOddCutTree c odd H π (tree nodes identified with odd nodes; Gomory–Hu minimality for every tree edge); the conclusion IsOddMinCut minimizes over every node set UUU with λ(U)\lambda(U)λ(U) odd, not only over shores of tree edges. Part 1 ensures that part 2 is not vacuous.

Preamble
import Mathlib
import Definitions.Def_PadbergRao_OddCut_cutCapacity
import Definitions.Def_PadbergRao_OddCut_IsOddMinCut
import Definitions.Def_PadbergRao_OddCut_IsOddCutTree
Formal statement
namespace PadbergRao.OddCut

/-- Theorem 1.1 (Padberg–Rao 1982, p. 70). Let `G_T` be a Gomory–Hu cut-tree of `G` for the odd
nodes. (1) Some edge of `G_T` splits it into two subtrees of odd cardinality; (2) every such edge
of minimum weight among them defines an odd minimum cut-set of `G`. Since `|V₁|` is even, the
`s`-side subtree has odd cardinality iff the `r`-side one does, so one parity condition suffices. -/
theorem theorem_1_1 {V : Type*} [Fintype V] [DecidableEq V]
    (c : V → V → ℝ) (hc_symm : ∀ i j, c i j = c j i) (hc_nonneg : ∀ i j, 0 ≤ c i j)
    (odd : Finset V) (hodd_ne : odd.Nonempty) (hodd_even : Even odd.card)
    (H : SimpleGraph {v // v ∈ odd}) (π : V → {v // v ∈ odd})
    (hT : IsOddCutTree c odd H π) :
    (∃ r s : {v // v ∈ odd}, H.Adj r s ∧ Odd (subtree H r s).card) ∧
    ∀ r s : {v // v ∈ odd}, H.Adj r s → Odd (subtree H r s).card →
      (∀ r' s' : {v // v ∈ odd}, H.Adj r' s' → Odd (subtree H r' s').card →
        treeEdgeWeight c H π r s ≤ treeEdgeWeight c H π r' s') →
      IsOddMinCut c odd (shore H π r s) := by sorry

end PadbergRao.OddCut
Source
Padberg, Rao, Odd Minimum Cut-Sets and b-Matchings, Math. Oper. Res. 7 (1982), p. 70, Theorem 1.1
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

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