Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 4.2, p. 22 — exchange inequality: ∑ⱼ xⱼwⱼ ∑_{j′≺ᵢj} x_{j′}p_{ij′} ≤ ∑ⱼ xⱼwⱼ ∑_{j′≺j} x_{j′}p_{ij′} for any total order ≺

Proved
SkutellaCQP.Preempt.slot_exchange

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

exchange-argumentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1schedulingsmith-rule

Fix a machine iii of an instance with weights wj≥0w_j\ge0wj​≥0 and processing times pij>0p_{ij}>0pij​>0, and let ≺i\prec_i≺i​ be Smith's order on machine iii: j≺ikj\prec_i kj≺i​k if wj/pij>wk/pikw_j/p_{ij}>w_k/p_{ik}wj​/pij​>wk​/pik​, or the ratios are equal and j<kj<kj<k. Let xj≥0x_j\ge0xj​≥0 be numbers attached to the jobs (in the paper, the fractions aikja_{i_kj}aik​j​ of one time slot iki_kik​), and let ≺\prec≺ be any strict total order on the jobs. Then

∑jxjwj∑j′≺ijxj′pij′ ≤ ∑jxjwj∑j′≺jxj′pij′.\sum_j x_jw_j\sum_{j'\prec_i j}x_{j'}p_{ij'}\ \le\ \sum_j x_jw_j\sum_{j'\prec j}x_{j'}p_{ij'}.j∑​xj​wj​j′≺i​j∑​xj′​pij′​ ≤ j∑​xj​wj​j′≺j∑​xj′​pij′​.

This is the inequality the proof of Lemma 4.2 reduces the bound (23) to, slot by slot. It is Smith's ratio rule for the "fractional jobs" of processing time xjpijx_jp_{ij}xj​pij​ and weight xjwjx_jw_jxj​wj​: ordering them by ≺i\prec_i≺i​ minimizes their total weighted completion time.

Formalization Note The total order ≺\prec≺ is given by a permutation π\piπ of the jobs, with j′≺jj'\prec jj′≺j iff π(j′)<π(j)\pi(j')<\pi(j)π(j′)<π(j); every strict total order on a finite set arises this way. ≺i\prec_i≺i​ is cross-multiplied (wjpik>wkpijw_jp_{ik}>w_kp_{ij}wj​pik​>wk​pij​), equal to the ratio form since p>0p>0p>0.

Preamble
import Mathlib
import Definitions.Def_SkutellaCQP_Preempt_Setting
Formal statement
namespace SkutellaCQP.Preempt

open Finset

theorem slot_exchange {m n : ℕ} (p : Fin m → Fin n → ℝ) (w : Fin n → ℝ)
    (hp : ∀ i j, 0 < p i j) (hw : ∀ j, 0 ≤ w j)
    (i : Fin m) (x : Fin n → ℝ) (hx : ∀ j, 0 ≤ x j) (π : Equiv.Perm (Fin n)) :
    ∑ j, x j * w j * ∑ j' ∈ univ.filter (fun j' => SkutellaCQP.NoRel.prec p w i j' j), x j' * p i j' ≤
      ∑ j, x j * w j * ∑ j' ∈ univ.filter (fun j' => π j' < π j), x j' * p i j' := by sorry

end SkutellaCQP.Preempt
Source
Skutella, Convex quadratic and semidefinite programming relaxations in scheduling, J. ACM 48 (2001), §4, proof of Lemma 4.2, p. 22, last display before the end of the proof
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