A Polynomial Degree Bound on Equations for Non-Rigid Matrices and Small Linear Circuits

Authors Mrinal Kumar, Ben Lee Volk

Thumbnail PDF


  • Filesize: 497 kB
  • 9 pages

Document Identifiers

Author Details

Mrinal Kumar
  • Department of Computer Science and Engineering, IIT Bombay, India
Ben Lee Volk
  • Department of Computer Science, University of Texas at Austin, TX, USA

Cite AsGet BibTex

Mrinal Kumar and Ben Lee Volk. A Polynomial Degree Bound on Equations for Non-Rigid Matrices and Small Linear Circuits. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 185, pp. 9:1-9:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)


We show that there is an equation of degree at most poly(n) for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large enough field 𝔽, there is a non-zero n²-variate polynomial P ∈ 𝔽[x_{1, 1}, …, x_{n, n}] of degree at most poly(n) such that every matrix M which can be written as a sum of a matrix of rank at most n/100 and a matrix of sparsity at most n²/100 satisfies P(M) = 0. This confirms a conjecture of Gesmundo, Hauenstein, Ikenmeyer and Landsberg [Fulvio Gesmundo et al., 2016] and improves the best upper bound known for this problem down from exp(n²) [Abhinav Kumar et al., 2014; Fulvio Gesmundo et al., 2016] to poly(n). We also show a similar polynomial degree bound for the (Zariski closure of the) set of all matrices M such that the linear transformation represented by M can be computed by an algebraic circuit with at most n²/200 edges (without any restriction on the depth). As far as we are aware, no such bound was known prior to this work when the depth of the circuits is unbounded. Our methods are elementary and short and rely on a polynomial map of Shpilka and Volkovich [Amir Shpilka and Ilya Volkovich, 2015] to construct low degree "universal" maps for non-rigid matrices and small linear circuits. Combining this construction with a simple dimension counting argument to show that any such polynomial map has a low degree annihilating polynomial completes the proof. As a corollary, we show that any derandomization of the polynomial identity testing problem will imply new circuit lower bounds. A similar (but incomparable) theorem was proved by Kabanets and Impagliazzo [Valentine Kabanets and Russell Impagliazzo, 2004].

Subject Classification

ACM Subject Classification
  • Theory of computation → Algebraic complexity theory
  • Theory of computation → Circuit complexity
  • Rigid Matrices
  • Linear Circuits
  • Degree Bounds
  • Circuit Lower Bounds


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Eric Allender, Robert Beals, and Mitsunori Ogihara. The complexity of matrix rank and feasible systems of linear equations. Comput. Complex., 8(2):99-126, 1999. URL: https://doi.org/10.1007/s000370050023.
  2. Josh Alman and Lijie Chen. Efficient construction of rigid matrices using an NP oracle. In Proceedings of the 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2019), pages 1034-1055. IEEE Computer Society, 2019. URL: https://doi.org/10.1109/FOCS.2019.00067.
  3. Amey Bhangale, Prahladh Harsha, Orr Paradise, and Avishay Tal. Rigid matrices from rectangular pcps. Electronic Colloquium on Computational Complexity (ECCC), 27:75, 2020. URL: https://eccc.weizmann.ac.il/report/2020/075.
  4. Markus Bläser and Christian Ikenmeyer. Introduction to geometric complexity theory. Lecture notes, 2017. URL: http://pcwww.liv.ac.uk/~iken/teaching_sb/summer17/introtogct/gct.pdf.
  5. Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, and Frank-Olaf Schreyer. Variety membership testing, algebraic natural proofs, and geometric complexity theory. CoRR, abs/1911.02534, 2019. URL: http://arxiv.org/abs/1911.02534.
  6. Allan Borodin, Joachim von zur Gathen, and John E. Hopcroft. Fast parallel matrix and GCD computations. Inf. Control., 52(3):241-256, 1982. URL: https://doi.org/10.1016/S0019-9958(82)90766-5.
  7. Michael A. Forbes, Amir Shpilka, and Ben Lee Volk. Succinct hitting sets and barriers to proving lower bounds for algebraic circuits. Theory of Computing, 14(1):1-45, 2018. URL: https://doi.org/10.4086/toc.2018.v014a018.
  8. Fulvio Gesmundo, Jonathan D. Hauenstein, Christian Ikenmeyer, and J. M. Landsberg. Complexity of linear circuits and geometry. Foundations of Computational Mathematics, 16(3):599-635, 2016. URL: https://doi.org/10.1007/s10208-015-9258-8.
  9. Joshua A. Grochow, Mrinal Kumar, Michael E. Saks, and Shubhangi Saraf. Towards an algebraic natural proofs barrier via polynomial identity testing. CoRR, abs/1701.01717, 2017. URL: http://arxiv.org/abs/1701.01717.
  10. Valentine Kabanets and Russell Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity, 13(1-2):1-46, 2004. Preliminary version in the 35th Annual ACM Symposium on Theory of Computing (STOC 2003). URL: https://doi.org/10.1007/s00037-004-0182-6.
  11. Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, and Jayalal Sarma. Using elimination theory to construct rigid matrices. Computational Complexity, 23(4):531-563, 2014. URL: https://doi.org/10.1007/s00037-013-0061-0.
  12. Satyanarayana V. Lokam. Complexity lower bounds using linear algebra. Foundations and Trends in Theoretical Computer Science, 4(1-2):1-155, 2009. URL: https://doi.org/10.1561/0400000011.
  13. Meena Mahajan and Jayalal Sarma. On the complexity of matrix rank and rigidity. Theory Comput. Syst., 46(1):9-26, 2010. URL: https://doi.org/10.1007/s00224-008-9136-8.
  14. Guillaume Malod and Natacha Portier. Characterizing valiant’s algebraic complexity classes. J. Complex., 24(1):16-38, 2008. URL: https://doi.org/10.1016/j.jco.2006.09.006.
  15. Ketan Mulmuley and Milind A. Sohoni. Geometric complexity theory I: an approach to the P vs. NP and related problems. SIAM J. Comput., 31(2):496-526, 2001. URL: https://doi.org/10.1137/S009753970038715X.
  16. Ran Raz. Elusive functions and lower bounds for arithmetic circuits. Theory of Computing, 6(7):135-177, 2010. URL: https://doi.org/10.4086/toc.2010.v006a007.
  17. Amir Shpilka and Ilya Volkovich. Read-once polynomial identity testing. Computational Complexity, 24(3):477-532, 2015. Preliminary version in the 40th Annual ACM Symposium on Theory of Computing (STOC 2008). URL: https://doi.org/10.1007/s00037-015-0105-8.
  18. Leslie G. Valiant. Graph-theoretic arguments in low-level complexity. In Jozef Gruska, editor, Proceedings of the 2nd Internationl Symposium on the Mathematical Foundations of Computer Science (MFCS 1977), volume 53 of Lecture Notes in Computer Science, pages 162-176. Springer, 1977. URL: https://doi.org/10.1007/3-540-08353-7_135.