Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, proof of Theorem 1, pp. 4–5 — in a pseudoforest, job nodes of degree ≥ 2 can be matched to machines

Proved
UnrelatedSched.TwoApprox.pseudoforest_job_matching

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

graph-theorymatchingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1pseudoforest

Let m≥1m\ge 1m≥1, and let EEE be the edge set of a bipartite graph between machines {1,…,m}\{1,\dots,m\}{1,…,m} and jobs {1,…,n}\{1,\dots,n\}{1,…,n} which is a pseudoforest (every set SSS of machines and TTT of jobs spans at most ∣S∣+∣T∣|S|+|T|∣S∣+∣T∣ edges). Let T0T_0T0​ be a set of jobs each of which has degree at least 222 in EEE. Then there is a matching that covers all of T0T_0T0​: a map fff from jobs to machines with

(f(j),j)∈E  for all j∈T0,f injective on T0.(f(j),j)\in E\ \text{ for all } j\in T_0,\qquad f \text{ injective on } T_0 .(f(j),j)∈E  for all j∈T0​,f injective on T0​.

In the proof of the Rounding Theorem this is applied to the support graph of a vertex after deleting the jobs that the vertex already assigns integrally; the matching assigns each remaining job to a distinct machine.

Formalization Note The paper's graph G′G'G′ is the support graph with the job nodes of degree 111 removed; here the jobs of G′G'G′ are any set T0T_0T0​ of jobs of degree at least 222, and the pseudoforest property of the whole graph is assumed (it passes to G′G'G′). The degree of job jjj is the number of edges of EEE at jjj.

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, pp. 4–5: in a machine–job pseudoforest, any set of jobs each of degree
at least 2 can be matched into the machines. -/
theorem pseudoforest_job_matching {m n : ℕ} (hm : 0 < m)
    (E : Finset (Fin m × Fin n)) (hE : IsPseudoforest E)
    (T : Finset (Fin n)) (hdeg : ∀ j ∈ T, 2 ≤ (E.filter fun e => e.2 = j).card) :
    ∃ f : Fin n → Fin m, (∀ j ∈ T, (f j, j) ∈ E) ∧ Set.InjOn f (T : Set (Fin n)) := by sorry

end UnrelatedSched.TwoApprox
Source
Lenstra, Shmoys, Tardos, Approximation algorithms for scheduling unrelated parallel machines, CWI Report OS-R8714 (1987), pp. 4–5, §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