New lower bounds on tensor rank of $(2,n,m)$ matrix multiplication with GPT-6

The tensor rank of $2\times n$-with-$n\times m$ matrix multiplication is at least $(n+2)m$ if $n\ge 4$ and at least $\lceil \frac{24}{5}m\rceil$ if $n=3$. Both lower bounds apply over arbitrary fields.