Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7, p. 664 — the light nodes weigh less than 1 in total, so w(CI′)=⌊w(CI)⌋w(C'_I) = \lfloor w(C_I)\rfloorw(CI′​)=⌊w(CI​)⌋

Proved
SingleMachinePrec.IntervalReduction.light_weight

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

interval-ordersp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1schedulingvertex-cover

Let SSS be the Stage 2 instance, with nnn jobs and k=n2+1k=n^2+1k=n2+1. Let w(CI)w(C_I)w(CI​) be the minimum weight of a vertex cover of GISG^S_IGIS​ and w(CI′)=∣CI′∣w(C'_I)=|C'_I|w(CI′​)=∣CI′​∣ the minimum size of a vertex cover of the unweighted graph GI′G'_IGI′​ induced by DDD. Then

∑(i,j)∈inc⁡(I)∖Dpiwj<1andw(CI′)=⌊w(CI)⌋.\sum_{(i,j)\in\operatorname{inc}(I)\setminus D} p_i w_j < 1 \qquad\text{and}\qquad w(C'_I)=\lfloor w(C_I)\rfloor.(i,j)∈inc(I)∖D∑​pi​wj​<1andw(CI′​)=⌊w(CI​)⌋.

The weight-one nodes thus determine the optimum exactly, up to the fractional contribution of the light nodes, which the floor removes.

Formalization Note ⌊⋅⌋\lfloor\cdot\rfloor⌊⋅⌋ is Nat.floor, which equals the integer floor here because w(CI)≥0w(C_I)\ge 0w(CI​)≥0. The left sum ranges over all ordered incomparable pairs of III that are not in DDD.

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

open Classical in
/-- §7, p. 664: with `k = n² + 1`, the incomparable pairs outside `D` have total weight
`∑_{(i,j) ∈ inc(I) \ D} p_i w_j < 1`, and therefore the minimum vertex cover of the unweighted
graph `G′_I` has size `⌊w(C_I)⌋`. -/
theorem light_weight {N : ℕ} {G : SimpleGraph (Fin N)} (L : TreeLayout G) :
    (∑ u : IncPair (prec L),
        if InD L u.1.1 u.1.2 then 0
        else vertexWeight (prec L) (procTime L (kVal L)) (weight L (kVal L)) u) < 1 ∧
    (GIprime L).vertexCoverNum = ((⌊tauW 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. 664, §7 (display following the choice k = n^2 + 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