A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits

We show that there is a defining equation of degree at most 𝗉𝗈𝗅𝗒(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^2-variate polynomial P ∈𝔽(x_1, 1, …, x_n, n) of degree at most 𝗉𝗈𝗅𝗒(n) such that every matrix M which can be written as a sum of a matrix of rank at most n/100 and sparsity at most n^2/100 satisfies P(M) = 0. This confirms a conjecture of Gesmundo, Hauenstein, Ikenmeyer and Landsberg [GHIL16] and improves the best upper bound known for this problem down from (n^2) [KLPS14, GHIL16] to 𝗉𝗈𝗅𝗒(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^2/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 [SV15] 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.

• 27 publications
• 11 publications
research
02/24/2021

Kronecker Products, Low-Depth Circuits, and Matrix Rigidity

For a matrix M and a positive integer r, the rank r rigidity of M is the...
research
04/30/2019

Derandomization from Algebraic Hardness: Treading the Borders

A hitting-set generator (HSG) is a polynomial map Gen:F^k →F^n such that...
research
06/03/2021

On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices

We investigate the complexity of computing the Zariski closure of a fini...
research
11/09/2022

Smaller Low-Depth Circuits for Kronecker Powers

We give new, smaller constructions of constant-depth linear circuits for...
research
12/09/2019

Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits

The determinant can be computed by classical circuits of depth O(log^2 n...
research
02/16/2022

Identity Testing for Radical Expressions

We study the Radical Identity Testing problem (RIT): Given an algebraic ...
research
08/04/2017

Matrix rigidity and the Croot-Lev-Pach lemma

Matrix rigidity is a notion put forth by Valiant as a means for proving ...

Please sign up or login with your details

Forgot password? Click here to reset