Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.5, yes case — at least r rows cleared in the padded reservoir game

Proved
TetrisHard.Rows.Padded.paddedReservoir_completeness

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

complexity-theorytetris

Let RRR be an admissible rotation model of radius ρ\rhoρ, let PPP be a valid normalized yes-instance of 3-Partition with s≥1s \ge 1s≥1, and let pad≥max⁡(ρ,2)+2\mathrm{pad} \ge \max(\rho,2)+2pad≥max(ρ,2)+2, K≥1K \ge 1K≥1, σ≥5max⁡(ρ,2)+12\sigma \ge 5\max(\rho,2)+12σ≥5max(ρ,2)+12, and even r≥0r \ge 0r≥0. Then in paddedReservoirGame(P,pad,K,σ,r)\mathrm{paddedReservoirGame}(P,\mathrm{pad},K,\sigma,r)paddedReservoirGame(P,pad,K,σ,r), at least rrr rows can be cleared:

∃ w≥r,AttainableR(paddedReservoirGame(P,pad,K,σ,r), w).\exists\, w \ge r,\qquad \mathrm{Attainable}_R\bigl(\mathrm{paddedReservoirGame}(P,\mathrm{pad},K,\sigma,r),\, w\bigr).∃w≥r,AttainableR​(paddedReservoirGame(P,pad,K,σ,r),w).

The enlarged width and staging height provide an all-empty (2ρ+1)×(2ρ+1)(2\rho+1)\times(2\rho+1)(2ρ+1)×(2ρ+1) neighborhood for up to three clockwise rotations of every piece; a valid 3-partition fills and clears the upper board, the extra I\mathrm{I}I pieces and RG\mathrm{RG}RG key clear the buffer shaft, chimney, and second lock, and the squares tile and clear all rrr reservoir rows.

Preamble
import Definitions.Def_TetrisHard_Rows_PaddedGapReduction
Formal statement
namespace TetrisHard.Rows.Padded

theorem paddedReservoir_completeness
    (R : Rotation) (hR : R.Admissible)
    (P : ThreePartition) (hP : P.Valid) (hN : P.Normalized) (hs : 0 < P.s)
    (hyes : P.HasSolution)
    (pad K st r : ℕ)
    (hpad : max R.radius 2 + 2 ≤ pad)
    (hK : 1 ≤ K)
    (hst : 5 * max R.radius 2 + 12 ≤ st)
    (hr : Even r) :
    ∃ w, r ≤ w ∧ Attainable R (paddedReservoirGame P pad K st r) w := by sorry

end TetrisHard.Rows.Padded
Source
Demaine, Hohenberger and Liben-Nowell, Tetris is Hard, Even to Approximate, arXiv:cs/0210020v1, Section 3 (p. 7), Section 5.3 (pp. 12-14), Section 6.2 and Figure 9(b) (pp. 19-21), Theorem 6.5 (p. 21), https://arxiv.org/abs/cs/0210020v1

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