Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Matrix Multiplication Exponent < 2.371177

Proved
mme_omega_lt_2371177

by xuanji · Sep 27, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

For every field KKK, the matrix multiplication exponent satisfies ωK<2.371177\omega_K < 2.371177ωK​<2.371177.

Preamble
import Definitions.Def_mme_omega
universe u
open MME
Formal statement
theorem mme_omega_lt_2371177 {K : Type u} [Field K] :
    matMulExp K < 2371177 / 1000000 := by sorry
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Statement. For every universe level and every field KKK (any characteristic, finite or infinite, no further assumptions):

ωK<23711771000000=2.371177,\omega_K < \frac{2371177}{1000000} = 2.371177,ωK​<10000002371177​=2.371177,

where ωK\omega_KωK​ is the real number matMulExp K, defined below. The inequality is strict.

Definition of ωK\omega_KωK​. For n∈Nn\in\mathbb Nn∈N, let ⟨n,n,n⟩\langle n,n,n\rangle⟨n,n,n⟩ be the matrix-multiplication tensor over KKK: its three mode spaces are Kn×nK^{n\times n}Kn×n (functions {0,…,n−1}2→K\{0,\dots,n-1\}^2\to K{0,…,n−1}2→K), and

⟨n,n,n⟩=∑i,j,k=0n−1eij⊗ejk⊗eki.\langle n,n,n\rangle=\sum_{i,j,k=0}^{n-1} e_{ij}\otimes e_{jk}\otimes e_{ki}.⟨n,n,n⟩=i,j,k=0∑n−1​eij​⊗ejk​⊗eki​.

Let R(T)R(T)R(T) denote the ordinary (textbook) tensor rank: the least r∈Nr\in\mathbb Nr∈N such that TTT is a sum of rrr pure tensors u1⊗u2⊗u3u_1\otimes u_2\otimes u_3u1​⊗u2​⊗u3​ (this is rank, not border rank; R(0)=0R(0)=0R(0)=0). Then

ωK=inf⁡n∈Nf(n),f(n)={log⁡R(⟨n,n,n⟩)log⁡n,n≥2,3,n∈{0,1},\omega_K=\inf_{n\in\mathbb N} f(n),\qquad f(n)=\begin{cases}\dfrac{\log R(\langle n,n,n\rangle)}{\log n}, & n\ge 2,\\[4pt] 3, & n\in\{0,1\},\end{cases}ωK​=n∈Ninf​f(n),f(n)=⎩⎨⎧​lognlogR(⟨n,n,n⟩)​,3,​n≥2,n∈{0,1},​

with log⁡\loglog the natural logarithm (the ratio does not depend on the base).

Edge cases.

  • The infimum is over all n∈Nn\in\mathbb Nn∈N; the values n=0,1n=0,1n=0,1 contribute the constant 333, so ωK≤3\omega_K\le 3ωK​≤3 always.
  • For n≥2n\ge 2n≥2 the tensor ⟨n,n,n⟩\langle n,n,n\rangle⟨n,n,n⟩ is nonzero, so R≥1R\ge 1R≥1 and log⁡R≥0\log R\ge 0logR≥0, while log⁡n>0\log n>0logn>0; hence every f(n)≥0f(n)\ge 0f(n)≥0, the family is bounded below and nonempty, and the infimum is the genuine real infimum (no junk value from an unbounded-below infimum, no log⁡0\log 0log0 junk).
  • Only square products ⟨n,n,n⟩\langle n,n,n\rangle⟨n,n,n⟩ are used, and only exact rank (not border rank or asymptotic rank) enters the definition.
  • ωK\omega_KωK​ is defined separately for each field KKK; the claim is asserted for every field simultaneously.
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by xuanji · Sep 27, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me