Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 7.1 — piwjp_iw_jpi​wj​ is 1 or at most 1/k1/k1/k on incomparable pairs

Proved
SingleMachinePrec.IntervalReduction.remark_7_1

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. Let iii and jjj be jobs with intervals [a,b][a,b][a,b] and [c,d][c,d][c,d] such that a≤da\le da≤d. Then

  1. pi≤1/k⌈b⌉p_i\le 1/k^{\lceil b\rceil}pi​≤1/k⌈b⌉ and wj≤k⌈c⌉w_j\le k^{\lceil c\rceil}wj​≤k⌈c⌉;
  2. if iii and jjj are incomparable in III, then piwj=1p_i w_j = 1pi​wj​=1 or piwj≤1/kp_i w_j\le 1/kpi​wj​≤1/k;
  3. if piwj≥kp_i w_j\ge kpi​wj​≥k, then b<cb<cb<c, that is, the interval of iii lies completely to the left of that of jjj;
  4. if piwj=1p_i w_j = 1pi​wj​=1, then ⌈b⌉=⌈c⌉\lceil b\rceil = \lceil c\rceil⌈b⌉=⌈c⌉.

The remark is the bookkeeping behind Claim 2: on incomparable pairs, the weights of GISG^S_IGIS​ split into "heavy" nodes of weight exactly 111 and "light" nodes of weight at most 1/k1/k1/k.

Formalization Note The ceilings are integer valued and the powers k⌈b⌉k^{\lceil b\rceil}k⌈b⌉ are integer powers of the real kkk (⌈b⌉=−1\lceil b\rceil=-1⌈b⌉=−1 is possible for s0s_0s0​'s left end). The paper takes kkk "large"; the statement assumes k>1k>1k>1, under which parts 3 and 4 hold (at k=1k=1k=1 they fail).

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

/-- Remark 7.1 (p. 662): for jobs `i, j` with intervals `[a, b]` and `[c, d]` and `a ≤ d`,
`p_i ≤ 1/k^⌈b⌉`, `w_j ≤ k^⌈c⌉`; if `i, j` are incomparable then `p_i w_j = 1` or
`p_i w_j ≤ 1/k`; `p_i w_j ≥ k` implies `b < c`; and `p_i w_j = 1` implies `⌈b⌉ = ⌈c⌉`. -/
theorem remark_7_1 {N : ℕ} {G : SimpleGraph (Fin N)} (L : TreeLayout G) (k : ℝ) (hk : 1 < k)
    (x y : Job L) (hxy : left L x ≤ right L y) :
    procTime L k x ≤ 1 / k ^ ⌈right L x⌉ ∧
    weight L k y ≤ k ^ ⌈left L y⌉ ∧
    (Incomparable (prec L) x y →
      procTime L k x * weight L k y = 1 ∨ procTime L k x * weight L k y ≤ 1 / k) ∧
    (k ≤ procTime L k x * weight L k y → right L x < left L y) ∧
    (procTime L k x * weight L k y = 1 → ⌈right L x⌉ = ⌈left L y⌉) := 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. 662, Remark 7.1
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