A Lower Bound for Polynomial Calculus with Extension Rule

Alekseev, Yaroslav

doi:10.4230/lipics.ccc.2021.21

Cited by 4 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also mention a recent work of Alekseev [Ale21], who proved lower bounds on the bit-size of refutations in a version of PC augmented with an extension rule. This is somewhat incomparable to our result: Alekseev's proof system allows for proofs of arbitrary depth, but must pay to use constants of large bit complexity; on the other hand, we work with a low-depth proof system that can use arbitrary rational numbers (or even arbitrary complex numbers) for free.…”

Section: Lower Bounds For the Ideal Proof Systemmentioning

confidence: 99%

Ideals, Determinants, and Straightening: Proving and Using Lower Bounds for Polynomial Ideals

Andrews,

Forbes

2021

Preprint

View full text Add to dashboard Cite

We show that any nonzero polynomial in the ideal generated by the r × r minors of an n × n matrix X can be used to efficiently approximate the determinant. Specifically, for any nonzero polynomial f in this ideal, we construct a small depth-three f -oracle circuit that approximates the Θ(r 1/3 ) × Θ(r 1/3 ) determinant in the sense of border complexity. For many classes of algebraic circuits, this implies that every nonzero polynomial in the ideal generated by r × r minors is at least as hard to approximately compute as the Θ(r 1/3 ) × Θ(r 1/3 ) determinant. We also prove an analogous result for the Pfaffian of a 2n × 2n skew-symmetric matrix and the ideal generated by Pfaffians of 2r × 2r principal submatrices.This answers a recent question of Grochow [Gro20, Conjecture 6.3] about complexity in polynomial ideals in the setting of border complexity. Leveraging connections between the complexity of polynomial ideals and other questions in algebraic complexity, our results provide a generic recipe that allows lower bounds for the determinant to be applied to other problems in algebraic complexity. We give several such applications, two of which are highlighted below.• We prove new lower bounds for the Ideal Proof System of Grochow and Pitassi. Specifically, we give super-polynomial lower bounds for refutations computed by low-depth circuits. This extends the recent breakthrough low-depth circuit lower bounds of Limaye, Srinivasan, and Tavenas [LST21] to the setting of proof complexity. Moreover, we show that for many natural circuit classes, the approximative proof complexity of our hard instance is governed by the approximative circuit complexity of the determinant.

show abstract

Section: Lower Bounds For the Ideal Proof Systemmentioning

confidence: 99%