Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(37), p. 31 — Z* ≥ Z*_CQP = 1/m · c(E_J) + (1/2 + 1/(2m)) Σⱼ wⱼpⱼ

Proved
SkutellaCQP.MaxCut.eq_37

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

convex-quadratic-relaxationidentical-machineslower-boundmax-k-cutp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

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, the graph GJG_JGJ​ of total weight c(EJ)c(E_J)c(EJ​), and the vector aˉij=1/m\bar a_{ij}=1/maˉij​=1/m of Lemma 2.5. Then the optimum value ZCQP∗=ZCQP(aˉ)Z^*_{CQP}=Z_{CQP}(\bar a)ZCQP∗​=ZCQP​(aˉ) of the relaxation (CQP) satisfies

ZCQP(aˉ)=1m c(EJ)+(12+12m)∑jwjpj,Z_{CQP}(\bar a)=\frac1m\,c(E_J)+\Big(\frac12+\frac1{2m}\Big)\sum_j w_jp_j ,ZCQP​(aˉ)=m1​c(EJ​)+(21​+2m1​)j∑​wj​pj​,

and it is a lower bound on the value of every schedule: ZCQP(aˉ)≤∑jwjCj(σ)Z_{CQP}(\bar a)\le\sum_j w_jC_j(\sigma)ZCQP​(aˉ)≤∑j​wj​Cj​(σ) for every assignment σ\sigmaσ of the jobs to the machines, so Z∗≥ZCQP∗Z^*\ge Z^*_{CQP}Z∗≥ZCQP∗​.

Combined with (36), this lower bound on the scheduling optimum becomes the upper bound (38) on the maximum mmm-cut.

Formalization Note Z∗Z^*Z∗ is the minimum of the value over assignments (Smith's rule, p. 7), so "Z∗≥ZCQP∗Z^*\ge Z^*_{CQP}Z∗≥ZCQP∗​" is stated against every assignment.

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

open Finset

/-- Display (37), §6, proof of Theorem 6.1, p. 31. The optimum value of (CQP),
attained at `ā ≡ 1/m` (Lemma 2.5), equals `1/m · c(E_J) + (1/2 + 1/(2m)) ∑_j w_j p_j`, and it is a
lower bound on the value `∑_j w_j C_j` of every schedule (`Z* ≥ Z*_CQP`). -/
theorem eq_37 {m n : ℕ} (p w : Fin n → ℝ) (hp : ∀ j, 0 < p j) (hw : ∀ j, 0 ≤ w j) (hm : 0 < m) :
    ZCQP p w (abar m n) =
        1 / (m : ℝ) * cE p w + (1 / 2 + 1 / (2 * (m : ℝ))) * ∑ j, w j * p j ∧
    ∀ τ : Fin n → Fin m, ZCQP p w (abar m n) ≤ val p w τ := 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 (37)
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