Low Rank Matrix Rigidity: Tight Lower Bounds and Hardness Amplification

For an N × N matrix A, its rank-r rigidity, denoted R A (r), is the minimum number of entries of A that one must change to make its rank become at most r. Determining the rigidity of interesting explicit families of matrices remains a major open problem, and is central to understanding the complexities of these matrices in many different models of computation and communication. We focus in this paper on the Walsh-Hadamard transform and on the 'distance matrix', whose rows and columns correspond to binary vectors, and whose entries calculate whether the row and column are close in Hamming distance. Our results also generalize to other Kronecker powers and 'Majority powers' of fixed matrices. We prove two new results about such matrices. First, we prove new rigidity lower bounds in the low-rank regime where r < log N . For instance, we prove that over any finite field, there are constants and a similar lower bound for the other aforementioned matrices. This is tight, and is the new best rigidity lower bound for an explicit matrix family at this rank; the previous best was R(c 1 log N ) ≥ c 3 N 2 for a small constant c 3 > 0. It also rules out an improvement to the current best constant-depth linear circuits for H n and other Kronecker powers by using asymptotic improvements to low-rank rigidity upper bounds; the current best uses the rank-1 rigidity of constant-sized matrices. Second, we give new hardness amplification results, showing that rigidity lower bounds for these matrices for slightly higher rank would imply breakthrough rigidity lower bounds for much higher rank. For instance, if one could prove over any finite field for some ε > 0, this would imply that H n is Razborov rigid, giving a breakthrough lower bound in communication complexity. This may help explain why our best rigidity lower bounds for explicit matrices are stuck: there seems to be a big gap between what is known and what is required in the rank regime for Razborov rigidity, but our new required lower bound for rank log 1+ε N appears close to what current techniques can prove.