Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7, p. 15, Case 1 — a set of positive trial weight Σ(w_j − ρp_j) > 0 has ratio ρ(I) > ρ

Proved
LawlerWCT.RhoMax.case_1

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1parametric-searchratioscheduling

Let NNN be a finite job set with positive processing times pj>0p_j>0pj​>0 and real weights wjw_jwj​, let ρ\rhoρ be a real trial value, and let I⊆NI\subseteq NI⊆N. If the weight of III with respect to the trial weights wˉj=wj−ρpj\bar w_j=w_j-\rho p_jwˉj​=wj​−ρpj​ is strictly positive,

∑j∈Iwˉj=∑j∈Iwj−ρ∑j∈Ipj>0,\sum_{j\in I}\bar w_j=\sum_{j\in I}w_j-\rho\sum_{j\in I}p_j>0,j∈I∑​wˉj​=j∈I∑​wj​−ρj∈I∑​pj​>0,

then III is nonempty and

ρ(I)=∑j∈Iwj∑j∈Ipj>ρ.\rho(I)=\frac{\sum_{j\in I}w_j}{\sum_{j\in I}p_j}>\rho .ρ(I)=∑j∈I​pj​∑j∈I​wj​​>ρ.

This is the first of the three outcomes of testing a trial value ρ\rhoρ in the binary search for the optimal ratio: the trial value is too small, and III itself has a larger ratio.

Formalization Note. The statement does not need III to be an initial set, nor the precedence digraph; it holds for every I⊆NI\subseteq NI⊆N, which is slightly stronger than the paper's use of it for a maximum-weight initial set. The printed display omits the bar over the left-hand wjw_jwj​; the left-hand side is the weight of III with respect to wˉj\bar w_jwˉj​, as the sentence before it says.

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

theorem case_1 {ι : Type*} (N : Finset ι) (p w : ι → ℝ) (hp : ∀ j ∈ N, 0 < p j)
    (ρ : ℝ) (I : Finset ι) (hIN : I ⊆ N) (hpos : 0 < trialWeight p w ρ I) :
    I.Nonempty ∧ ρ < LawlerWCT.SeriesPar.rho p w I := 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. 15, §7, Case 1
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