Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.1 — vertex cover on connected graphs of degree at most 3 reduces to 1∣prec∣∑wjCj1|\mathrm{prec}|\sum w_jC_j1∣prec∣∑wj​Cj​ on interval orders

Proved
SingleMachinePrec.IntervalReduction.theorem_7_1

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

interval-ordersnp-hardnessp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reductionsschedulingvertex-cover

The paper states: Problem 1∣prec∣∑wjCj1|\mathrm{prec}|\sum w_jC_j1∣prec∣∑wj​Cj​ with precedence constraints that form an interval order is NP-hard. Its proof reduces vertex cover on connected graphs of maximum degree 3, which is NP-complete (Garey, Johnson and Stockmeyer). What the proof establishes, and what is formalized, is the correctness of that reduction.

Let G=(V,E)G=(V,E)G=(V,E) be a connected graph in which every vertex has at most 333 neighbours, let T=(V,ET)T=(V,E_T)T=(V,ET​) be a spanning tree of GGG rooted at v1v_1v1​ whose numbering puts every parent before its children, and let m≥0m\ge 0m≥0 be an integer. Let SSS be the scheduling instance of Stage 2 built from GGG and TTT, with nnn jobs and k=n2+1k=n^2+1k=n2+1, let III be its precedence constraints and w(CI)w(C_I)w(CI​) the minimum weight of a vertex cover of GISG^S_IGIS​. Set c=∣V∣+∣E∖ET∣c=|V|+|E\setminus E_T|c=∣V∣+∣E∖ET​∣. Then

  1. III is an interval order, and
  2. GGG has a vertex cover of size at most mmm if and only if
⌊w(CI)⌋≤m+c.\lfloor w(C_I)\rfloor \le m + c.⌊w(CI​)⌋≤m+c.

Since solving SSS is equivalent to finding a minimum weight vertex cover of GISG^S_IGIS​ (Theorem 2.1 of the paper), this shows that 1∣prec∣∑wjCj1|\mathrm{prec}|\sum w_jC_j1∣prec∣∑wj​Cj​ remains hard when the precedence constraints form an interval order, a class on which many scheduling problems become polynomially solvable.

Formalization Note "NP-hard", the NP-completeness of the source problem, and the polynomial size of the construction are not formalized. Neither is the passage from GISG^S_IGIS​ to schedules (Theorem 2.1, cited). The statement holds for every parent-first spanning tree, not only the paper's breadth-first tree. The connectivity and degree hypotheses are kept as in the paper, although the reduction's correctness does not use them. The interval order is AppliedComb.Posets.IsIntervalOrder applied to the instance's order on jobs; ⌊⋅⌋\lfloor\cdot\rfloor⌊⋅⌋ is Nat.floor (w(CI)≥0w(C_I)\ge 0w(CI​)≥0).

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

/-- Theorem 7.1 (p. 661), in the form its proof (pp. 661–664) establishes: for a connected graph
`G` of maximum degree at most 3 with a rooted spanning tree numbered parent-first, the instance
`S` of Stage 2 (with `k = n² + 1`) has interval-order precedence constraints, and `G` has a vertex
cover of size at most `m` if and only if `⌊w(C_I)⌋ ≤ m + c`, where `c = |V| + |E \ E_T|`. -/
theorem theorem_7_1 {N : ℕ} (G : SimpleGraph (Fin N)) (hconn : G.Connected)
    (hdeg : ∀ v, (G.neighborSet v).ncard ≤ 3) (L : TreeLayout G) (m : ℕ) :
    AppliedComb.Posets.IsIntervalOrder (Job L) ∧
    ((∃ C : Finset (Fin N), G.IsVertexCover (C : Set (Fin N)) ∧ C.card ≤ m) ↔
      ⌊tauW L⌋₊ ≤ m + N + Fintype.card (NonTreeEdge L)) := 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. 661, Theorem 7.1 (proof pp. 661–664, equation (9))
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