Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7, p. 15 — a minimum capacity (s,t) cutset of G* yields a maximum weight initial set

Proved
LawlerWCT.RhoMax.min_cut_max_weight

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

closure-probleminitial-setsminimum-cutnetwork-flowsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G=(N,A)G=(N,A)G=(N,A) be a digraph on a finite job set NNN with real weights wjw_jwj​ of either sign, and let G∗G^*G∗ be the network of §7 (capacities csj=max⁡(0,−wj)c_{sj}=\max(0,-w_j)csj​=max(0,−wj​), cjt=max⁡(0,wj)c_{jt}=\max(0,w_j)cjt​=max(0,wj​), cij=+∞c_{ij}=+\inftycij​=+∞ on the arcs of GGG). If (S,T)(S,T)(S,T) is an (s,t)(s,t)(s,t) cutset of minimum capacity among all (s,t)(s,t)(s,t) cutsets of G∗G^*G∗, then I=T−{t}I=T-\{t\}I=T−{t} is an initial set of NNN and

∑j∈I′wj≤∑j∈Iwjfor every initial set I′ of N.\sum_{j\in I'}w_j\le\sum_{j\in I}w_j\qquad\text{for every initial set } I' \text{ of } N .j∈I′∑​wj​≤j∈I∑​wj​for every initial set I′ of N.

This turns the search for an initial set of maximum total weight, with weights of either sign, into a minimum-cut computation; it is the subroutine every trial value of the ratio uses.

Formalization Note. The maximum ranges over all initial sets, the empty one included (weight 000); this is what a minimum cut delivers, because the cutset with T={t}T=\{t\}T={t} is finite.

Preamble
import Mathlib
import Definitions.Def_LawlerWCT_RhoMax_Model
Formal statement
namespace LawlerWCT.RhoMax

theorem min_cut_max_weight {ι : Type*} [DecidableEq ι] (N : Finset ι)
    (G : ι → ι → Prop) (hGN : ∀ i j, G i j → i ∈ N ∧ j ∈ N) (w : ι → ℝ)
    (T : Finset (Node ι)) (hT : T ⊆ nodes N) (ht : Node.t ∈ T) (hs : Node.s ∉ T)
    (hmin : ∀ T' : Finset (Node ι), T' ⊆ nodes N → Node.t ∈ T' → Node.s ∉ T' →
      cutCapacity N G w T ≤ cutCapacity N G w T') :
    LawlerWCT.SeriesPar.IsInitialSet G N (jobsOf N T) ∧
      ∀ I, LawlerWCT.SeriesPar.IsInitialSet G N I → ∑ j ∈ I, w j ≤ ∑ j ∈ jobsOf N T, w j := by sorry

end LawlerWCT.RhoMax
Source
Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints, IRIA-LABORIA Rapport de Recherche No. 205 (Dec. 1976), HAL hal-04716371v1, p. 15, §7, sentence "It follows that a minimum capacity (s,t) cutset yields a maximum weight initial set I."
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