Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 3.11 — the two properties of the density ggg

Proved
SingleMachineSched.AlphaJSched.lemma_3_11

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityrandomized-algorithmsreal-analysis

Let γ\gammaγ satisfy 0<γ<10<\gamma<10<γ<1 and γ+ln⁡(2−γ)=e−γ((2−γ)eγ−1)\gamma+\ln(2-\gamma)=e^{-\gamma}\bigl((2-\gamma)e^{\gamma}-1\bigr)γ+ln(2−γ)=e−γ((2−γ)eγ−1), let δ=γ+ln⁡(2−γ)\delta=\gamma+\ln(2-\gamma)δ=γ+ln(2−γ), c=1+e−γ/δc=1+e^{-\gamma}/\deltac=1+e−γ/δ, and let

g(α)={(c−1)eαif 0<α≤δ,0otherwise.g(\alpha)=\begin{cases}(c-1)e^{\alpha}&\text{if }0<\alpha\le\delta,\\0&\text{otherwise.}\end{cases}g(α)={(c−1)eα0​if 0<α≤δ,otherwise.​

Write Eg[α]=∫01α g(α) dαE_g[\alpha]=\int_0^1\alpha\,g(\alpha)\,d\alphaEg​[α]=∫01​αg(α)dα. Then ggg is a density function on (0,1](0,1](0,1], that is, g≥0g\ge0g≥0 and ∫01g(α) dα=1\int_0^1 g(\alpha)\,d\alpha=1∫01​g(α)dα=1, and

  1. ∫0ηg(α)(1+α−η) dα ≤ (c−1) η\displaystyle\int_0^\eta g(\alpha)(1+\alpha-\eta)\,d\alpha\ \le\ (c-1)\,\eta∫0η​g(α)(1+α−η)dα ≤ (c−1)η for all η∈[0,1]\eta\in[0,1]η∈[0,1];
  2. (1+Eg[α])∫μ1g(α) dα ≤ c (1−μ)\displaystyle\bigl(1+E_g[\alpha]\bigr)\int_\mu^1 g(\alpha)\,d\alpha\ \le\ c\,(1-\mu)(1+Eg​[α])∫μ1​g(α)dα ≤ c(1−μ) for all μ∈[0,1]\mu\in[0,1]μ∈[0,1].

Property (i) bounds the expected delay caused by jobs in N1N_1N1​ and property (ii) the delay caused by jobs in N2N_2N2​, in the right-hand side of (3.11). The lemma is a statement in real analysis about one explicit function.

Formalization Note. Eg[α]E_g[\alpha]Eg​[α] is the integral against ggg, not the expectation of a random variable. The integrals in (i) and (ii) are oriented interval integrals, which agree with the paper's for η,μ∈[0,1]\eta,\mu\in[0,1]η,μ∈[0,1].

Preamble
import Mathlib
import Definitions.Def_SingleMachineSched_AlphaJSched_DensityG
Formal statement
namespace SingleMachineSched.AlphaJSched

/-- Lemma 3.11: for the root `γ ∈ (0, 1)` of `γ + ln(2 − γ) = e^{−γ}((2 − γ)e^γ − 1)`, the
function `g` of Theorem 3.9 is a probability density on `(0, 1]`, and
(i) `∫_0^η g(α)(1 + α − η) dα ≤ (c − 1) η` for all `η ∈ [0, 1]`;
(ii) `(1 + E_g[α]) ∫_μ^1 g(α) dα ≤ c (1 − μ)` for all `μ ∈ [0, 1]`. -/
theorem lemma_3_11 (γ : ℝ)
    (hγ : 0 < γ ∧ γ < 1 ∧
      γ + Real.log (2 - γ) = Real.exp (-γ) * ((2 - γ) * Real.exp γ - 1)) :
    ((∀ a, 0 ≤ gDens γ a) ∧ ∫ a in Set.Ioc (0 : ℝ) 1, gDens γ a = 1) ∧
      (∀ η ∈ Set.Icc (0 : ℝ) 1,
        ∫ a in (0 : ℝ)..η, gDens γ a * (1 + a - η) ≤ (cConst γ - 1) * η) ∧
      (∀ μ ∈ Set.Icc (0 : ℝ) 1,
        (1 + Eg γ) * ∫ a in μ..1, gDens γ a ≤ cConst γ * (1 - μ)) := by sorry

end SingleMachineSched.AlphaJSched
Source
Goemans, Queyranne, Schulz, Skutella & Wang, Single Machine Scheduling with Release Dates, SIAM J. Discrete Math. 15(2) (2002), p. 185, Lemma 3.11
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me