Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.8 and Corollary 2.9, pp. 13–14 — (CQP′) contains every schedule, and rounding any feasible (ā, Z) has expected value ≤ 3/2 · Z

Proved
SkutellaCQP.NoRel.three_halves_rounding

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

approximation-algorithmconvex-quadratic-relaxationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1randomized-roundingschedulingunrelated-machines

Consider an instance of R ∣ ∣∑wjCjR\,|\,|\sum w_jC_jR∣∣∑wj​Cj​ with processing times pij>0p_{ij}>0pij​>0 and weights wj≥0w_j\ge 0wj​≥0, and the convex relaxation (CQP′):

∑iaij=1  ∀j,a≥0,Z≥12cTa+12aT(D+diag⁡(c))a  (12),Z≥cTa  (13).\sum_i a_{ij}=1\ \ \forall j,\qquad a\ge 0,\qquad Z\ge\tfrac12c^Ta+\tfrac12a^T(D+\operatorname{diag}(c))a\ \ (12),\qquad Z\ge c^Ta\ \ (13).i∑​aij​=1  ∀j,a≥0,Z≥21​cTa+21​aT(D+diag(c))a  (12),Z≥cTa  (13).

Then:

  1. (CQP′) is a relaxation. For every assignment σ\sigmaσ of jobs to machines (each machine sequenced by Smith's order), its 0/10/10/1 vector aσa^\sigmaaσ together with Z=∑jwjCj(σ)Z=\sum_jw_jC_j(\sigma)Z=∑j​wj​Cj​(σ) is feasible for (CQP′). Hence ZCQP′∗≤Z∗Z^*_{CQP'}\le Z^*ZCQP′∗​≤Z∗.
  2. Lemma 2.8. For every feasible (aˉ,Z)(\bar a,Z)(aˉ,Z) of (CQP′), Algorithm RANDOMIZED ROUNDING (each job jjj to machine iii with probability aˉij\bar a_{ij}aˉij​, choices pairwise independent) produces a schedule with
E[∑jwjCj]≤32⋅Z.\mathbb E\Bigl[\sum_jw_jC_j\Bigr]\le\tfrac32\cdot Z .E[j∑​wj​Cj​]≤23​⋅Z.

Together the two parts say that the optimal schedule value is within a factor 3/23/23/2 of the optimum of (CQP′) (Corollary 2.9), and that rounding a (near-)optimal solution of (CQP′) yields a randomized 3/23/23/2-approximation for R ∣ ∣∑wjCjR\,|\,|\sum w_jC_jR∣∣∑wj​Cj​.

Formalization Note The first conjunct is what makes ZZZ a lower bound on the optimum; without it the bound of the second would be against an arbitrary number. Polynomial-time solvability of (CQP′) within additive error and derandomization are not formalized. The rounding is any probability weight on assignments with the prescribed one- and two-job marginals (pairwise independence).

Preamble
import Mathlib
import Definitions.Def_SkutellaCQP_NoRel_Setting
Formal statement
namespace SkutellaCQP.NoRel

/-- Goal: Corollary 2.9 (relaxation half) and Lemma 2.8 (pp. 13–14).
(1) Every assignment `σ`, with `Z` its value `∑_j w_j C_j`, is feasible for (CQP′), so the optimum of
(CQP′) is at most the optimal schedule value.
(2) For any feasible `(a, Z)` of (CQP′), randomized rounding with pairwise independent choices yields
a schedule of expected value at most `3/2 · Z`. -/
theorem three_halves_rounding {m n : ℕ} (p : Fin m → Fin n → ℝ) (w : Fin n → ℝ)
    (hp : ∀ i j, 0 < p i j) (hw : ∀ j, 0 ≤ w j) :
    (∀ σ : Fin n → Fin m, CQP'Feasible p w (ind σ) (val p w σ)) ∧
    ∀ (a : Fin m → Fin n → ℝ) (Z : ℝ), CQP'Feasible p w a Z →
      ∀ μ : (Fin n → Fin m) → ℝ, IsPairwiseRounding a μ → E μ (val p w) ≤ (3 / 2) * Z := by sorry

end SkutellaCQP.NoRel
Source
Skutella, Convex quadratic and semidefinite programming relaxations in scheduling, J. ACM 48 (2001), pp. 13–14, (CQP′), Lemma 2.8 and Corollary 2.9
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