Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.1, p. 30 — for ρ ≤ 1, an m-cut of weight ≥ ρ·Z*_cut gives a schedule within ρ + m(1 − ρ) of optimal for Pm | | Σ wⱼCⱼ

Proved
SkutellaCQP.MaxCut.theorem_6_1

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

approximation-algorithmidentical-machinesmax-k-cutp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reductionweighted-completion-time

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 ρ≤1\rho\le1ρ≤1, and let σ\sigmaσ be an assignment of the jobs to the machines whose induced mmm-cut has weight at least ρ\rhoρ times the weight of every mmm-cut of GJG_JGJ​, i.e. c(Ecut(σ))≥ρ⋅Zcut∗c(E_{\mathrm{cut}}(\sigma))\ge\rho\cdot Z^*_{\mathrm{cut}}c(Ecut​(σ))≥ρ⋅Zcut∗​. Then the schedule that uses σ\sigmaσ as its machine assignment and sequences each machine by ≺\prec≺ satisfies

∑jwjCj(σ)≤(ρ+m(1−ρ))∑jwjCj(τ)for every assignment τ,\sum_j w_jC_j(\sigma)\le\big(\rho+m(1-\rho)\big)\sum_jw_jC_j(\tau)\qquad\text{for every assignment }\tau,j∑​wj​Cj​(σ)≤(ρ+m(1−ρ))j∑​wj​Cj​(τ)for every assignment τ,

that is, its value is at most (ρ+m(1−ρ))⋅Z∗(\rho+m(1-\rho))\cdot Z^*(ρ+m(1−ρ))⋅Z∗.

This is the paper's Theorem 6.1: a ρ\rhoρ-approximation algorithm for Max-mmm-Cut, applied to GJG_JGJ​, translates into an approximation algorithm for Pm ∣ ∣∑wjCjPm\,|\,|\sum w_jC_jPm∣∣∑wj​Cj​ with performance guarantee ρ+m(1−ρ)\rho+m(1-\rho)ρ+m(1−ρ).

Formalization Note The algorithmic content ("translates into an approximation algorithm") is the map from cut to assignment, which is the identity on partitions; the running time is not formalized. "Weight at least ρ⋅Zcut∗\rho\cdot Z^*_{\mathrm{cut}}ρ⋅Zcut∗​" is written as ρ c(Ecut(τ))≤c(Ecut(σ))\rho\,c(E_{\mathrm{cut}}(\tau))\le c(E_{\mathrm{cut}}(\sigma))ρc(Ecut​(τ))≤c(Ecut​(σ)) for every assignment τ\tauτ, and Z∗Z^*Z∗ as the value of every assignment, so no maximum or minimum is a primitive.

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

open Finset

/-- Theorem 6.1, p. 30. Let `ρ ≤ 1`. If the assignment `σ` induces an `m`-cut of `G_J` whose weight
is at least `ρ` times the weight of every `m`-cut (i.e. at least `ρ · Z*_cut`), then the schedule
of `σ` has value at most `ρ + m(1 − ρ)` times the value of every schedule. -/
theorem theorem_6_1 {m n : ℕ} (p w : Fin n → ℝ) (hp : ∀ j, 0 < p j) (hw : ∀ j, 0 ≤ w j)
    (hm : 0 < m) (ρ : ℝ) (hρ : ρ ≤ 1) (σ : Fin n → Fin m)
    (hσ : ∀ τ : Fin n → Fin m, ρ * cut p w τ ≤ cut p w σ) :
    ∀ τ : Fin n → Fin m, val p w σ ≤ (ρ + m * (1 - ρ)) * val p w τ := by sorry

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