How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
If for each and vanishes on , then
Statement
Let be a field, let , and let finite sets satisfy
If vanishes at every point of , then .
Facts & Assumptions
Given: a field , finite subsets , and a polynomial with for every , vanishing on .
A nonzero univariate polynomial over a domain has at most as many distinct roots as its degree (A nonzero polynomial of degree over an integral domain has at most distinct roots, A polynomial ring in finitely many indeterminates over an integral domain is an integral domain).
Every polynomial has a finite monomial expansion, so in particular one may write with (Monomials, coefficients, degree in each variable and total degree in ).
Proof
[base] If , then is a univariate polynomial of degree below vanishing at every point of . By [F1] a nonzero polynomial of that degree cannot have so many roots, so .
[ih] Assume the statement is known for polynomials in variables.
Write as in [F2], where .
Fix . Then the univariate polynomial has degree at most and vanishes on all of , so [F1] gives . Therefore every coefficient is .
Since the point was arbitrary, every coefficient polynomial vanishes on . Its degree in each variable is still below the corresponding , so the induction hypothesis gives for every . Hence .
Remarks
- The inequalities are strict. The companion page's counterexample is exactly the boundary case where equality holds in one variable.
Depends on
- Monomials, coefficients, degree in each variable and total degree in $F[x_1,\dots,x_n]$
- A nonzero polynomial of degree $n$ over an integral domain has at most $n$ distinct roots
- Polynomial rings in finitely many commuting indeterminates by iteration
- Evaluation and roots of a polynomial in a commutative target ring
- A polynomial ring in finitely many indeterminates over an integral domain is an integral domain
- Field
- The cardinality $\lvert A\rvert$ of a finite set
Used by
- P(x)=x(x-1) vanishes on {0,1} although degₓ P=|{0,1}| Counterexample
- Applying the Nullstellensatz by hand to f(x,y)=x²y+xy²+x+y over ℚ Example
- FALSE: if deg f=∑ᵢtᵢ and | Sᵢ|>tᵢ then f is nonzero somewhere on S₁×⋯× Sₙ False statement
- f̃ is multilinear, agrees with f at every point of {0,1}ⁿ, is degree-nonincreasing when nonzero, and is the unique multilinear polynomial with that agreement Lemma
- Alon's Combinatorial Nullstellensatz: if deg f=∑ᵢtᵢ, the coefficient of x₁^t₁⋯ xₙ^tₙ in f is nonzero, and | Sᵢ|>tᵢ, then f(s₁,…,sₙ)≠0 for some sᵢ∈ Sᵢ Theorem
Dependency tree · two levels
24 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- N. Alon, Combinatorial Nullstellensatz, Lemma 2.1 (standard reference, not scraped)