OpenAI · 107-03 · 2026-09-24 · Theoretical computer science
Staggered extraction for exact matrix multiplication over every field
preprints/Staggered-extraction-for-exact-matrix-multiplication-over-every-field-September-24-2026
Family 107. Matrix multiplication with exponent at most .
The authors are OpenAI. This companion does not verify the proof and does not adopt it as a theorem of Ngo Cheung’s series. It is not a premise. O.1 stays NOT_CLOSED. Anti-de Sitter results are not a de Sitter state, not Em02-E’s relational lapse, not XVI-P’s QdS scheme, and not XVI-Q’s sigma-image record. No quantum coefficient is admitted. No compilation is asserted.
Read against the standing problems
Standing problems. No standing problem is named in this text. It was still read against the nine problems and does not close any of them. The authors are OpenAI. The companion does not verify the proof. This is not a premise of a manuscript by Ngo Cheung. O.1 stays NOT_CLOSED. No quantum coefficient is admitted. No compilation is asserted. XVI-P · XVI-N
Proves over , giving arithmetic operations for square matrix multiplication. In characteristic zero, some inner dimension with permits rectangular multiplication. Further square bounds give outside finitely many positive characteristics and over every fixed field.
We prove that the arithmetic exponent of square matrix multiplication over every fixed field satisfies ω < 2.371054886006746. This includes every positive characteristic.
Preprint source and Lean scope
The abstract above is the catalogue abstract. The sections below are the full preprint source, 0 sections. This page is not only the abstract. The manuscript file is loading.
This preprint is named in the Lean scope note for 107: Matrix multiplication with exponent at most 9/4. The authors are OpenAI. This companion does not verify the formalization. It is not a premise. The OAI library is not imported. No compilation is asserted. O.1 stays NOT_CLOSED.