On the Existence of Algebraically Natural Proofs [article]

Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse
<span title="2021-01-08">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
For every constant c > 0, we show that there is a family P_N, c of polynomials whose degree and algebraic circuit complexity are polynomially bounded in the number of variables, that satisfies the following properties: * For every family f_n of polynomials in VP, where f_n is an n variate polynomial of degree at most n^c with bounded integer coefficients and for N = n^c + nn, P_N,c vanishes on the coefficient vector of f_n. * There exists a family h_n of polynomials where h_n is an n variate
more &raquo; ... ynomial of degree at most n^c with bounded integer coefficients such that for N = n^c + nn, P_N,c does not vanish on the coefficient vector of h_n. In other words, there are efficiently computable equations for polynomials in VP that have small integer coefficients. In fact, we also prove an analogous statement for the seemingly larger class VNP. Thus, in this setting of polynomials with small integer coefficients, this provides evidence against a natural proof like barrier for proving algebraic circuit lower bounds, a framework for which was proposed in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017). Our proofs are elementary and rely on the existence of (non-explicit) hitting sets for VP (and VNP) to show that there are efficiently constructible, low degree equations for these classes. Our proofs also extend to finite fields of small size.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2004.14147v2">arXiv:2004.14147v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4ikspq4ebjeuxnscucjccfx4by">fatcat:4ikspq4ebjeuxnscucjccfx4by</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200502034517/https://arxiv.org/pdf/2004.14147v1.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2004.14147v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>