Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(38), p. 31 — Z*_cut ≤ (m − 1)/m · c(E_J) + (1/2 − 1/(2m)) Σⱼ wⱼpⱼ

Proved
SkutellaCQP.MaxCut.eq_38

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

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

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 and the weighted complete graph GJG_JGJ​ of total weight c(EJ)c(E_J)c(EJ​). Every mmm-cut of GJG_JGJ​, induced by a partition J1,…,JmJ_1,\dots,J_mJ1​,…,Jm​ of the jobs, has weight

c(Ecut)≤m−1m c(EJ)+(12−12m)∑jwjpj.c(E_{\mathrm{cut}})\le\frac{m-1}{m}\,c(E_J)+\Big(\frac12-\frac1{2m}\Big)\sum_j w_jp_j .c(Ecut​)≤mm−1​c(EJ​)+(21​−2m1​)j∑​wj​pj​.

In particular this bounds the weight Zcut∗Z^*_{\mathrm{cut}}Zcut∗​ of a maximum mmm-cut.

The bound compares the maximum cut with the scheduling optimum and is the step that turns a ρ\rhoρ-approximate cut into an approximate schedule in Theorem 6.1.

Formalization Note Zcut∗Z^*_{\mathrm{cut}}Zcut∗​ is not a primitive; the bound is stated for every partition, which is equivalent because there are finitely many.

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

open Finset

/-- Display (38), §6, proof of Theorem 6.1, p. 31. Every `m`-cut of `G_J` (hence a maximum one,
`Z*_cut`) weighs at most `(m − 1)/m · c(E_J) + (1/2 − 1/(2m)) ∑_j w_j p_j`. -/
theorem eq_38 {m n : ℕ} (p w : Fin n → ℝ) (hp : ∀ j, 0 < p j) (hw : ∀ j, 0 ≤ w j) (hm : 0 < m) :
    ∀ τ : Fin n → Fin m,
      cut p w τ ≤ ((m : ℝ) - 1) / m * cE p w + (1 / 2 - 1 / (2 * (m : ℝ))) *
        ∑ j, w j * p j := by sorry

end SkutellaCQP.MaxCut
Source
Skutella, Convex quadratic and semidefinite programming relaxations in scheduling, J. ACM 48 (2001), p. 31, §6, proof of Theorem 6.1, display (38)
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