Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7, p. 15, Case 2 — if the best nonempty initial set has negative trial weight, ρ exceeds every attainable ratio

Proved
LawlerWCT.RhoMax.case_2

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

initial-setsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1parametric-searchratioscheduling

Let G=(N,A)G=(N,A)G=(N,A) be an acyclic digraph on a finite job set NNN, with positive processing times pj>0p_j>0pj​>0 and real weights wjw_jwj​, and let ρ\rhoρ be a real trial value with trial weights wˉj=wj−ρpj\bar w_j=w_j-\rho p_jwˉj​=wj​−ρpj​. Let III be a nonempty initial set of NNN of maximum trial weight among all nonempty initial sets of NNN. If

∑j∈Iwˉj<0,\sum_{j\in I}\bar w_j<0,j∈I∑​wˉj​<0,

then the trial value is too large:

ρ(I′)<ρfor every nonempty initial set I′ of N.\rho(I')<\rho\qquad\text{for every nonempty initial set } I' \text{ of } N .ρ(I′)<ρfor every nonempty initial set I′ of N.

This is the second outcome of a trial value in the binary search: the optimal ratio lies strictly below ρ\rhoρ.

Formalization Note. The maximum is taken over nonempty initial sets. Over all initial sets the empty set has weight 000, so a maximum-weight initial set never has negative weight and Case 2 could not occur; the nonempty reading is the one under which the case is meaningful. ρ(∅)\rho(\emptyset)ρ(∅) is 000 in Lean, so the conclusion also ranges over nonempty sets only.

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

theorem case_2 {ι : Type*} (N : Finset ι) (G : ι → ι → Prop)
    (hGN : ∀ i j, G i j → i ∈ N ∧ j ∈ N) (hacyc : ∀ j, ¬ Relation.TransGen G j j)
    (p w : ι → ℝ) (hp : ∀ j ∈ N, 0 < p j) (ρ : ℝ) (I : Finset ι)
    (hI : LawlerWCT.SeriesPar.IsInitialSet G N I) (hIne : I.Nonempty)
    (hmax : ∀ I', LawlerWCT.SeriesPar.IsInitialSet G N I' → I'.Nonempty → trialWeight p w ρ I' ≤ trialWeight p w ρ I)
    (hneg : trialWeight p w ρ I < 0) :
    ∀ I', LawlerWCT.SeriesPar.IsInitialSet G N 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 2
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