Multiplying 9×109\times 10 by 10×1110\times 11 matrices with 640 multiplications

Canli gives an exact rank-at-most-640 bilinear scheme for the 9×109\times 10 by 10×1110\times 11 matrix product over the rationals. The formal proof also gives a bilinear algorithm over every field of characteristic zero.

What was already known

The submitted project traces its scheme to a rank-644 construction listed in the Lille catalogue for the same dimensions.

AI involvement AI-led

Canli directed the project. He credits Anthropic Claude agents with the search, exact checks, checker and proof of its correctness.

Importance Notable

This lowers the published upper bound for one rectangular matrix shape.

Technical verification Formal (Lean)

The project reports Lean kernel checks of the integer identities and a Lean proof that they certify the rational decomposition and the characteristic-zero algorithm.

Formal checking

The project reports Lean kernel checks of the integer identities and a Lean proof that they certify the rational decomposition and the characteristic-zero algorithm.

Checker
Lean kernel, as reported by Quantavane
Scope
Checked 90 integer slice identities with range and bound checks, then proved the corresponding bilinear identity.
Basis
Reported by the linked checker

Human understanding Few

The repository describes the search and the checker. It does not identify a human analysis of how the successful search steps were found.

Correction and publication history