Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.6, p. 12 — Z_QP(a) = Z_CQP(a) + ½(cᵀa − aᵀdiag(c)a)

Proved
SkutellaCQP.NoRel.zqp_eq_zcqp_add

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

convex-quadratic-relaxationidentityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

For every vector a∈Rmna\in\mathbb R^{mn}a∈Rmn,

ZQP(a)=ZCQP(a)+12(cTa−aTdiag⁡(c) a),Z_{QP}(a)=Z_{CQP}(a)+\tfrac12\bigl(c^Ta-a^T\operatorname{diag}(c)\,a\bigr),ZQP​(a)=ZCQP​(a)+21​(cTa−aTdiag(c)a),

where ZQP(a)=cTa+12aTDaZ_{QP}(a)=c^Ta+\tfrac12a^TDaZQP​(a)=cTa+21​aTDa is the objective of (QP) and ZCQP(a)=12cTa+12aT(D+diag⁡(c))aZ_{CQP}(a)=\tfrac12c^Ta+\tfrac12a^T(D+\operatorname{diag}(c))aZCQP​(a)=21​cTa+21​aT(D+diag(c))a that of (CQP).

The identity measures the gap between the expected value of the rounded schedule (which is ZQPZ_{QP}ZQP​ by Theorem 2.1) and the value of the convex relaxation; it is the common step of Theorem 2.6 and Lemma 2.8.

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

open Matrix

/-- The identity in the proof of Theorem 2.6 (p. 12):
`Z_QP(a) = Z_CQP(a) + ½ (c^T a - a^T diag(c) a)` for every `a ∈ ℝ^{mn}`. -/
theorem zqp_eq_zcqp_add {m n : ℕ} (p : Fin m → Fin n → ℝ) (w : Fin n → ℝ)
    (a : Fin m → Fin n → ℝ) :
    ZQP p w a = ZCQP p w a +
      (1 / 2) * (cvec p w ⬝ᵥ vec a - vec a ⬝ᵥ (Matrix.diagonal (cvec p w) *ᵥ vec a)) := by sorry

end SkutellaCQP.NoRel
Source
Skutella, Convex quadratic and semidefinite programming relaxations in scheduling, J. ACM 48 (2001), p. 12, §2.3, proof of Theorem 2.6 (displayed equality)
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