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

Proved
StochSchedPrec.InForest.lemma_3_3

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

lp-relaxationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-scheduling

Let m≥1m\ge1m≥1, Δ≥0\Delta\ge0Δ≥0, and let μj>0\mu_j>0μj​>0 (j∈Vj\in Vj∈V) be the expected processing times. Let C∈RVC\in\mathbb R^VC∈RV satisfy the first and the last set of inequalities of the LP-relaxation,

∑j∈WμjCj≥f(W)(W⊆V),Cj≥μj(j∈V),\sum_{j\in W}\mu_jC_j\ge f(W)\quad(W\subseteq V),\qquad C_j\ge\mu_j\quad(j\in V),j∈W∑​μj​Cj​≥f(W)(W⊆V),Cj​≥μj​(j∈V),

and let LLL be a priority list along which CCC is nondecreasing. Then for every job jjj, with BjB_jBj​ the jobs up to and including jjj in LLL,

1m∑k∈Bjμk ≤ (1+max⁡{1,m−1mΔ}) Cj.\frac1m\sum_{k\in B_j}\mu_k\ \le\ \Big(1+\max\Big\{1,\frac{m-1}{m}\Delta\Big\}\Big)\,C_j .m1​k∈Bj​∑​μk​ ≤ (1+max{1,mm−1​Δ})Cj​.

The lemma converts the LP solution into a bound on the total expected work ahead of each job in the list, which is the second term in Lemma 4.4.

Formalization Note The page writes the jobs as 1,…,n1,\dots,n1,…,n with C1≤⋯≤CnC_1\le\dots\le C_nC1​≤⋯≤Cn​ and sums over k=1,…,jk=1,\dots,jk=1,…,j; here this is the prefix BjB_jBj​ of a list sorted by CCC.

Preamble
import Mathlib
import Definitions.Def_StochSchedPrec_InForest_LP
Formal statement
namespace StochSchedPrec.InForest

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, f μ m Δ W ≤ ∑ j ∈ W, μ j * C j)
    (hlow : ∀ j, μ j ≤ C j)
    (L : Fin (Fintype.card V) ≃ V) (hL : StochSchedPrec.CMNS.IsSortedBy L C) (j : V) :
    1 / (m : ℝ) * ∑ k ∈ Bset L j, μ k ≤ (1 + max 1 (((m : ℝ) - 1) / m * Δ)) * C j := by sorry

end StochSchedPrec.InForest
Source
Skutella and Uetz, Stochastic machine scheduling with precedence constraints, SIAM J. Comput. 34(4) (2005) 788–802, p. 797, Lemma 3.3 (see [15, 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