Theoretical computer science·OpenAI Math·Result 107·Lean formalisation listed
Matrix multiplication with exponent at most 9/4
One of the 372 results in OpenAI's public mathematics catalogue, filed under theoretical computer science: 2 preprints, the latest dated 2 October 2026. This page quotes OpenAI's own summary of the claim, links the papers and abstracts, and embeds the animation.
Also known as matrix multiplication exponent 9/4; omega at most 9/4
In one line: OpenAI reports a result titled ‘Matrix multiplication with exponent at most 9/4’ (theoretical computer science) in 2 preprints, the latest dated 2 October 2026. It has not been peer reviewed. The channel's animation, Every OpenAI Math Result, Part 4 of 4: L = BPL, Integer Multiplication and 82 More, is on YouTube.
Chapter 8 of 84 in Every OpenAI Math Result, Part 4 of 4: L = BPL, Integer Multiplication and 82 More · starts at 2:26 · watch from there on YouTube →
What OpenAI claims
Proves ω ≤ 9/4 over ℂ, giving Oε(n9/4+ε) arithmetic operations for square matrix multiplication. In characteristic zero, some inner dimension na with a > 0.465 permits n2+o(1) rectangular multiplication. Further square bounds give ω < 2.258 outside finitely many positive characteristics and ω < 2.371054886006746 over every fixed field. (Lean)
Papers (2)
An Upper Bound of 9/4 for the Matrix Multiplication Exponent
OpenAI's abstract We prove that the exponent of matrix multiplication over the complex numbers is at most 9/4.
Staggered extraction for exact matrix multiplication over every field
OpenAI's abstract We prove that the arithmetic exponent of square matrix multiplication over every fixed field satisfies ω < 2.371054886006746. This includes every positive characteristic.
Status
Preprint. The papers have not been independently reviewed. Treat the result as OpenAI's claim until other mathematicians have checked it. If a video exists, it illustrates the statement; it is not the proof.
Quick answers
- Is it proven?
- Not independently yet. OpenAI posted 2 preprints, the latest dated 2 October 2026; it has not been peer reviewed, so treat the result as OpenAI's claim until other mathematicians have checked it.
- What exactly does OpenAI claim?
- Proves ω ≤ 9/4 over ℂ, giving Oε(n9/4+ε) arithmetic operations for square matrix multiplication. In characteristic zero, some inner dimension na with a > 0.465 permits n2+o(1) rectangular multiplication. Further square bounds give ω < 2.258 outside finitely many positive characteristics and ω < 2.371054886006746 over every fixed field. (Lean)
- Where is the proof?
- In the paper, An Upper Bound of 9/4 for the Matrix Multiplication Exponent (PDF).
- Is there a video?
- Yes, on YouTube (29:10, chapter 8).
Also in
- Chapter 6 of 9 in L = BPL, Matrix Multiplication Exponent, Integer Multiplication and 6 More · starts at 1:43 · watch from there on YouTube →
The video
Every OpenAI Math Result, Part 4 of 4: L = BPL, Integer Multiplication and 82 More · Compilation · 29:10 · chapter 8 from 2:26 · description, sources and chapters →
Related results in Theoretical computer science
- 108A cubic permanent–determinant lower boundVideoLean
- 109Integer multiplication below n log nVideo
- 110Optimal-order randomized k-server on arbitrary metricsVideoLean
- 111One-sample matroid prophet inequalities against an almighty adversaryVideoLean
- 112Beyond the square-root exponent for depth-three circuitsVideoLean
- 113Approximate counting and entropy of perfect matchingsVideoLean