Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.9 — if half the jobs of S(r, d) finish by lb⋅L\mathrm{lb}\cdot Llb⋅L, then G has an independent set of size n/(8L)n/(8L)n/(8L)

Proved
FlowJobHardness.ColoringReduction.lemma_3_9

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

flow-shopgraph-coloringindependent-setjob-shopp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1soundness

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.

If S(r,d)S(r,d)S(r,d) has a feasible schedule in which at least half of its r2dnr^{2d}nr2dn jobs finish within lb⋅L\mathrm{lb}\cdot Llb⋅L time units, then GGG has an independent set III with

∣I∣ ≥ n8L.|I| \ \ge\ \frac{n}{8L}.∣I∣ ≥ 8Ln​.

This is the soundness half of the reduction: a schedule in which many jobs finish early certifies a large independent set.

Formalization Note. The paper states that such an independent set can be found "in time polynomial in nnn and rdr^drd"; the algorithmic clause is not formalized, only the existence of the independent set. "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's "for any L≤rL \le rL≤r" is taken with L>0L>0L>0, so that n/(8L)n/(8L)n/(8L) is meaningful; for L<1L<1L<1 the hypothesis can only hold when n=0n=0n=0, since every job has length r2dr^{2d}r2d. The threshold r≥8r \ge 8r≥8 is inherited from Lemma 3.12.

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.9** (Mastrolilli–Svensson 2011, p. 20:18), mathematical content. Let `r ≥ 8`
and `0 < L ≤ r`. If `S(r, d)` has a feasible schedule in which at least half of the
`r^{2d} n` jobs finish within `lb · L = L · r^{2d}` time units, then `G` has an independent set
of size at least `n / (8L)`. (The paper's "in time polynomial in `n` and `r^d`" is not
formalized.) -/
theorem lemma_3_9 {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 : ℝ)) :
    ∃ I : Finset (Fin n), G.IsIndepSet (I : Set (Fin n)) ∧
      (n : ℝ) / (8 * L) ≤ (I.card : ℝ) := 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.9
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