Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7, p. 16 — with integer data −w* ≤ w_j ≤ w*, 1 ≤ p_j ≤ p*, every attainable ratio lies in [−w*, w*]

Proved
LawlerWCT.RhoMax.rho_mem_Icc

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

binary-searchinteger-datap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ratioscheduling

Let NNN be a finite job set whose weights and processing times are integers satisfying

−w∗≤wj≤w∗,1≤pj≤p∗(j∈N).-w^*\le w_j\le w^*,\qquad 1\le p_j\le p^*\qquad(j\in N).−w∗≤wj​≤w∗,1≤pj​≤p∗(j∈N).

Then for every nonempty I⊆NI\subseteq NI⊆N,

−w∗≤ρ(I)=∑j∈Iwj∑j∈Ipj≤w∗.-w^*\le\rho(I)=\frac{\sum_{j\in I}w_j}{\sum_{j\in I}p_j}\le w^* .−w∗≤ρ(I)=∑j∈I​pj​∑j∈I​wj​​≤w∗.

In particular the optimal ratio, the ratio of a ρ-maximal initial set, lies in the interval [−w∗,w∗][-w^*,w^*][−w∗,w∗], which is the starting interval of the binary search.

Formalization Note. The statement bounds the ratio of every nonempty subset of NNN, not only the optimal one, which is a slight generalisation of the paper's sentence; the precedence digraph plays no role and does not appear. The data are integers cast to reals.

Preamble
import Mathlib
import Definitions.Def_LawlerWCT_RhoMax_Model
Formal statement
namespace LawlerWCT.RhoMax

theorem rho_mem_Icc {ι : Type*} (N : Finset ι) (w p : ι → ℤ) (wstar pstar : ℤ)
    (hw : ∀ j ∈ N, -wstar ≤ w j ∧ w j ≤ wstar) (hpb : ∀ j ∈ N, 1 ≤ p j ∧ p j ≤ pstar) :
    ∀ I ⊆ N, I.Nonempty →
      -(wstar : ℝ) ≤ LawlerWCT.SeriesPar.rho (fun j => (p j : ℝ)) (fun j => (w j : ℝ)) I ∧
        LawlerWCT.SeriesPar.rho (fun j => (p j : ℝ)) (fun j => (w j : ℝ)) I ≤ (wstar : ℝ) := by sorry

end LawlerWCT.RhoMax
Source
Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints, IRIA-LABORIA Rapport de Recherche No. 205 (Dec. 1976), HAL hal-04716371v1, p. 16, §7, sentence "Then surely the optimal value of ρ is contained in the interval [− w*, w*]."
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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