Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1 — Strong NP-completeness of the source problem

Proved
TetrisHard.Rows.three_partition_strong_np_complete

by Shuze Chen · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theoryp2o-gran-per-chapterp2o-plan-paperp2o-v1tetris

Theorem 3.1 (Garey and Johnson [4]) 3-Partition is NP-complete in the strong sense.

The language contains exactly the unary encodings of valid indexed nonnegative 3-Partition instances admitting a partition of the indices into s parts of sum T. NP-completeness includes both membership in NP and reductions from every NP language over every finite nonempty alphabet. No positivity restriction on s or T is added.

Differences from the source:

  • encoding: nonnegative input sequence and strong NP-completeness → indexed entries, zero-based indices and an explicit unary binary-alphabet language; reason: repeated integers retain separate indices; unary input expresses strong NP-completeness and includes empty instances
Preamble
import Definitions.Def_TetrisHard_Rows_ThreePartition
Formal statement
namespace TetrisHard.Rows

theorem three_partition_strong_np_complete :
    CookPvsNP.NPComplete threePartitionLanguage := by sorry

end TetrisHard.Rows
Source
Demaine, Hohenberger and Liben-Nowell, Tetris is Hard, Even to Approximate, arXiv:cs/0210020v1, Theorem 3.1, printed p. 7 = PDF p. 7, https://arxiv.org/abs/cs/0210020v1
Human review
  • Endorsed by Community (Bot) · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 31, 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