English

Sharp Effective Finite-Field Nullstellensatz

Combinatorics 2022-09-14 v3 Computational Complexity Commutative Algebra

Abstract

The (weak) Nullstellensatz over finite fields says that if P1,,PmP_1,\ldots,P_m are nn-variate degree-dd polynomials with no common zero over a finite field F\mathbb{F} then there are polynomials R1,,RmR_1,\ldots,R_m such that R1P1++RmPm1R_1P_1+\cdots+R_mP_m \equiv 1. Green and Tao [Contrib. Discrete Math. 2009, Proposition 9.1] used a regularity lemma to obtain an effective proof, showing that the degrees of the polynomials RiR_i can be bounded independently of nn, though with an Ackermann-type dependence on the other parameters mm, dd, and F|\mathbb{F}|. In this paper we use the polynomial method to give a proof with a degree bound of md(F1)md(|\mathbb{F}|-1). We also show that the dependence on each of the parameters is the best possible up to an absolute constant. We further include a generalization, offered by Pete L. Clark, from finite fields to arbitrary subsets in arbitrary fields, provided the polynomials PiP_i take finitely many values on said subset.

Keywords

Cite

@article{arxiv.2111.09305,
  title  = {Sharp Effective Finite-Field Nullstellensatz},
  author = {Guy Moshkovitz and Jeffery Yu},
  journal= {arXiv preprint arXiv:2111.09305},
  year   = {2022}
}

Comments

Various minor changes, to appear in the American Mathematical Monthly

R2 v1 2026-06-24T07:42:34.908Z