More barriers for rank methods, via a 'numeric to symbolic' transfer

Ankit Garg, Visu Makam, Rafael Oliveira, Avi Wigderson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

We prove new barrier results in arithmetic complexity theory, showing severe limitations of natural lifting (aka escalation) techniques. For example, we prove that even optimal rank lower bounds on k-Tensors cannot yield non-Trivial lower bounds on the rank of d-Tensors, for any constant d larger than k. This significantly extends recent barrier results on the limits of (matrix) rank methods by [EGOW17], which handles the (very important) case k=2. Our generalization requires the development of new technical tools and results in algebraic geometry, which are interesting in their own right and possibly applicable elsewhere. The basic issue they probe is the relation between numeric and symbolic rank of tensors, essential in the proofs of previous and current barriers. Our main technical result implies that for every symbolic k-Tensor (namely one whose entries are polynomials in some set of variables), if the tensor rank is small for every evaluation of the variables, then it is small symbolically. This statement is obvious for k=2. To prove an analogous statement for k larger than 2 we develop a 'numeric to symbolic'' transfer of algebraic %analytic relations to algebraic %analytic functions, somewhat in the spirit of the implicit function theorem. It applies in the general setting of inclusion of images of polynomial maps, in the form appearing in Raz's elusive functions approach to proving VP ≠ VNP. We give a toy application showing how our transfer theorem may be useful in pursuing this approach to prove arithmetic complexity lower bounds.

Original languageEnglish
Title of host publicationProceedings - 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS 2019
PublisherIEEE Computer Society
Pages824-844
Number of pages21
ISBN (Electronic)9781728149523
DOIs
StatePublished - Nov 2019
Externally publishedYes
Event60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019 - Baltimore, United States
Duration: 9 Nov 201912 Nov 2019

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume2019-November
ISSN (Print)0272-5428

Conference

Conference60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019
Country/TerritoryUnited States
CityBaltimore
Period9/11/1912/11/19

Bibliographical note

Publisher Copyright:
© 2019 IEEE.

Keywords

  • Barriers
  • Lifting
  • Rank methods
  • Tensor rank
  • Waring rank

Fingerprint

Dive into the research topics of 'More barriers for rank methods, via a 'numeric to symbolic' transfer'. Together they form a unique fingerprint.

Cite this