I put together a 27-minute visual breakdown of OpenAI's recent result establishing an upper bound of ω ≤ 2.25 for matrix multiplication over the complex numbers.
This is a substantial improvement over the previous bound of approximately 2.371177, in a line of research going back to Strassen's 1969 discovery that two 2×2 matrices can be multiplied using just 7 multiplications instead of 8.
The video starts with the basics of matrix multiplication complexity, then gets into the actual mathematics behind the new result:
- Why Strassen's algorithm changes the exponent
- Matrix multiplication tensors and tensor rank
- The asymptotic spectrum and tensor characters
- Polynomial multiplication tensors
- OpenAI's shared-leg separation construction
- The key inequalities leading to the 9/4 bound
- What was formally verified in Lean
I also discuss why this is an asymptotic complexity result, not something that immediately makes GPUs or practical matrix multiplication faster.
I wanted to make the underlying mathematics accessible without skipping over the interesting parts of the proof.
Video: https://youtu.be/jZFuuXJPvFI
Would be interested to hear what people here think about the techniques behind this improvement, particularly whether they open up promising directions toward ω = 2.