Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 2 — an incomparable pair has weight 1 if it lies in DDD, and at most 1/k1/k1/k otherwise

Proved
SingleMachinePrec.IntervalReduction.claim_2

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

interval-ordersp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Let SSS be the Stage 2 instance with parameter k>1k>1k>1, with precedence constraints the interval order III, and let DDD be the set of pairs defined on p. 663. For every pair (i,j)(i,j)(i,j) of incomparable jobs,

piwj=1 if (i,j)∈D,piwj≤1k if (i,j)∉D.p_i w_j = 1 \text{ if } (i,j)\in D, \qquad p_i w_j\le \frac1k \text{ if } (i,j)\notin D.pi​wj​=1 if (i,j)∈D,pi​wj​≤k1​ if (i,j)∈/D.

So the nodes of GISG^S_IGIS​ of weight one are exactly the pairs of DDD, and every other node has weight at most 1/k1/k1/k.

Formalization Note The statement holds for any k>1k>1k>1; the proof later takes k=n2+1k=n^2+1k=n2+1.

Preamble
import Mathlib
import Definitions.Def_SingleMachinePrec_IntervalReduction_Instance
Formal statement
namespace SingleMachinePrec.IntervalReduction

/-- Claim 2 (p. 663): an incomparable pair of jobs `(i, j)` has `p_i w_j = 1` if `(i, j) ∈ D`,
and `p_i w_j ≤ 1/k` otherwise. -/
theorem claim_2 {N : ℕ} {G : SimpleGraph (Fin N)} (L : TreeLayout G) (k : ℝ) (hk : 1 < k)
    (x y : Job L) (hxy : Incomparable (prec L) x y) :
    (InD L x y → procTime L k x * weight L k y = 1) ∧
    (¬ InD L x y → procTime L k x * weight L k y ≤ 1 / k) := by sorry

end SingleMachinePrec.IntervalReduction
Source
Ambühl, Mastrolilli, Mutsanas, Svensson, On the Approximability of Single-Machine Scheduling with Precedence Constraints, Math. Oper. Res. 36(4) (2011), p. 663, Claim 2
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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