Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8, p. 664 — heavy nodes have weight 1, light nodes weight at most 1/k, total light weight at most n²/k

Proved
SingleMachinePrec.VariableCost.light_vertices_weight

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reductionsschedulingvertex-cover

Let GGG be a graph on nnn vertices v1,…,vnv_1,\dots,v_nv1​,…,vn​, let k≥1k \ge 1k≥1, and let S=S(G,k)S = S(G,k)S=S(G,k) be the scheduling instance of the proof of Theorem 8.1, with vertex cover graph GPSG^S_{\mathbf P}GPS​ and node weights w(a,b)=pawbw_{(a,b)} = p_a w_bw(a,b)​=pa​wb​. Call the nnn nodes (vi′,vi′′)(v'_i, v''_i)(vi′​,vi′′​) heavy and all other nodes light. Then:

  1. every heavy node has weight 111;
  2. every light node uuu has weight wu≤1/kw_u \le 1/kwu​≤1/k;
  3. the total weight of the light nodes satisfies
∑u lightwu≤n2k.\sum_{u \text{ light}} w_u \le \frac{n^2}{k}.u light∑​wu​≤kn2​.

These bounds say that, up to an additive n2/kn^2/kn2/k, the weight of a vertex cover of GPSG^S_{\mathbf P}GPS​ is the number of heavy nodes it contains.

Formalization Note The page also says that GPSG^S_{\mathbf P}GPS​ "has at most n2n^2n2 vertices". That is false as printed: the pairs (vi′,vj′)(v'_i, v'_j)(vi′​,vj′​) and (vi′′,vj′′)(v''_i, v''_j)(vi′′​,vj′′​) with i≠ji \neq ji=j are incomparable nodes of weight 000, so the graph can have up to 4n2−2n4n^2 - 2n4n2−2n nodes. Only the weight facts, which the argument uses, are formalized. The hypothesis k≥1k \ge 1k≥1 is implicit on the page (for k<1k < 1k<1 the light nodes would be heavier than 111).

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

open Classical in
/-- §8, p. 664 (proof of Theorem 8.1). For the instance `S = adjacencyInstance G k` with
`k ≥ 1`: every node `(v′_i, v″_i)` of `G^S_P` has weight `1`; every other node has weight at
most `1/k`; and the total weight of the other ("light") nodes is at most `n²/k`. -/
theorem light_vertices_weight {n : ℕ} (G : SimpleGraph (Fin n)) (k : ℝ≥0) (hk : 1 ≤ k) :
    (∀ i : Fin n, vertexWeight (adjacencyInstance G k) (heavy G k i) = 1) ∧
    (∀ u : IncPair (adjacencyInstance G k).P, (∀ i : Fin n, u ≠ heavy G k i) →
      vertexWeight (adjacencyInstance G k) u ≤ 1 / (k : ℝ)) ∧
    weight (adjacencyInstance G k)
        (Finset.univ.filter (fun u => ∀ i : Fin n, u ≠ heavy G k i)) ≤
      (n : ℝ) ^ 2 / (k : ℝ) := 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, §8, proof of Theorem 8.1 (weights of G^S_P)
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