What the ETH refutations do not give: barriers for the counting engines, with machine-checked lemmas

Get email updates

Vaibhav Tulsyan

For the graph tensor on a 3×33 \times 3 grid with 18 edges joining cells in different rows and columns, take any finite sum of tensors equal to the graph tensor over a field. For each summand, take the smaller of the two matrix ranks obtained by cutting off the last row or the last column. If the edge labels range over a nonempty alphabet of size NN, the sum of these smaller ranks is at least N8N^8.

What was already known

Majdoddin bounded a class of grid recursions that rewrites local constraints and merges terms built as products. He identified decompositions with correlated terms as a case outside that argument.

AI involvement AI-led

Vaibhav Tulsyan says Claude drafted the mathematical arguments and Lean proofs. Tulsyan chose the problems, directed the work and reviewed the theorem statements and the scope of the checks.

Importance Notable

The bound applies to arbitrary summands of this grid tensor. A single contraction gives a rank estimate for both cuts, even when the terms do not factor as products.

Technical verification Formal (Lean 4)

Tulsyan reports Lean kernel checking for the rank inequality in Theorem 4.11. The pinned declaration covers arbitrary finite sums over a field and a nonempty finite alphabet. The separate step from matrix ranks to the cost of a network is given on paper.

Formal checking

Tulsyan reports Lean kernel checking for the rank inequality in Theorem 4.11. The pinned declaration covers arbitrary finite sums over a field and a nonempty finite alphabet. The separate step from matrix ranks to the cost of a network is given on paper.

Checker
Lean 4 kernel, reported by Vaibhav Tulsyan
Scope
Theorem 4.11 rank inequality for the 3×33 \times 3 grid
Basis
Reported by the linked checker

Human understanding Few

Tulsyan reports reviewing the statements and the scope of verification. The source credits Claude with drafting the contraction argument and does not identify a human explanation of it.

Correction and publication history

2026-11-08 · publication

Source-reviewed lower bound on the smaller-cut rank sum, with central Claude work and a scoped Lean check.

Read this published revision