Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of LEMMA 1, p. 333 — the instance EO built from a partition instance Y has a solution iff Y does

Proved
GTWSched.NPC.lemma_1_construction

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

np-completenessp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1partitionreduction

Let Y={y1,…,yn}Y=\{y_1,\dots,y_n\}Y={y1​,…,yn​} with n≥1n\ge1n≥1 and every yi>1y_i>1yi​>1 be an instance of Partition. Define X={x1,…,x2n}X=\{x_1,\dots,x_{2n}\}X={x1​,…,x2n​} by

x1=1,x2i=x2i−1+yi (1≤i≤n),x2i+1=x2i+1 (1≤i<n).x_1=1,\qquad x_{2i}=x_{2i-1}+y_i\ (1\le i\le n),\qquad x_{2i+1}=x_{2i}+1\ (1\le i<n).x1​=1,x2i​=x2i−1​+yi​ (1≤i≤n),x2i+1​=x2i​+1 (1≤i<n).

Then

  1. XXX is an instance of even-odd partition (positive integers with xi<xi+1x_i<x_{i+1}xi​<xi+1​ for 1≤i<2n1\le i<2n1≤i<2n), and
  2. YYY can be split into two parts of equal sum if and only if XXX can be split into two parts of equal sum containing exactly one of x2i−1,x2ix_{2i-1},x_{2i}x2i−1​,x2i​ each, for every iii.

This is the reduction from Partition to even-odd partition in the proof of LEMMA 1.

Formalization Note YYY is a list of natural numbers (y ≠ [] is n≥1n\ge1n≥1); the paper assumes yi>1y_i>1yi​>1 "without loss of generality", and that assumption is a hypothesis here. Partition is the published ProjSchedTW.Complexity.PartitionYes, which splits the index set of the list.

Preamble
import Mathlib
import Definitions.Def_CookPvsNP_defs
import Definitions.Def_ProjSchedTW_Complexity_Encoding
import Definitions.Def_GTWSched_NPC_Schedules
import Definitions.Def_GTWSched_NPC_Problems
Formal statement
namespace GTWSched.NPC

open ProjSchedTW.Complexity

/-- Proof of LEMMA 1, p. 333: for a partition instance `Y = [y₁, …, yₙ]` with `n ≥ 1` and every
`yᵢ > 1`, the list `X` with `x₁ = 1`, `x₂ᵢ = x₂ᵢ₋₁ + yᵢ`, `x₂ᵢ₊₁ = x₂ᵢ + 1` is an even-odd
partition instance, and `Y` has a partition into two parts of equal sum iff `X` has an even-odd
partition into two parts of equal sum. -/
theorem lemma_1_construction (y : List ℕ) (hy : y ≠ []) (hy1 : ∀ v ∈ y, 1 < v) :
    EOInstance (eoOfPartition y) ∧ (PartitionYes y ↔ EOYes (eoOfPartition y)) := by sorry

end GTWSched.NPC
Source
Garey, Tarjan & Wilfong, One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties, Math. Oper. Res. 13 (1988), p. 333, proof of LEMMA 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