Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.3, p. 797 — (1/m) Σ_{k≤j} E[P_k] ≤ (1 + max{1, (m−1)Δ/m}) C^LP_j for points sorted by C^LP

Proved
StochSchedPrec.CMNS.lemma_3_3

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

load-inequalitieslp-relaxationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let m≥1m\ge1m≥1, Δ≥0\Delta\ge0Δ≥0 and μj≥0\mu_j\ge0μj​≥0 (j∈Vj\in Vj∈V). Let CLPC^{\mathrm{LP}}CLP satisfy the first and the last set of inequalities of the LP relaxation,

∑j∈WμjCjLP≥f(W)(W⊆V),CjLP≥μj(j∈V),\sum_{j\in W}\mu_jC^{\mathrm{LP}}_j\ge f(W)\quad(W\subseteq V),\qquad C^{\mathrm{LP}}_j\ge\mu_j\quad(j\in V),j∈W∑​μj​CjLP​≥f(W)(W⊆V),CjLP​≥μj​(j∈V),

and let LLL be a list along which CLPC^{\mathrm{LP}}CLP is nondecreasing. Then for every job jjj

1m∑i∈Bjμi≤(1+max⁡{1,m−1mΔ})CjLP,\frac1m\sum_{i\in B_j}\mu_i\le\Big(1+\max\Big\{1,\frac{m-1}m\Delta\Big\}\Big)C^{\mathrm{LP}}_j,m1​i∈Bj​∑​μi​≤(1+max{1,mm−1​Δ})CjLP​,

where BjB_jBj​ is the set of jobs up to and including jjj in LLL.

This lemma of Möhring, Schulz and Uetz converts the load-dependent term of Theorem 2.8 into a multiple of the LP value.

Formalization Note The paper has μj=E[Pj]\mu_j=\mathrm E[P_j]μj​=E[Pj​] and numbers the jobs so that C1LP≤⋯≤CnLPC^{\mathrm{LP}}_1\le\dots\le C^{\mathrm{LP}}_nC1LP​≤⋯≤CnLP​; here the numbering is a list LLL sorted by CLPC^{\mathrm{LP}}CLP, and μ\muμ is any nonnegative vector.

Preamble
import Mathlib
import Definitions.Def_StochSchedPrec_CMNS_Model
import Definitions.Def_StochSchedPrec_CMNS_Algorithm

open MeasureTheory ProbabilityTheory
Formal statement
namespace StochSchedPrec.CMNS

theorem lemma_3_3 {V : Type*} [Fintype V] [DecidableEq V]
    (m : ℕ) (hm : 0 < m) (Δ : ℝ) (hΔ : 0 ≤ Δ) (μ : V → ℝ) (hμ : ∀ j, 0 ≤ μ j)
    (C : V → ℝ) (hload : ∀ W : Finset V, loadFn m Δ μ W ≤ ∑ j ∈ W, μ j * C j)
    (hlow : ∀ j, μ j ≤ C j)
    (L : Fin (Fintype.card V) ≃ V) (hL : IsSortedBy L C) (j : V) :
    1 / (m : ℝ) * ∑ i ∈ before L j, μ i ≤ (1 + max 1 (((m : ℝ) - 1) / m * Δ)) * C j := by sorry

end StochSchedPrec.CMNS
Source
Skutella and Uetz, Stochastic machine scheduling with precedence constraints, SIAM J. Comput. 34(4) (2005) 788–802, p. 797, Lemma 3.3 (citing Möhring, Schulz, Uetz, J. ACM 46 (1999), Lemma 4.2)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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