Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.12 — some machine group has ∑vL(Tg,v)≥lb⋅n/8\sum_v L(T_{g,v}) \ge \mathrm{lb}\cdot n/8∑v​L(Tg,v​)≥lb⋅n/8

Proved
FlowJobHardness.ColoringReduction.lemma_3_12

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

flow-shopjob-shoplower-boundp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a simple graph on nnn vertices with a proper colouring into ddd classes, let r≥8r \ge 8r≥8 be an integer, let LLL be a real number with 0<L≤r0 < L \le r0<L≤r, and let S(r,d)S(r,d)S(r,d) be the generalized flow shop instance of the colouring reduction, with lb=r2d\mathrm{lb} = r^{2d}lb=r2d. Fix a feasible schedule of all jobs in which at least half of the r2dnr^{2d}nr2dn jobs finish within L⋅lbL\cdot\mathrm{lb}L⋅lb, and let Tg,vT_{g,v}Tg,v​ be the sets of first halves of good long-operations of those jobs on the machines mg,vm_{g,v}mg,v​, with covered lengths L(Tg,v)L(T_{g,v})L(Tg,v​).

Then there is a group index g∈{1,…,r2d}g\in\{1,\dots,r^{2d}\}g∈{1,…,r2d} such that

∑v∈VL(Tg,v) ≥ lb⋅n8.\sum_{v\in V} L(T_{g,v}) \ \ge\ \frac{\mathrm{lb}\cdot n}{8}.v∈V∑​L(Tg,v​) ≥ 8lb⋅n​.

This is the counting step of the soundness proof: a large amount of first-half time is concentrated in a single machine group.

Formalization Note. "At least half the jobs" is 2⋅#{j:Cj≤L r2d}≥r2dn2\cdot\#\{j : C_j \le L\,r^{2d}\} \ge r^{2d}n2⋅#{j:Cj​≤Lr2d}≥r2dn. The paper proves the lemma "in the very same way as Lemma 2.4", whose last step uses (1−4/r)>1/2(1-4/r) > 1/2(1−4/r)>1/2 "for a sufficiently large rrr"; with the non-strict inequality (1−4/r)⋅lb⋅n/4≥lb⋅n/8(1-4/r)\cdot\mathrm{lb}\cdot n/4 \ge \mathrm{lb}\cdot n/8(1−4/r)⋅lb⋅n/4≥lb⋅n/8 the threshold is r≥8r \ge 8r≥8, which is the explicit hypothesis here.

Preamble
import Mathlib
import Definitions.Def_JobShopLTAS_Core_Instance
import Definitions.Def_FlowJobHardness_ColoringReduction_Construction
import Definitions.Def_FlowJobHardness_ColoringReduction_Schedule

open JobShopLTAS.Core
Formal statement
namespace FlowJobHardness.ColoringReduction

/-- **Lemma 3.12** (Mastrolilli–Svensson 2011, p. 20:18). Let `r ≥ 8` and `0 < L ≤ r`, and
let `s` be a feasible schedule of `S(r, d)` in which at least half of the `r^{2d} n` jobs
finish within `L · lb`. Then (keeping only those jobs in `T_{g,v}`) there is a group
`g ∈ {1, …, r^{2d}}` with `∑_{v ∈ V} L(T_{g,v}) ≥ lb · n / 8`. -/
theorem lemma_3_12 {n d : ℕ} (G : SimpleGraph (Fin n)) (c : G.Coloring (Fin d)) (r : ℕ)
    (hr : 8 ≤ r) (L : ℝ) (hL0 : 0 < L) (hLr : L ≤ r) (s : (inst G c r).Op → ℝ)
    (hs : (inst G c r).IsFeasibleSchedule Finset.univ s)
    (hhalf : (size r d n : ℝ) ≤ 2 * (finishedCount G c r s L : ℝ)) :
    ∃ g : ℕ, 1 ≤ g ∧ g ≤ R r d ∧
      (R r d : ℝ) * n / 8 ≤ ∑ v : Fin n, coveredLength G c r s L g v := by sorry

end FlowJobHardness.ColoringReduction
Source
Mastrolilli, Svensson, Hardness of Approximating Flow and Job Shop Scheduling Problems, J. ACM 58(5) (2011), Article 20, p. 20:18, Lemma 3.12 (proved as Lemma 2.4, p. 20:11)
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