Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.7, p. 795 — (1/m) E[Σ_{i∈O_j(P)} E[P_i]] ≤ (1/β) E[ℓ_j(P)]

Proved
StochSchedPrec.CMNS.lemma_2_7

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

critical-chaindeliberate-idle-timep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-scheduling

In the standing stochastic model (with Assumption 2.1), let LLL be a linear extension of the precedence constraints, β>0\beta>0β>0, and σ\sigmaσ a measurable CMNS policy with thresholds β E[Pj]\beta\,\mathrm E[P_j]βE[Pj​]. For a job jjj let Oj(P)O_j(P)Oj​(P) be the random set of jobs after jjj in LLL started before jjj, and ℓj(P)\ell_j(P)ℓj​(P) the length of the critical chain of jjj in the schedule σ(P)\sigma(P)σ(P) (for a fixed tie-breaking rule). Then

1m E[∑i∈Oj(P)E[Pi]]≤1β E[ℓj(P)].\frac1m\,\mathrm E\Big[\sum_{i\in O_j(P)}\mathrm E[P_i]\Big]\le\frac1\beta\,\mathrm E[\ell_j(P)].m1​E[i∈Oj​(P)∑​E[Pi​]]≤β1​E[ℓj​(P)].

Each out-of-order job has been charged its full threshold βE[Pi]\beta\mathrm E[P_i]βE[Pi​] before jjj starts, and that charge fits in the parts of [0,Sj(P)[[0,S_j(P)[[0,Sj​(P)[ not covered by the critical chain's waiting intervals.

Formalization Note The paper allows β≥0\beta\ge0β≥0 in this section; at β=0\beta=0β=0 the right-hand side is +∞+\infty+∞ on the page but 000 in Lean (1/0=01/0=01/0=0), so the statement requires β>0\beta>0β>0. Measurability of the policy is the paper's §5 assumption.

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_2_7 {V : Type*} [Fintype V] [DecidableEq V]
    {Ω : Type*} [MeasurableSpace Ω] {Pr : Measure Ω} [IsProbabilityMeasure Pr]
    (m : ℕ) (hm : 0 < m) (A : V → V → Prop) (hacyc : ∀ j, ¬ Relation.TransGen A j j)
    (r : V → ℝ) (hr : ∀ j, 0 ≤ r j) (hAss : ∀ i j, Relation.TransGen A i j → r i ≤ r j)
    (P : V → Ω → ℝ) (hP : IsStochModel Pr P)
    (L : Fin (Fintype.card V) ≃ V) (hLE : IsLinearExtension A L) (β : ℝ) (hβ : 0 < β)
    (tb : V ≃ Fin (Fintype.card V))
    (σ : (V → ℝ) → V → ℝ) (hσ : IsCMNSPolicy m A r L β (fun j => ∫ ω, P j ω ∂Pr) σ)
    (hσm : AEMeasurable (fun ω => σ (fun k => P k ω)) Pr) (j : V) :
    1 / (m : ℝ) * ∫ ω, ∑ i ∈ outOfOrder L (σ (fun k => P k ω)) j, (∫ ω', P i ω' ∂Pr) ∂Pr
      ≤ 1 / β * ∫ ω, chainLength A r tb (fun k => P k ω) (σ (fun k => P k ω)) j ∂Pr := by sorry

end StochSchedPrec.CMNS
Source
Skutella and Uetz, Stochastic machine scheduling with precedence constraints, SIAM J. Comput. 34(4) (2005) 788–802, p. 795, Lemma 2.7
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