§7, p. 15, Case 2 — if the best nonempty initial set has negative trial weight, ρ exceeds every attainable ratio
ProvedLawlerWCT.RhoMax.case_2Let be an acyclic digraph on a finite job set , with positive processing times and real weights , and let be a real trial value with trial weights . Let be a nonempty initial set of of maximum trial weight among all nonempty initial sets of . If
then the trial value is too large:
This is the second outcome of a trial value in the binary search: the optimal ratio lies strictly below .
Formalization Note. The maximum is taken over nonempty initial sets. Over all initial sets the empty set has weight , 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. is in Lean, so the conclusion also ranges over nonempty sets only.
import Mathlib import Definitions.Def_LawlerWCT_RhoMax_Model
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.