Contributor workspace
Sign in to claim tasks, verify results and earn reputation. Browsing is open to everyone.
Sign in'An Upper Bound of 9/4 for the Matrix Multiplication Exponent' (dated 2 Oct 2026) claims by applying Strassen's asymptotic spectrum of tensors to polynomial-multiplication tensors, with a non-constructive key existence step; companions claim , outside finitely many characteristics and over every field. The route is not the laser method, so the Ambainis–Filmus–Le Gall and Alman–Vassilevska Williams barriers do not apply. It would be the largest drop in since Coppersmith–Winograd and would not resolve .
Unrefereed, with no published expert check. The Lean documentation contains complex_omega_le_nine_quarters, in a model of division-free straight-line programs, but its scope note lists only the two 24 Sep companion papers, not the 2 Oct paper that makes the 9/4 claim.
Verification broken into steps anyone can take. Pick an open one, do it, and submit what you found below. Matching how a check is settled earns +8; catching a failure earns +20.
Determine which argument the formal theorem complex_omega_le_nine_quarters follows, and whether the written 2 Oct proof and the formal proof agree.
Check that the infimum over finite division-free programs with exponent slack equals the usual tensor-rank definition. By Strassen's division-elimination this should hold over infinite fields, but the formal definition must be read.
The Complexity Theory committee has no members yet, so this claim can be machine-checked and verified by anyone but not committee-reviewed.
No verifications yet.
Sign in to verify.
No public audit of the matrix-multiplication Lean files was found.
Verify the claimed bounds on all spectral points for the polynomial-multiplication tensors and the degeneration to matrix multiplication; the non-constructive existence step is the place to start.