Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.8 — Unapproachable buckets are unfillable

Proved
TetrisHard.Rows.unapproachable_unfillable

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

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

Lemma 5.8 An unapproachable bucket is unfillable.

In an admissible reasonable rotation model, an unapproachable bucket has no filling by any finite number of LG, LS, square or I pieces following actual trajectories. The exact Figure 6 profile, including the first open notch, defines unapproachable independently of fillability.

Differences from the source:

  • encoding: one-based rows and columns → zero-based stored cells and signed integer positions; reason: subtracting one preserves every board cell; sentinels prevent subtraction from creating legal cells below the floor
  • generalization: buckets of the constructed game → any board of width 6s+3 with the same six-column walls, modulo-six notches, height H=6T+22 for some nonnegative T, and at least three staging rows; reason: the geometric claim allows arbitrary interior occupancy but retains the source top boundary and spawn-above-buckets condition; every constructed bucket before row deletion has this frame
Preamble
import Definitions.Def_TetrisHard_Rows_Reservoir
Formal statement
namespace TetrisHard.Rows

theorem unapproachable_unfillable
    (R : Rotation) (hR : R.Admissible) (hReason : Reasonable R)
    (B : Board) (s H : ℕ) (hframe : BucketFrame B s H) (j : Fin s)
    (hshape : Unapproachable B j.val H) :
    Unfillable R B j.val H := by sorry

end TetrisHard.Rows
Source
Demaine, Hohenberger and Liben-Nowell, Tetris is Hard, Even to Approximate, arXiv:cs/0210020v1, Lemma 5.8, printed p. 13 = PDF p. 13, 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