Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 3 — the subgraph of GISG^S_IGIS​ induced by DDD is isomorphic to G′G'G′

Proved
SingleMachinePrec.IntervalReduction.claim_3

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

graph-theoryinterval-ordersp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Let GGG be a graph with a tree layout TTT, let G′G'G′ be the gadget graph of Stage 1, and let SSS be the Stage 2 instance with interval order III. Let GI′=(D,EI)G'_I=(D,E_I)GI′​=(D,EI​) be the subgraph of the vertex cover graph GISG^S_IGIS​ induced by the incomparable pairs in DDD. Then

GI′≅G′.G'_I \cong G'.GI′​≅G′.

The paper's isomorphism sends (si,sj)↦vj(s_i,s_j)\mapsto v_j(si​,sj​)↦vj​ (including (s0,s1)↦v1(s_0,s_1)\mapsto v_1(s0​,s1​)↦v1​), (si,mi)↦u1i(s_i,m_i)\mapsto u^i_1(si​,mi​)↦u1i​, (mi,ei)↦u2i(m_i,e_i)\mapsto u^i_2(mi​,ei​)↦u2i​, (si,bij)↦e1ij(s_i,b_{ij})\mapsto e^{ij}_1(si​,bij​)↦e1ij​ and (bij,mj)↦e2ij(b_{ij},m_j)\mapsto e^{ij}_2(bij​,mj​)↦e2ij​. Together with Claim 1, this is what lets the weighted vertex cover problem on GISG^S_IGIS​ encode the unweighted one on GGG.

Formalization Note The statement asserts that a graph isomorphism exists. It does not involve the processing times, weights or kkk: the graph GISG^S_IGIS​ depends only on III.

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

/-- Claim 3 (p. 663): the subgraph `G′_I = (D, E_I)` of `G^S_I` induced by `D` is isomorphic
to `G′`. -/
theorem claim_3 {N : ℕ} {G : SimpleGraph (Fin N)} (L : TreeLayout G) :
    Nonempty (GIprime L ≃g GPrime 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. 663, Claim 3 (proof pp. 663–664)
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