Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 3.6 — the truncated exponential density and its two integral bounds

Proved
SingleMachineSched.AlphaSched.lemma_3_6

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

densityp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityreal-analysis

Let 0<γ<10 < \gamma < 10<γ<1 satisfy

1−γ21+γ=γ+ln⁡(1+γ),1 - \frac{\gamma^2}{1 + \gamma} = \gamma + \ln(1 + \gamma),1−1+γγ2​=γ+ln(1+γ),

and let c=1+γ1+γ−e−γc = \frac{1+\gamma}{1+\gamma-e^{-\gamma}}c=1+γ−e−γ1+γ​, δ=1−γ21+γ\delta = 1 - \frac{\gamma^2}{1+\gamma}δ=1−1+γγ2​ and f(α)=(c−1)eαf(\alpha) = (c-1)e^\alphaf(α)=(c−1)eα for 0<α≤δ0 < \alpha \le \delta0<α≤δ, f(α)=0f(\alpha) = 0f(α)=0 otherwise. Then fff is a density function on [0,1][0,1][0,1]: f≥0f \ge 0f≥0 everywhere and ∫01f(α) dα=1\int_0^1 f(\alpha)\, d\alpha = 1∫01​f(α)dα=1. Moreover:

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

Property 1 controls the delay of a job caused by jobs of N1N_1N1​, property 2 the delay caused by jobs of N2N_2N2​, in the bound (3.11).

Formalization Note The integrals are interval integrals of a bounded, piecewise continuous function, so they are ordinary Lebesgue integrals.

Preamble
import Mathlib
import Definitions.Def_SingleMachineSched_AlphaSched_Density
Formal statement
namespace SingleMachineSched.AlphaSched

/-- Lemma 3.6 (Goemans et al. 2002, p. 183): for `γ ∈ (0, 1)` solving
`1 - γ²/(1+γ) = γ + ln(1+γ)`, the function `f` of Theorem 3.5 is a density function on `[0, 1]`
with (i) `∫_0^η f(α)(1 + α - η) dα ≤ (c - 1) η` for all `η ∈ [0, 1]` and
(ii) `∫_μ^1 f(α)(1 + α) dα ≤ c (1 - μ)` for all `μ ∈ [0, 1]`. -/
theorem lemma_3_6 (γ : ℝ)
    (hγ : 0 < γ ∧ γ < 1 ∧ 1 - γ ^ 2 / (1 + γ) = γ + Real.log (1 + γ)) :
    ((∀ a, 0 ≤ fDens γ a) ∧ ∫ a in (0 : ℝ)..1, fDens γ a = 1) ∧
      (∀ η ∈ Set.Icc (0 : ℝ) 1,
        ∫ a in (0 : ℝ)..η, fDens γ a * (1 + a - η) ≤ (cConst γ - 1) * η) ∧
      (∀ μ ∈ Set.Icc (0 : ℝ) 1,
        ∫ a in μ..1, fDens γ a * (1 + a) ≤ cConst γ * (1 - μ)) := by sorry

end SingleMachineSched.AlphaSched
Source
Goemans, Queyranne, Schulz, Skutella & Wang, Single Machine Scheduling with Release Dates, SIAM J. Discrete Math. 15(2) (2002), p. 183, Lemma 3.6
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