Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix C.2 — elimination of simultaneous dead-plateau and trigger-happy configurations

Proved
TetrisHard.Rows.Padded.padded_dead_trigger_eliminator

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

complexity-theorytetris

Let RRR be a reasonable rotation model and let s≤s′s \le s's≤s′ and H′≥0H' \ge 0H′≥0. From any board UUU in DeadTriggerState(U,s,H′,jdp,jth,hth,h)\mathrm{DeadTriggerState}(U,s,H',j_{\mathrm{dp}},j_{\mathrm{th}},h_{\mathrm{th}},\mathbf{h})DeadTriggerState(U,s,H′,jdp​,jth​,hth​,h) (containing a dead plateau in bucket jdpj_{\mathrm{dp}}jdp​, a trigger-happy configuration in bucket jth≠jdpj_{\mathrm{th}} \ne j_{\mathrm{dp}}jth​=jdp​, and unprepped configurations in all remaining buckets), neither a terminator prefix [Sq,Sq][\mathrm{Sq},\mathrm{Sq}][Sq,Sq] nor a subsequent filler prefix [LG,LS][\mathrm{LG},\mathrm{LS}][LG,LS] admits a zero-waste bucket play to an AllFillableStrict\mathrm{AllFillableStrict}AllFillableStrict board:

DeadTriggerState(U,s,H′,jdp,jth,hth,h)  ⟹  ¬∃ U′, NoRGSeqPlayR(s,s′,H′,U,[Sq,Sq]+ ⁣ ⁣+T,u,U′)∧AllFillableStrictR(s,s′,H′,U′),\mathrm{DeadTriggerState}(U,s,H',j_{\mathrm{dp}},j_{\mathrm{th}},h_{\mathrm{th}},\mathbf{h}) \;\Longrightarrow\; \neg \exists\, U',\ \mathrm{NoRGSeqPlay}_R(s,s',H',U,[\mathrm{Sq},\mathrm{Sq}]\mathbin{+\!\!+}T,\mathbf{u},U') \wedge \mathrm{AllFillableStrict}_R(s,s',H',U'),DeadTriggerState(U,s,H′,jdp​,jth​,hth​,h)⟹¬∃U′, NoRGSeqPlayR​(s,s′,H′,U,[Sq,Sq]++T,u,U′)∧AllFillableStrictR​(s,s′,H′,U′),

and analogously for [LG,LS]+ ⁣ ⁣+T[\mathrm{LG},\mathrm{LS}]\mathbin{+\!\!+}T[LG,LS]++T.

Consequently, the dead-plateau branch of a filler block can never survive the next two pieces of integerBlock, forcing every filler block in a valid Phase-1 play to remain in the active bucket j0j_0j0​.

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

theorem padded_dead_trigger_eliminator
    (R : Rotation) (hReason : Reasonable R) (s s' H' : ℕ) (hs_le : s ≤ s') :
    (∀ (U U' : Board) (ts_tail : List Piece) (us : List PieceState)
       (j_dp j_th : Fin s) (h_th : ℕ) (h : Fin s → ℕ),
      DeadTriggerState U s H' j_dp j_th h_th h →
      NoRGSeqPlay R s s' H' U (.Sq :: .Sq :: ts_tail) us U' →
      AllFillableStrict R s s' H' U' → False) ∧
    (∀ (U U' : Board) (ts_tail : List Piece) (us : List PieceState)
       (j_dp j_th : Fin s) (h_th : ℕ) (h : Fin s → ℕ),
      DeadTriggerState U s H' j_dp j_th h_th h →
      NoRGSeqPlay R s s' H' U (.LG :: .LS :: ts_tail) us U' →
      AllFillableStrict R s s' H' U' → False) := by sorry

end TetrisHard.Rows.Padded
Source
Demaine, Hohenberger and Liben-Nowell, Tetris is Hard, Even to Approximate, arXiv:cs/0210020v1, Section 5.3-5.4 (pp. 12-18), Section 6.2 (pp. 19-21), and Appendix C.1-C.2 (pp. 25-33), 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