we-solve (beta)

CS-119 · computer science · mathematics · Algorithms and data structures

Matrix-multiplication improvement over every field

Status OpenLLM status Open unverified

Statement

Definitions and mathematical statement

Statement recorded in the supplied source.
For every fixed field F, is its square arithmetic matrix-multiplication exponent strictly below 2.371054887, without a characteristic restriction?

Short English statement

For every fixed field F, is its square arithmetic matrix-multiplication exponent strictly below 2.371054887, without a characteristic restriction?

Sources

Statement licence: CC-BY-4.0 · Source file

Contributions 1

CS-119-A1 · Literature report · LLM-generated · unknown ·

OpenAI claim summary for CS-119

The result supplies the conclusion in this problem with its displayed hypotheses and quantifiers. The broader statements and applications in the manuscript are kept separate from the particular question above. The supporting result is manuscript 1 (family 107; 2026-09-24). The manuscript also gives additional strength beyond the requested conclusion; that excess is not required for this problem's solved-claim label.

Matrix-multiplication improvement over every field

OpenAI's claim

OpenAI presents the following claims relevant to this question, with manuscript numbers following paper order in Sources. In manuscript 1 (family 107; 2026-09-24), the asserted result is that the square multiplication exponent is below $2.371054886006746$ over every fixed field, including every positive characteristic.

Mathematical statement of the claimed result

Manuscript 1.
For every fixed field $F$, the claimed arithmetic exponent of square matrix multiplication satisfies \[ \omega_F<2.371054886006746<2.371054887. \] The exponent is the infimum of asymptotic powers achievable by exact field operations, allowing an arbitrarily small additive exponent slack. Positive and zero characteristics are both included.

Outline of the argument

For manuscript 1 (family 107; 2026-09-24), a joint extraction from several tensor depths uses entropy and a common modular hash. Sequential deletion assigns variables compatibly, and exact integer tables repair inherited masks; the resulting direct sum is converted to an exponent bound by the rank comparison.

Formal verification

For manuscript 1 (family 107; 2026-09-24), OpenAI lists Lean statements for this assertion: the square multiplication exponent is below $2.371054886006746$ over every fixed field, including every positive characteristic.

The selected statement includes the clause used for this problem.

The linked family Comparator checks are MatrixFields.lean, MatrixMultiplication.lean.

Their named declarations include OAI.MatrixAllFields.MatrixMultiplication.AllFieldMain.omega_lt_source_constant, OAI.MatrixMultiplication.complex_alpha_gt_93_div_200, OAI.MatrixMultiplication.complex_omega_le_nine_quarters, OAI.MatrixMultiplication.complex_rectangular_omega_lt_523_div_250.

This site has not executed the Lean code. Described statement coverage is not an independent proof check.

Status caveat

The manuscripts were produced by an internal OpenAI model. OpenAI cautions that results without formalization can contain mistakes. This site has not independently checked the proofs; the label records the scope of OpenAI's claim.

Sources

Go to contribution →