Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7, p. 14 — an (s,t) cutset of G* has finite capacity iff I = T − {t} is an initial set

Proved
LawlerWCT.RhoMax.finite_cut_iff_initialSet

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, let wjw_jwj​ be real weights, and let G∗G^*G∗ be the network obtained by adding a source sss and a sink ttt, with 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​) and cij=+∞c_{ij}=+\inftycij​=+∞ on the arcs of GGG. Let (S,T)(S,T)(S,T) be an (s,t)(s,t)(s,t) cutset of G∗G^*G∗, i.e. a partition of the nodes of G∗G^*G∗ with s∈Ss\in Ss∈S and t∈Tt\in Tt∈T, and let I=T−{t}I=T-\{t\}I=T−{t}. Then

c(S,T)<+∞  ⟺  I is an initial set of N.c(S,T)<+\infty \iff I \text{ is an initial set of } N .c(S,T)<+∞⟺I is an initial set of N.

Since T↦T−{t}T\mapsto T-\{t\}T↦T−{t} is injective, this is the one-to-one correspondence between finite-capacity cutsets of G∗G^*G∗ and initial sets of GGG on which the minimum-cut method for maximum-weight initial sets rests.

Formalization Note. Initial sets are closed under predecessors along directed paths (Definition 2), while the cut only sees arcs; the hypothesis that every arc of GGG joins two jobs of NNN makes the two notions agree. A cutset is encoded by its sink side T⊆{s,t}∪NT\subseteq\{s,t\}\cup NT⊆{s,t}∪N with t∈Tt\in Tt∈T, s∉Ts\notin Ts∈/T; an infinite capacity is ⊤\top⊤ in WithTop ℝ.

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

theorem finite_cut_iff_initialSet {ι : 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) :
    cutCapacity N G w T < ⊤ ↔ LawlerWCT.SeriesPar.IsInitialSet G N (jobsOf N T) := 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. 14, §7, paragraph "There is a one-to-one correspondence between initial sets of G and finite-capacity cutsets of G*"
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