Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(36), p. 30 — c(E_J) = Σⱼ wⱼCⱼ − Σⱼ wⱼpⱼ + c(E_cut) for every partition of J into m machines

Proved
SkutellaCQP.MaxCut.eq_36

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

identical-machinesmax-k-cutp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reductionscheduling

Consider nnn jobs with processing times pj>0p_j>0pj​>0 and weights wj≥0w_j\ge0wj​≥0 on m≥1m\ge1m≥1 identical parallel machines, Smith's order ≺\prec≺, and the weighted complete graph GJG_JGJ​ with c(jk)=wjpkc(jk)=w_jp_kc(jk)=wj​pk​ for k≺jk\prec jk≺j. Let σ\sigmaσ be any assignment of the jobs to the machines (a partition J1,…,JmJ_1,\dots,J_mJ1​,…,Jm​), let CjC_jCj​ be the completion times of the schedule that sequences each machine by ≺\prec≺, and let EcutE_{\mathrm{cut}}Ecut​ be the mmm-cut induced by the partition. Then

c(EJ)=∑jwjCj−∑jwjpj+c(Ecut).c(E_J)=\sum_j w_jC_j-\sum_j w_jp_j+c(E_{\mathrm{cut}}).c(EJ​)=j∑​wj​Cj​−j∑​wj​pj​+c(Ecut​).

The value of a schedule is the weight of the edges inside the parts plus the constant ∑jwjpj\sum_j w_jp_j∑j​wj​pj​. Since c(EJ)c(E_J)c(EJ​) and ∑jwjpj\sum_jw_jp_j∑j​wj​pj​ do not depend on σ\sigmaσ, minimizing ∑jwjCj\sum_jw_jC_j∑j​wj​Cj​ is the same as maximizing the weight of the induced mmm-cut; this is the reduction of Pm ∣ ∣∑wjCjPm\,|\,|\sum w_jC_jPm∣∣∑wj​Cj​ to Max-mmm-Cut.

Formalization Note The identity holds for any real data; the standing hypotheses p>0p>0p>0, w≥0w\ge0w≥0, m>0m>0m>0 are kept for uniformity with the other statements of the mission.

Preamble
import Mathlib
import Definitions.Def_SkutellaCQP_MaxCut_Setting
Formal statement
namespace SkutellaCQP.MaxCut

open Finset

/-- Display (36), §6, p. 30. For every partition of the jobs `J` into `m` subsets, given by an
assignment `σ`, the total weight of `G_J` equals the value of the corresponding schedule minus
`∑_j w_j p_j` plus the weight of the induced `m`-cut:
`c(E_J) = ∑_j w_j C_j − ∑_j w_j p_j + c(E_cut)`. -/
theorem eq_36 {m n : ℕ} (p w : Fin n → ℝ) (hp : ∀ j, 0 < p j) (hw : ∀ j, 0 ≤ w j) (hm : 0 < m) :
    ∀ σ : Fin n → Fin m, cE p w = val p w σ - ∑ j, w j * p j + cut p w σ := by sorry

end SkutellaCQP.MaxCut
Source
Skutella, Convex quadratic and semidefinite programming relaxations in scheduling, J. ACM 48 (2001), p. 30, §6, display (36)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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