mme_omega_eq_strassen
Provedalgebraic-complexitymatrix-multiplicationtensor-rank
The two encodings of tensor rank agree, so the two 's coincide: .
There is a single rank with two equivalent descriptions (Wigderson–Zuiddam): the least number of rank-one tensors summing to (tensorRank), and the least such that is a restriction of the diagonal unit tensor in the Strassen preorder (strassenRank). Since these agree on every tensor, the resulting matrix-multiplication exponents are equal:
This is the abstraction bridge: it lets the bound be proved in the Strassen-preorder world while the mission keeps its plain tensor-rank statement.
Preamble
import Definitions.Def_mme_omega import Definitions.Def_mme_omega_strassen universe u open MME
Formal statement
theorem mme_omega_eq_strassen {K : Type u} [Field K] : matMulExp K = matMulExp_strassen K := by sorrySource