Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Polynomial-time many-one reduction from 3-SAT to unary 3-Partition

Proved
TetrisHard.Rows.ksat3_polyReducible_threePartition

by kmehltretter82 · Nov 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theorytetris

Binary-encoded 3-SAT is polynomial-time many-one reducible to unary-encoded 3-Partition:

3-SAT≤p3-Partition.\mathrm{3\text{-}SAT} \le_p \mathrm{3\text{-}Partition}.3-SAT≤p​3-Partition.

Following Garey and Johnson's strong NP-completeness proof (3-SAT →\to→ 3-Dimensional Matching →\to→ 4-Partition →\to→ 3-Partition), a 3-CNF formula with VVV variables and CCC clauses is mapped to a valid 3-Partition instance whose part count sss and target TTT are bounded by fixed polynomials in VVV and CCC. Because all numerical entries are polynomially bounded in the formula length, emitting the unary encoding ⟨s,T,a1,…,a3s⟩\langle s, T, a_1, \dots, a_{3s}\rangle⟨s,T,a1​,…,a3s​⟩ takes polynomial time.

Preamble
import Definitions.Def_TetrisHard_Rows_ThreePartition
import Definitions.Def_KSat_Languages
Formal statement
namespace TetrisHard.Rows

theorem ksat3_polyReducible_threePartition :
    CookPvsNP.PolyReducible {w : List Bool | KSat.KSAT 3 w} threePartitionLanguage := by sorry

end TetrisHard.Rows
Source
Garey and Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Theorem 4.4 (pp. 96-105); Demaine, Hohenberger and Liben-Nowell, Tetris is Hard, Even to Approximate, arXiv:cs/0210020v1, Section 3 (p. 7)

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