Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8.1 — approximating the variable cost of 1∣prec∣∑wjCj1|\mathrm{prec}|\sum w_jC_j1∣prec∣∑wj​Cj​ is as hard as approximating vertex cover

Proved
SingleMachinePrec.VariableCost.theorem_8_1

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

approximationhardness-of-approximationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reductionsschedulingvertex-cover

Let G=(V,E)G = (V,E)G=(V,E) be a graph on nnn vertices v1,…,vnv_1,\dots,v_nv1​,…,vn​, with vertex cover number τ(G)\tau(G)τ(G). Let r≥1r \ge 1r≥1 and ε>0\varepsilon > 0ε>0, and let k≥1k \ge 1k≥1 satisfy

k>n2rε.k > \frac{n^2 r}{\varepsilon}.k>εn2r​.

Let S=S(G,k)S = S(G,k)S=S(G,k) be the scheduling instance of the proof of Theorem 8.1, and let τw(GPS)\tau_w(G^S_{\mathbf P})τw​(GPS​) be the minimum weight of a vertex cover of its vertex cover graph GPSG^S_{\mathbf P}GPS​ (the optimal variable cost). Let CCC be a vertex cover of GPSG^S_{\mathbf P}GPS​ with w(C)≤r τw(GPS)w(C) \le r\,\tau_w(G^S_{\mathbf P})w(C)≤rτw​(GPS​), and put

CG={vi:(vi′,vi′′)∈C}.C_G = \{ v_i : (v'_i, v''_i) \in C \}.CG​={vi​:(vi′​,vi′′​)∈C}.

Then:

  1. CGC_GCG​ is a vertex cover of GGG;
  2. ∣CG∣≤r(τ(G)+n2k)|C_G| \le r\left(\tau(G) + \dfrac{n^2}{k}\right)∣CG​∣≤r(τ(G)+kn2​);
  3. if E≠∅E \neq \emptysetE=∅, then
∣CG∣≤r(1+n2k)τ(G)<(r+ε) τ(G).|C_G| \le r\left(1 + \frac{n^2}{k}\right)\tau(G) < (r + \varepsilon)\,\tau(G).∣CG​∣≤r(1+kn2​)τ(G)<(r+ε)τ(G).

The paper states: "Approximating the variable cost of 1∣prec∣∑wjCj1|\mathrm{prec}|\sum w_jC_j1∣prec∣∑wj​Cj​ is as hard as approximating vertex cover", and concludes that an rrr-approximation algorithm for the variable cost would give an approximation algorithm for vertex cover with ratio r(1+n2/k)<r+εr(1+n^2/k) < r + \varepsilonr(1+n2/k)<r+ε. Its proof establishes the statement above, which is what is formalized: any rrr-approximate solution of the variable-cost problem on S(G,k)S(G,k)S(G,k) is turned, by the explicit map C↦CGC \mapsto C_GC↦CG​, into an (r+ε)(r+\varepsilon)(r+ε)-approximate vertex cover of GGG. Together with Theorem 2.1 of the paper (cited from Ambühl–Mastrolilli and Correa–Schulz: an α\alphaα-approximate vertex cover of GPSG^S_{\mathbf P}GPS​ can be turned in polynomial time into an α\alphaα-approximate solution of SSS), this shows that the variable cost is no easier to approximate than vertex cover.

Formalization Note The algorithmic wording ("approximation algorithm", polynomial time) and the cited Theorem 2.1 are not formalized; the size of S(G,k)S(G,k)S(G,k) (polynomial in nnn and log⁡k\log klogk) is evident from the definition. The hypothesis k≥1k \ge 1k≥1 is implicit on the page: "k>n2r/εk > n^2r/\varepsilonk>n2r/ε" does not imply it when ε\varepsilonε is large. The additive bound (2) is stated for every graph, and the multiplicative bound (3) only when GGG has an edge, since otherwise τ(G)=0\tau(G) = 0τ(G)=0 and the strict inequality fails. τ(G)\tau(G)τ(G) is Mathlib's vertexCoverNum, an extended natural number that is finite for a finite graph, converted with toNat.

Preamble
import Mathlib
import Definitions.Def_SingleMachinePrec_VariableCost_AdjacencyInstance
open scoped NNReal
Formal statement
namespace SingleMachinePrec.VariableCost

open Classical in
/-- Theorem 8.1 (p. 664): approximating the variable cost of `1|prec|∑ w_j C_j` is as hard as
approximating vertex cover. What the proof establishes: let `G` be a graph on `n` vertices,
`r ≥ 1`, `ε > 0`, `k > n² r / ε` with `k ≥ 1`, and `S = adjacencyInstance G k`. If `C` is a
vertex cover of `G^S_P` whose weight is at most `r` times the minimum weight of a vertex cover of
`G^S_P`, then `C_G = {v_i : (v′_i, v″_i) ∈ C}` is a vertex cover of `G` with
`|C_G| ≤ r (τ(G) + n²/k)`, and, if `G` has an edge, `|C_G| ≤ r (1 + n²/k) τ(G) < (r + ε) τ(G)`,
where `τ(G)` is the vertex cover number of `G`. -/
theorem theorem_8_1 {n : ℕ} (G : SimpleGraph (Fin n)) (r ε : ℝ) (k : ℝ≥0)
    (hr : 1 ≤ r) (hε : 0 < ε) (hk1 : 1 ≤ k) (hk : (n : ℝ) ^ 2 * r / ε < (k : ℝ))
    (C : Finset (IncPair (adjacencyInstance G k).P))
    (hC : (vertexCoverGraph (adjacencyInstance G k).P).IsVertexCover (C : Set _))
    (hCr : weight (adjacencyInstance G k) C ≤ r * minCoverWeight (adjacencyInstance G k)) :
    G.IsVertexCover {i | heavy G k i ∈ C} ∧
    ((Finset.univ.filter (fun i => heavy G k i ∈ C)).card : ℝ) ≤
      r * ((G.vertexCoverNum.toNat : ℝ) + (n : ℝ) ^ 2 / (k : ℝ)) ∧
    (G.edgeSet.Nonempty →
      ((Finset.univ.filter (fun i => heavy G k i ∈ C)).card : ℝ) ≤
          r * (1 + (n : ℝ) ^ 2 / (k : ℝ)) * (G.vertexCoverNum.toNat : ℝ) ∧
        r * (1 + (n : ℝ) ^ 2 / (k : ℝ)) * (G.vertexCoverNum.toNat : ℝ) <
          (r + ε) * (G.vertexCoverNum.toNat : ℝ)) := by sorry

end SingleMachinePrec.VariableCost
Source
Ambühl, Mastrolilli, Mutsanas, Svensson, On the Approximability of Single-Machine Scheduling with Precedence Constraints, Math. Oper. Res. 36(4) (2011), p. 664, Theorem 8.1 and its proof
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