English

Extractors for Images of Varieties

Computational Complexity 2023-01-18 v2 Algebraic Geometry

Abstract

We construct explicit deterministic extractors for polynomial images of varieties, that is, distributions sampled by applying a low-degree polynomial map f:FqrFqnf : \mathbb{F}_q^r \to \mathbb{F}_q^n to an element sampled uniformly at random from a kk-dimensional variety VFqrV \subseteq \mathbb{F}_q^r. This class of sources generalizes both polynomial sources, studied by Dvir, Gabizon and Wigderson (FOCS 2007, Comput. Complex. 2009), and variety sources, studied by Dvir (CCC 2009, Comput. Complex. 2012). Assuming certain natural non-degeneracy conditions on the map ff and the variety VV, which in particular ensure that the source has enough min-entropy, we extract almost all the min-entropy of the distribution. Unlike the Dvir-Gabizon-Wigderson and Dvir results, our construction works over large enough finite fields of arbitrary characteristic. One key part of our construction is an improved deterministic rank extractor for varieties. As a by-product, we obtain explicit Noether normalization lemmas for affine varieties and affine algebras. Additionally, we generalize a construction of affine extractors with exponentially small error due to Bourgain, Dvir and Leeman (Comput. Complex. 2016) by extending it to all finite prime fields of quasipolynomial size.

Keywords

Cite

@article{arxiv.2211.14497,
  title  = {Extractors for Images of Varieties},
  author = {Zeyu Guo and Ben Lee Volk and Akhil Jalan and David Zuckerman},
  journal= {arXiv preprint arXiv:2211.14497},
  year   = {2023}
}

Comments

v2: fixed a gap in the proof of the effective fiber dimension theorem in Appendix B