Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 9.2 — for distinct p1<⋯<pkp_1<\dots<p_kp1​<⋯<pk​, PARTITION is yes iff some schedule meets T/2T/2T/2 for both agents

Proved
TwoAgentSched.TotalTotal.theorem_9_2_equivalence

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1partitionreductionschedulingtwo-agent

Let p1<p2<⋯<pkp_1<p_2<\dots<p_kp1​<p2​<⋯<pk​ be pairwise distinct nonnegative integers, P=∑ipiP=\sum_ip_iP=∑i​pi​, T=3P+4∑i=1k(k−i)piT=3P+4\sum_{i=1}^k(k-i)p_iT=3P+4∑i=1k​(k−i)pi​, and consider the instance of the proof of Theorem 9.2, in which agents AAA and BBB each have kkk jobs of lengths p1,…,pkp_1,\dots,p_kp1​,…,pk​. Then

∃ S⊆{1,…,k}: ∑i∈Spi=∑i∉Spi⟺∃ σ: ∑i=1kCiA(σ)≤T/2, ∑i=1kCiB(σ)≤T/2,\exists\,S\subseteq\{1,\dots,k\}:\ \sum_{i\in S}p_i=\sum_{i\notin S}p_i\quad\Longleftrightarrow\quad\exists\,\sigma:\ \sum_{i=1}^kC^A_i(\sigma)\le T/2,\ \sum_{i=1}^kC^B_i(\sigma)\le T/2,∃S⊆{1,…,k}: i∈S∑​pi​=i∈/S∑​pi​⟺∃σ: i=1∑k​CiA​(σ)≤T/2, i=1∑k​CiB​(σ)≤T/2,

where σ\sigmaσ ranges over the sequences of all 2k2k2k jobs processed without idle time from time 000.

This is the correctness statement of the reduction of Theorem 9.2, for PARTITION instances without repeated values.

Formalization Note The paper states the equivalence for p1≤⋯≤pkp_1\le\dots\le p_kp1​≤⋯≤pk​. With repeated values it is false: for p=(1,1,1,1,10)p=(1,1,1,1,10)p=(1,1,1,1,10), PARTITION has no solution (P=14P=14P=14, and no subset sums to 777), yet T=82T=82T=82 and the sequence with agents B,B,A,B,A,B,A,A,A,BB,B,A,B,A,B,A,A,A,BB,B,A,B,A,B,A,A,A,B (lengths 1,1,1,1,1,1,1,1,10,101,1,1,1,1,1,1,1,10,101,1,1,1,1,1,1,1,10,10) gives ∑CA=3+5+7+8+18=41\sum C^A=3+5+7+8+18=41∑CA=3+5+7+8+18=41 and ∑CB=1+2+4+6+28=41\sum C^B=1+2+4+6+28=41∑CB=1+2+4+6+28=41. The paper's step "only SPT schedules can be feasible", followed by (5) and (6), assumes that a feasible schedule consists of consecutive pairs, which holds only when the lengths are distinct. The statement therefore assumes ppp strictly increasing. PARTITION is the published PartitionYes applied to the list p1,…,pkp_1,\dots,p_kp1​,…,pk​.

Preamble
import Mathlib
import Definitions.Def_TwoAgentSched_TotalTotal_Construction
Formal statement
namespace TwoAgentSched.TotalTotal

open ProjSchedTW.Complexity

/-- Proof of Theorem 9.2 (Agnetis et al. 2004, p. 238), corrected: for pairwise distinct integers
`p_1 < p_2 < ⋯ < p_k`, the PARTITION instance `{p_1, …, p_k}` is a yes-instance iff the
constructed instance has a sequence of all jobs with `∑ C^A_i ≤ T/2` and `∑ C^B_i ≤ T/2`.
(With repeated lengths the printed equivalence fails, e.g. for `1, 1, 1, 1, 10`.) -/
theorem theorem_9_2_equivalence {k : ℕ} (p : Fin k → ℕ) (hp : StrictMono p) :
    PartitionYes (List.ofFn p) ↔
      (construction p).RecYes ((bigT p : ℝ) / 2) ((bigT p : ℝ) / 2) := by sorry

end TwoAgentSched.TotalTotal
Source
Agnetis, Mirchandani, Pacciarelli & Pacifici, Scheduling Problems with Two Competing Agents, Oper. Res. 52(2) (2004), p. 238, proof of Theorem 9.2 ("For a schedule to be feasible … solution to the instance of Partition"); corrected
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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