A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Matrix multiplication with exponent at most $9/4$
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Gaussian Moat Hopper <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:algorithms, speed Levels:3
Category:Theoretical computer science Lean version:YES! ✔
Rate this game! 4.8 out of 5 (2,188 votes)

>>> How to Play <<<
Matrix multiplication with exponent at most 9/4. Proves $\omega\le9/4$ over ℂ, giving $O_\varepsilon(n^{9/4+\varepsilon})$ arithmetic operations for square matrix multiplication. In characteristic zero, some inner dimension na with a > 0.465 permits $n^{2+o(1)}$ rectangular multiplication. Further square bounds give ω < 2.258 outside finitely many positive characteristics and ω < 2.371054886006746 over every fixed field.

>>> Level Select <<<
released 2026-10-02  |  1 theorem · 6 lemmas · 9 proofs · 5,172 words  |  PLAY LEVEL 1 »  (pdf)
We prove that the exponent of matrix multiplication over the complex numbers is at most 9/4.
released 2026-09-24  |  7 theorems · 26 lemmas · 44 proofs · 35,747 words  |  PLAY LEVEL 2 »  (pdf)
— secondary writeup Over every field of characteristic zero, we prove that the square matrix-multiplication exponent satisfies ω < 2.258, the dual exponent satisfies α > 0.465, and $\omega(1,0.709,1)\lt 2.092$. The strict square and k = 0.709 rectangular bounds also hold over every field except possibly in one finite set of positive characteristics, in the arithmetic-operation model.
released 2026-09-24  |  2 theorems · 6 lemmas · 11 proofs · 15,593 words  |  PLAY LEVEL 3 »  (pdf)
We prove that the arithmetic exponent of square matrix multiplication over every fixed field satisfies ω < 2.371054886006746. This includes every positive characteristic.

More Theoretical computer science Games!
Exponential semidefinite complexity of perfect matchingThe asymptotic Gotsman–Linial conjectureA factor-two approximation for shortest common superstringExponential state costs for two-way automata
Fourier transforms below $n\log n$ HOT!Polynomial mixing of graph switches with prescribed degreesA counterexample to the quadratic sensitivity conjectureThe complexity of Weisfeiler–Leman refinement

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games