Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (p. 5). Let be a field and . For let and be finite nonempty subsets of with , and put
Multiplicity, and the sums over are as on the Theorem 3.1 page.
Theorem 4.1 (p. 5). Suppose has a zero of multiplicity at least at every point of except at at least one point of , where its multiplicity is less than . Then there are polynomials with , and a nonzero polynomial with , such that
If moreover is nonzero at some point of , then
Reading. The print writes for the coefficients . The hypothesis is read as multiplicity at least at every point of and multiplicity less than at some point of ; the proof uses it in this form. For the degree bound needs the stronger hypothesis that is nonzero at a point of .
Proof pointer
Pp. 5–6. Reduce modulo the ideal generated by the products to a remainder , which is nonzero because is not in that ideal. For each , and hence have a zero of multiplicity on the whole grid, and Theorem 3.1 together with the form of shows that divides ; since is coprime to , it divides . For the degree bound the paper fixes an index attaining the maximum and a point of the smaller grid where is nonzero, and shows that divides the nonzero one-variable restriction of through .
Read depth
Claims checked: the statement was read clause by clause against pp. 5–6 of the print, and the proof was followed.
Dependencies
Theorem 3.1. The 2011 erratum restates this theorem and corrects only Corollary 4.2.
Source. Simeon Ball and Oriol Serra, Punctured combinatorial Nullstellensätze, Combinatorica 29 (2009), 511–522, doi:10.1007/s00493-009-2509-z. Labels and page numbers are those of the corrected author manuscript dated 14 June 2011, the edition named on the source card.
Bears on
None recorded. The paper names no Erdős problem.