Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, proof of Theorem 1, p. 4 — the support graph of a vertex of (LP) is a pseudoforest

Proved
UnrelatedSched.TwoApprox.vertex_support_pseudoforest

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

graph-theorylinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1pseudoforestscheduling

Let P=(pij)∈Nm×nP=(p_{ij})\in\mathbb N^{m\times n}P=(pij​)∈Nm×n, deadlines d1,…,dm∈Rd_1,\dots,d_m\in\mathbb Rd1​,…,dm​∈R and t∈Rt\in\mathbb Rt∈R, and let x~\tilde xx~ be a vertex of the linear program (LP) of the Rounding Theorem. Let G=(M,J,E)G=(M,J,E)G=(M,J,E) be the bipartite support graph of x~\tilde xx~, with E={(i,j)∣x~ij>0}E=\{(i,j)\mid\tilde x_{ij}>0\}E={(i,j)∣x~ij​>0}. Then GGG is a pseudoforest: for every set SSS of machines and every set TTT of jobs,

∣{(i,j)∈E:i∈S, j∈T}∣≤∣S∣+∣T∣.\big|\{(i,j)\in E : i\in S,\ j\in T\}\big| \le |S|+|T| .​{(i,j)∈E:i∈S, j∈T}​≤∣S∣+∣T∣.

Equivalently, each connected component of GGG is a tree or a tree plus one edge. This structural fact is what makes the vertex roundable: the rounding of the Rounding Theorem is a matching in this graph.

Formalization Note The paper states the component form ("the number of nodes in each component is at least equal to the number of edges"); the hereditary counting form above is equivalent for finite graphs. The paper's deadlines and threshold are integers; the statement is for real ones, which the proof allows.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_Scheduling_Schedule
import Definitions.Def_UnrelatedSched_TwoApprox_DeadlineLP
Formal statement
namespace UnrelatedSched.TwoApprox

/-- §2, proof of Theorem 1, p. 4: the support graph of a vertex of (LP) is a pseudoforest. -/
theorem vertex_support_pseudoforest {m n : ℕ} (P : Matrix (Fin m) (Fin n) ℕ) (d : Fin m → ℝ)
    (t : ℝ) (x : Matrix (Fin m) (Fin n) ℝ) (hx : IsLPVertex P d t x) :
    IsPseudoforest (supportEdges x) := by sorry

end UnrelatedSched.TwoApprox
Source
Lenstra, Shmoys, Tardos, Approximation algorithms for scheduling unrelated parallel machines, CWI Report OS-R8714 (1987), p. 4, §2, proof of Theorem 1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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