Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 1, p. 70 — a minimum-weight cut-tree edge gives a minimum cut-set for all pairs of odd nodes

Proved
PadbergRao.OddCut.min_tree_edge_min_odd_pair_cut

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 with edge weights ce≥0c_e \ge 0ce​≥0, and let V1V_1V1​ be a nonempty set of odd-labelled nodes with ∣V1∣|V_1|∣V1​∣ even. Let GT=(N,F)G_T = (N, F)GT​=(N,F) be a Gomory–Hu cut-tree of GGG for the odd nodes, with edge weights dfd_fdf​. Let f∗=[r,s]∈Ff^* = [r, s] \in Ff∗=[r,s]∈F be an edge of minimum weight,

df∗  =  min⁡{ df:f∈F },d_{f^*} \;=\; \min\{\, d_f : f \in F \,\},df∗​=min{df​:f∈F},

and let MMM be the node set of GGG corresponding to the subtree containing rrr after f∗f^*f∗ is removed. Then (M:V−M)(M : V - M)(M:V−M) is a minimum cut-set with respect to all pairs of odd nodes in GGG.

The minimum is taken over all tree edges, with no parity condition. This is the bridge that lets Lemma 1.1 be applied to the cut-tree.

Formalization Note The cut-tree is IsOddCutTree c odd H π; MMM is shore H π r s and dfd_fdf​ is treeEdgeWeight. Minimality of f∗f^*f∗ is stated against every ordered adjacent pair r' s'.

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

/-- Section 1, p. 70 (Padberg–Rao 1982). Removing a minimum-weight edge `f* = [r, s]` of the
cut-tree `G_T` (minimum over all tree edges) yields a set `M` such that `(M : V − M)` is a
minimum cut-set with respect to all pairs of odd nodes of `G`. -/
theorem min_tree_edge_min_odd_pair_cut {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}) (hrs : H.Adj r s)
    (hmin : ∀ r' s' : {v // v ∈ odd}, H.Adj r' s' →
      treeEdgeWeight c H π r s ≤ treeEdgeWeight c H π r' s') :
    IsMinOddPairCut 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, Section 1 (unnumbered claim before 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