Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 1 — τ(G′)=τ(G)+∣V∣+∣E∖ET∣\tau(G') = \tau(G) + |V| + |E\setminus E_T|τ(G′)=τ(G)+∣V∣+∣E∖ET​∣

Proved
SingleMachinePrec.IntervalReduction.claim_1

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

graph-theoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1vertex-cover

Let G=(V,E)G=(V,E)G=(V,E) be a graph with a tree layout T=(V,ET)T=(V,E_T)T=(V,ET​), and let G′G'G′ be the gadget graph of Stage 1. Write τ(H)\tau(H)τ(H) for the minimum size of a vertex cover of a graph HHH. Then

τ(G′)=τ(G)+∣V∣+∣E∖ET∣.\tau(G') = \tau(G) + |V| + |E\setminus E_T|.τ(G′)=τ(G)+∣V∣+∣E∖ET​∣.

In the paper's words: if C∗⊆VC_*\subseteq VC∗​⊆V and C∗′⊆V′C'_*\subseteq V'C∗′​⊆V′ are optimum vertex covers of GGG and G′G'G′, then ∣C∗∣=∣C∗′∣−∣V∣−∣E∖ET∣|C_*| = |C'_*| - |V| - |E\setminus E_T|∣C∗​∣=∣C∗′​∣−∣V∣−∣E∖ET​∣. The construction follows Alimonti and Kann's proof of APX-completeness of vertex cover on cubic graphs. It transfers the vertex cover problem on GGG to the graph G′G'G′, which the scheduling instance reproduces.

Formalization Note τ\tauτ is Mathlib's SimpleGraph.vertexCoverNum, valued in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞} (finite here). The claim does not use connectivity of GGG or the degree bound, and holds for any parent-first spanning tree.

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

/-- Claim 1 (p. 662): the minimum vertex cover of `G′` is larger than that of `G` by exactly
`|V| + |E \ E_T|`. -/
theorem claim_1 {N : ℕ} (G : SimpleGraph (Fin N)) (L : TreeLayout G) :
    (GPrime L).vertexCoverNum =
      G.vertexCoverNum + (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. 662, Claim 1
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