Fourier and circulant matrices are not rigid

Zeev Dvir, Allen Liu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations


The concept of matrix rigidity was first introduced by Valiant in [12]. Roughly speaking, a matrix is rigid if its rank cannot be reduced significantly by changing a small number of entries. There has been extensive interest in rigid matrices as Valiant showed in [12] that rigidity can be used to prove arithmetic circuit lower bounds. In a surprising result, Alman and Williams showed that the (real valued) Hadamard matrix, which was conjectured to be rigid, is actually not very rigid. This line of work was extended by [3] to a family of matrices related to the Hadamard matrix, but over finite fields. In our work, we take another step in this direction and show that for any abelian group G and function f : G → C, the matrix given by Mxy = f(x − y) for x, y ∈ G is not rigid. In particular, we get that complex valued Fourier matrices, circulant matrices, and Toeplitz matrices are all not rigid and cannot be used to carry out Valiant’s approach to proving circuit lower bounds. This complements a recent result of Goldreich and Tal [5] who showed that Toeplitz matrices are nontrivially rigid (but not enough for Valiant’s method). Our work differs from previous non-rigidity results in that those works considered matrices whose underlying group of symmetries was of the form Fnp with p fixed and n tending to infinity, while in the families of matrices we study, the underlying group of symmetries can be any abelian group and, in particular, the cyclic group ZN, which has very different structure. Our results also suggest natural new candidates for rigidity in the form of matrices whose symmetry groups are highly non-abelian. Our proof has four parts. The first extends the results of [1,3] to generalized Hadamard matrices over the complex numbers via a new proof technique. The second part handles the N × N Fourier matrix when N has a particularly nice factorization that allows us to embed smaller copies of (generalized) Hadamard matrices inside of it. The third part uses results from number theory to bootstrap the non-rigidity for these special values of N and extend to all sufficiently large N. The fourth and final part involves using the non-rigidity of the Fourier matrix to show that the group algebra matrix, given by Mxy = f(x − y) for x, y ∈ G, is not rigid for any function f and abelian group G.

Original languageEnglish (US)
Title of host publication34th Computational Complexity Conference, CCC 2019
EditorsAmir Shpilka
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771160
StatePublished - Jul 1 2019
Externally publishedYes
Event34th Computational Complexity Conference, CCC 2019 - New Brunswick, United States
Duration: Jul 18 2019Jul 20 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference34th Computational Complexity Conference, CCC 2019
Country/TerritoryUnited States
CityNew Brunswick

All Science Journal Classification (ASJC) codes

  • Software


  • Circulant matrix
  • Fourier matrix
  • Rigidity


Dive into the research topics of 'Fourier and circulant matrices are not rigid'. Together they form a unique fingerprint.

Cite this