A lower bound for $\langle 3,2,m \rangle$ matrix multiplication

2026-09-18

AI Summary

本文证明了3x2矩阵与2xm矩阵乘法的双线性复杂度下界，并使用Lean 4形式验证了<3,2,5>矩阵乘法张量的确切秩为25。

Abstract

We prove that, over any field, the bilinear complexity of multiplying a $3\times 2$ matrix by a $2\times m$ matrix is strictly greater than $24m/5$. In particular, every exact bilinear algorithm for multiplying a $3\times 2$ matrix by a $2\times 5$ matrix requires at least $25$ multiplications. Together with the Hopcroft-Kerr upper bound, this proves that the $\langle 3,2,5\rangle$ matrix multiplication tensor has rank exactly $25$. The proof has been formally verified in Lean 4, with the formalization available at https://github.com/fallnlove/mm325_proof.

Problem

• matrix multiplication
• bilinear complexity
• lower bound

Innovation

• bilinear complexity
• matrix multiplication tensor
• formal verification