The rank of n×n matrix multiplication is at least

We prove that the rank of the n×n matrix multiplication is at least . The previous bounds were due to Landsberg [2], and due to Bläser [1]. Our bound improves the previous bounds for any n⩾24.