Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8, p. 664 — the subgraph of GPSG^S_{\mathbf P}GPS​ induced by the weight-1 nodes is isomorphic to GGG

Proved
SingleMachinePrec.VariableCost.heavy_subgraph_iso

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

graph-isomorphismp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reductionsschedulingvertex-cover

Let GGG be a graph on vertices v1,…,vnv_1,\dots,v_nv1​,…,vn​, let k>0k > 0k>0, 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. Then:

  1. for all i,ji, ji,j, the nodes (vi′,vi′′)(v'_i, v''_i)(vi′​,vi′′​) and (vj′,vj′′)(v'_j, v''_j)(vj′​,vj′′​) are adjacent in GPSG^S_{\mathbf P}GPS​ if and only if {vi,vj}∈E\{v_i, v_j\} \in E{vi​,vj​}∈E;
  2. if k>1k > 1k>1, the subgraph of GPSG^S_{\mathbf P}GPS​ induced by the nodes of weight 111 is isomorphic to GGG, by an isomorphism sending (vi′,vi′′)(v'_i, v''_i)(vi′​,vi′′​) to viv_ivi​:
GPS[{u:wu=1}]≅G.G^S_{\mathbf P}\bigl[\{u : w_u = 1\}\bigr] \cong G .GPS​[{u:wu​=1}]≅G.

Together with the weight bounds, this identifies vertex covers of GPSG^S_{\mathbf P}GPS​, up to light nodes, with vertex covers of GGG.

Formalization Note For k=1k = 1k=1 some light nodes (vi′,vj′′)(v'_i, v''_j)(vi′​,vj′′​), j<ij < ij<i, have weight kj−i=1k^{j-i} = 1kj−i=1 as well, so the set of weight-1 nodes is larger than the set of heavy nodes; the isomorphism is therefore stated under k>1k > 1k>1, while the adjacency equivalence (1) holds for every kkk.

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

/-- §8, p. 664 (proof of Theorem 8.1). For the instance `S = adjacencyInstance G k`:
(1) two nodes `(v′_i, v″_i)` and `(v′_j, v″_j)` are adjacent in `G^S_P` if and only if
`{v_i, v_j} ∈ E`; (2) if `k > 1`, the subgraph of `G^S_P` induced by the nodes of weight `1`
is isomorphic to `G`, by an isomorphism sending `(v′_i, v″_i)` to `v_i`. -/
theorem heavy_subgraph_iso {n : ℕ} (G : SimpleGraph (Fin n)) (k : ℝ≥0) :
    (∀ i j : Fin n,
      (vertexCoverGraph (adjacencyInstance G k).P).Adj (heavy G k i) (heavy G k j) ↔
        G.Adj i j) ∧
    (1 < k →
      ∃ f : (vertexCoverGraph (adjacencyInstance G k).P).induce
          {u | vertexWeight (adjacencyInstance G k) u = 1} ≃g G,
        ∀ (i : Fin n) (h : heavy G k i ∈ {u | vertexWeight (adjacencyInstance G k) u = 1}),
          f ⟨heavy G k i, h⟩ = i) := 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 (isomorphism with G)
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