T-236: Daniel reports Lean proofs of Fang's Theorems 1 and 2, s(n2−n+1)<n for n≥15

V0 C0 Formalization recorded

2026-10-18 published · Daniel after Fang, Arslanov, Mustafin, Shangitbayev, Levy · n=211,241,273,307

Daniel reports Lean 4 proofs of Fang's Theorems 1 and 2 (T-163), with no hypothesis: theorem1, s(n^2 - n + 1) < n for every integer n >= 15, and theorem2, that n^2 - n + 1 + p + 2q unit squares pack in a square of side below n whenever n >= 15 and 16p + 21q <= n - 15. Each states that the squares, closed, translated and rotated, fit in [0, s]^2 with pairwise disjoint interiors for some s < n.

The proof formalizes Fang's: his Lemma 3, the gluing of Arslanov, Mustafin and Shangitbayev's decomposition, on packings in a region; the induction on n; and the 18 pieces as exact rational certificates, each checked by decide +kernel in a generated module, the rectangles of 257 squares in 17 x 16 and 443 in 22 x 21, the bases r^2 - r + 1 in a side below r for r = 15 to 26, and m^2 - m for m = 11 to 14. The source reports the axioms propext, Classical.choice and Quot.sound only, and a build of the pieces in about 19 minutes at 8 chunks in parallel; it publishes no build log. Nothing here has built it.

At the counts this record holds, n=15 to 18, the theorems give s(211)<15, s(241)<16, s(273)<17 and s(307)<18, which T-163's construction and the case bounds improve on; the theorems are what is new here, in Lean.

Daniel after Fang, Arslanov, Mustafin and Shangitbayev, square-packing, 18 October 2026. The pieces' README credits each packing to its finder; Fang's own repository states its Lean scope as Theorem 1 and the unmixed bounds of Theorem 2. The repository's CREDITS.md reads "Produced by Claude (Anthropic) in a single session under human direction".

Significance, composition and next rung
Significance
A machine-checked proof, by another author, of a bound family the record holds on a reviewer's reading of its proof: both theorems for every n >= 15, unconditional, where the family's own formalization covers Theorem 1 and part of Theorem 2. A machine audit, S3, below T-163's S4 because it proves no new bound.
Composition
One cited entry, the source's report (E-fang-theorems-daniel-lean-report), which claims the theorems' upper bounds at the four counts in scope. T-163's evidence is not cited. No build is retained here, so V0; no review has read it, so C0.
Next rung
C1 needs the stage 4 mathematical review, which reads Packs against the record's s(n), the gluing lemma, the induction and the generated pieces against their certificates. V3 and C3 need a build here from the retained bytes with the generated pieces and the axiom receipt of theorem1 and theorem2 (think-dgrc): about 1.5 to 3 CPU-hours, at most about 8 GB per chunk, and 10 GB of disk. That would be reproduction with the producer's code. Rung 5 needs a human expert's review of the formalization beside it.
Unfinished confirmations
C1 (think-57ei): the stage 4 mathematical review of theorem1 and theorem2, their statements, the gluing lemma and the induction, and the 18 pieces, read from the retained packet. Not priced.

C3 (think-dgrc): a build here of FangFinal from the retained bytes, the 18 piece modules generated by the retained generator and built one chunk at a time, with the axiom receipt of theorem1 and theorem2. About 2 CPU-hours, up to about 3 (priced 2026-10-23).
Novelty
previously-published Present in an identified source

The cases

Case record
Regularized by the Squares Project with Daniel's regularizer (evand/square-packing, MIT)
As published
The packing as published, in its source’s pose, Ostashev 2026 [Couzo verified bounds 2026-10-14]

n=211

14.5414.994
141516
14.52615.526
nn+1

Proven

14.54457≤s(211)≤14.993550

  • exact

Citation record n-211

lowerKarakuş 2026, arXiv corrects Nagamochi 2005 (confirmed T-083)

upperOstashev & Couzo, GitHub (confirmed T-188)

Open

  • optimality

The case record

LowerUpper
Gap0.44897772…
Case record
Regularized by the Squares Project with Daniel's regularizer (evand/square-packing, MIT)
As published
The packing as published, in its source’s pose, Ostashev 2026 [Couzo certificates 2026-10-13]

n=241

15.5415.987
151617
15.52416.524
nn+1

Proven

15.54160≤s(241)≤15.987118

  • exact

Citation record n-241

lowerKarakuş 2026, arXiv corrects Nagamochi 2005 (confirmed T-083)

upperOstashev & Couzo, GitHub (confirmed T-182)

Open

  • optimality

The case record

LowerUpper
Gap0.44550813…
Case record
Regularized by the Squares Project with its own axis tool (regularize_axis_components/2)
As published
The packing as published, in its source’s pose, Couzo 2026 [PingYou PR 574 certificates 2026-10-13]

n=273

16.5316.984
161718
16.52317.523
nn+1

Proven

16.53901≤s(273)≤16.983926

  • exact

Citation record n-273

lowerKarakuş 2026, arXiv corrects Nagamochi 2005 (confirmed T-083)

upperCouzo et al., GitHub (confirmed T-174)

Open

  • optimality

The case record

LowerUpper
Gap0.44491103…
Case record
Regularized by the Squares Project with its own axis tool (regularize_axis_components/2)
As published
The packing as published, in its source’s pose, ntumlnoob 2026 [Couzo issue 844 2026-10-28]

n=307

17.5317.979
171819
17.52118.521
nn+1

Proven

17.53672≤s(307)≤17.979252

  • exact

Citation record n-307

lowerKarakuş 2026, arXiv corrects Nagamochi 2005 (confirmed T-083)

upperntumlnoob & Couzo, GitHub (confirmed T-256)

Open

  • optimality

The case record

LowerUpper
Gap0.44252624…

Results on these cases

19 results in the register on n=211,241,273,307, oldest first, each with what it established and how it stands now.

  1. 2005 published T-007 · n=211,241,273,307

    s(n)≥min(⌈n⌉,n−2⌊n⌋+1+1) for 4≤n≤324

    V0 C1 Lower bound incomplete on these cases, superseded by T-083 and T-180 (reported)

    Nagamochi · Nagamochi 2005 · source · register

  2. 2026-09-04 published T-085 · n=211,241,273,307

    Nagamochi 2005, Lemma 1 is false for every container with a>3 and b>2

    V3 C3 Correction confirmed

    Karakuş; Vlasenko · Karakuş 2026 · chelokot Nagamochi counterexample 2026 · packet · register

  3. 2026-09-16 published T-057 · n=211

    s(211)≤14.99796070496771500150<15, the first packing of 211 squares below the grid on record

    V3 C3 Upper bound confirmed superseded by T-188

    de Winter · de Winter n211 2026-09-16 · packet · register

  4. 2026-09-27 published T-056 · n=241,273,307

    Smaller packings for 49 counts from n=68 to 307, each certified two independent ways

    V3 C3 Upper bound confirmed superseded by T-174, T-182 and T-256

    Couzo · franciscouzo square-packing 2026-09-27 · packet · register

  5. 2026-09-29 published T-083 · n=211,241,273,307

    s(n)≥1/2+n−⌊n⌋+1/4 for every nonsquare 8≤n≤324

    V3 C3 Lower bound confirmed

    Karakuş · Karakuş 2026 · source · register

  6. 2026-10-05 published T-098 · n=211,241,273,307

    Exact optima of 48 known-best packings: s(n) ≤ S', 3.5e-13 to 5.0e-11 below each printed side

    V3 C3 Upper bound confirmed on these cases, superseded by T-174, T-182, T-188 and T-256

    Daniel after Couzo, de Winter, Ellsworth, Levy · evand exact optima 2026-10-05 · packet · register

  7. 2026-10-09 published T-136 · n=307

    Seventeen exact rational packings from SQUISH's third request

    V3 C3 Upper bound confirmed superseded by T-256

    Chaoweeraprasit after Couzo, Xu, Göbel, Schadt, Ellsworth, Hajba, Levy · SQUISH third request 2026-10-09 · packet · register

  8. 2026-10-11 published T-149 · n=211

    New packings of 155, 156 and 211 squares, each with an exact rational certificate

    V3 C3 Upper bound confirmed superseded by T-188

    Ostashev after Nakajima, Levy, Xu · Ostashev records 2026-10-11 · packet · register

  9. 2026-10-12 published T-163 · n=211,241,273,307

    s(n² − n + 1) < n for every n ≥ 15, and n² − n + F(n) squares below side n, from Fang

    V3 C1 Upper bound reviewed superseded by T-174, T-182, T-188 and T-256

    Fang after Arslanov, Mustafin, Shangitbayev, Ellsworth, Stead, de Winter, Daniel, Couzo · Fang excess theorem 2026-10-13 · packet · packet · packet · source 1 · source 2 · register

  10. 2026-10-13 published T-174 · n=211,241,273,307

    Tighter certificates at 68 counts from PingYou Ltd, of others' packings and its own

    V3 C3 Upper bound confirmed

    PingYou Ltd after Friedman, Ellsworth, Daniel, Xu, Barnett, Couzo, Ostashev, Chaoweeraprasit, Gupta, Fang, Polkovskyi, Levy · PingYou PR 574 certificates 2026-10-13 · packet · register

  11. 2026-10-13 published T-175 · n=211,241

    New packings of 211, 241 and 304 squares, two with merged tilted bands, each certified exactly

    V3 C3 Upper bound confirmed superseded by T-182 and T-188

    Ostashev after Nakajima, Daniel, de Winter, Couzo, Levy, Xu · Ostashev merged bands 2026-10-13 · packet · register

  12. 2026-10-13 published T-180 · n=211,241,273,307

    Closed-form lower bound s(N)≥a(N) for every non-square N≥49, reported

    V0 C1 Lower bound reviewed

    Hosono · wand125 closed form 2026-10-14 · packet · packet · register

  13. 2026-10-13 published T-181 · n=211,241

    Exact rational certificates at 211, 241 and 302 from Couzo

    V3 C3 Upper bound confirmed superseded by T-182 and T-188

    Couzo after Daniel, Ostashev, Fang, Ellsworth, Levy; Couzo after Daniel, Ostashev, BuddenPing, Fang, Ellsworth, Levy · Couzo issue-583 certificates 2026-10-13 · Couzo certificates 2026-10-13 · packet · packet · register

  14. 2026-10-13 published T-182 · n=211,241

    Exact rational certificates at 154, 211 and 241 from Couzo

    V3 C3 Upper bound confirmed

    Couzo after Daniel, Ostashev, BuddenPing, Fang, Ellsworth, Levy · Couzo certificates 2026-10-13 · packet · register

  15. 2026-10-14 published T-188 · n=211

    A tighter exact certificate for 211 squares from Couzo, of Ostashev's arrangement

    V3 C3 Upper bound confirmed

    Couzo after Ostashev, Daniel, Levy · Couzo verified bounds 2026-10-14 · packet · register

  16. 2026-10-18 published T-236 this result · n=211,241,273,307

    Daniel reports Lean proofs of Fang's Theorems 1 and 2, s(n2−n+1)<n for n≥15

    V0 C0 Formalization recorded

    Daniel after Fang, Arslanov, Mustafin, Shangitbayev, Levy · Daniel Fang and Ryu Lean 2026-10-18 · packet · source · register

  17. 2026-10-23 published T-253 · n=211,241

    Polkovskyi's sub-print re-certifications of nine house packings, 1.3e-19 to 1.7e-19 below each

    V0 C1 Upper bound reviewed

    Polkovskyi after Daniel, Couzo, Ostashev, de Winter, Chaoweeraprasit, Levy · Mishapolk refinements 2026-10-23 · packet · packet · register

  18. 2026-10-28 published T-255 · n=307

    Couzo's certificates of ntumlnoob's Kaggle packings at 260 and 307, below T-225 and T-174

    V3 C3 Upper bound confirmed superseded by T-256

    Couzo after ntumlnoob, Daniel, Levy · Couzo a5a5d76 2026-10-28 · packet · packet · register

  19. 2026-10-28 published T-256 · n=307

    Couzo's packings from Kaggle notebook packings at 232, 260 and 307, below T-186, T-225 and T-174

    V3 C3 Upper bound confirmed

    Couzo after Chilton, ntumlnoob, Lavrentev, Ellsworth, Daniel, Levy · Couzo issue 844 2026-10-28 · packet · register