Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7, p. 16, Case 3 — if the best nonempty initial set has zero trial weight, ρ is optimal and I is ρ-maximal

Proved
LawlerWCT.RhoMax.case_3

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 ρ(I)=ρ\rho(I)=\rhoρ(I)=ρ and III is a ρ-maximal initial set of NNN:

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

This is the third outcome of a trial value: the trial value equals the optimal ratio, and the maximum-weight initial set found is ρ-maximal.

Formalization Note. As in Case 2, the maximum is over nonempty initial sets: over all initial sets, the empty set would have weight 000 and could be returned without being ρ-maximal.

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

theorem case_3 {ι : 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)
    (hzero : trialWeight p w ρ I = 0) :
    LawlerWCT.SeriesPar.IsRhoMaximal G p w N I ∧ 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. 16, §7, Case 3
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