Wiki
Wiki

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 F\mathbb F be a field and f∈F[X1,…,Xn]f\in\mathbb F[X_1,\ldots,X_n]. For i=1,…,ni=1,\ldots,n let DiD_i and SiS_i be finite nonempty subsets of F\mathbb F with Di⊂SiD_i\subset S_i, and put

gi(Xi)=∏s∈Si(Xi−s),li(Xi)=∏d∈Di(Xi−d).g_i(X_i)=\prod_{s\in S_i}(X_i-s),\qquad l_i(X_i)=\prod_{d\in D_i}(X_i-d).

Multiplicity, T(n,t)T(n,t) and the sums over i∈τi\in\tau are as on the Theorem 3.1 page.

Theorem 4.1 (p. 5). Suppose ff has a zero of multiplicity at least tt at every point of S1×⋯×SnS_1\times\cdots\times S_n except at at least one point of D1×⋯×DnD_1\times\cdots\times D_n, where its multiplicity is less than tt. Then there are polynomials hτ∈F[X1,…,Xn]h_\tau\in\mathbb F[X_1,\ldots,X_n] with deg⁡hτ≤deg⁡f−∑i∈τdeg⁡gi\deg h_\tau\le\deg f-\sum_{i\in\tau}\deg g_i, and a nonzero polynomial uu with deg⁡u≤deg⁡f−∑i=1n(deg⁡gi−deg⁡li)\deg u\le\deg f-\sum_{i=1}^n(\deg g_i-\deg l_i), such that

f=∑τ∈T(n,t)gτ(1)⋯gτ(t)hτ+u∏i=1ngili.f=\sum_{\tau\in T(n,t)}g_{\tau(1)}\cdots g_{\tau(t)}h_\tau+u\prod_{i=1}^n\frac{g_i}{l_i}.

If moreover ff is nonzero at some point of D1×⋯×DnD_1\times\cdots\times D_n, then

deg⁡f≥(t−1)max⁡j(∣Sj∣−∣Dj∣)+∑i=1n(∣Si∣−∣Di∣).\deg f\ge(t-1)\max_j\bigl(|S_j|-|D_j|\bigr)+\sum_{i=1}^n\bigl(|S_i|-|D_i|\bigr).

Reading. The print writes deg⁡(hi)\deg(h_i) for the coefficients hτh_\tau. The hypothesis is read as multiplicity at least tt at every point of (S1×⋯×Sn)∖(D1×⋯×Dn)(S_1\times\cdots\times S_n)\setminus(D_1\times\cdots\times D_n) and multiplicity less than tt at some point of D1×⋯×DnD_1\times\cdots\times D_n; the proof uses it in this form. For t>1t>1 the degree bound needs the stronger hypothesis that ff is nonzero at a point of D1×⋯×DnD_1\times\cdots\times D_n.

Proof pointer

Pp. 5–6. Reduce ff modulo the ideal generated by the products gτ(1)⋯gτ(t)g_{\tau(1)}\cdots g_{\tau(t)} to a remainder ww, which is nonzero because ff is not in that ideal. For each ii, flitfl_i^t and hence wlitwl_i^t have a zero of multiplicity tt on the whole grid, and Theorem 3.1 together with the form of ww shows that gig_i divides wlitwl_i^t; since gi/lig_i/l_i is coprime to lil_i, it divides ww. For the degree bound the paper fixes an index jj attaining the maximum and a point dd of the smaller grid where ff is nonzero, and shows that (gj/lj)t−1(g_j/l_j)^{t-1} divides the nonzero one-variable restriction of uu through dd.

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.