I am reading through a proof of the following by induction but stuck at a very early step.
$k$ is an infinite field and let $f \in k[x_1,...,x_n]$. Then $f=0$ in $k[x_1,...,x_n]$ if and only if $f:k^n \rightarrow k$ is the zero function.
The proof starts by considering $k[x]$ and assumes $k$ is an infinite field, and that $f \in k[x]$ is a zero function. So I understand that, since $f(a)$ is zero for any $a \in k$, and because $k$ is infinite, it follows that $f$ has infinitely many roots.
But here's the statement I don't get, which is apparently the result of what I've just written
$f$ has infinitely many roots hence $f$ must be the zero polynomial.
But, why? I mean the easiest way is sure, if all the coefficients of the polynomial are $0$ then no matter what we have, we get zero. But why can we say that this is absolutely always the case?
So my question is, why does $f$ having infinitely many roots(as a function) imply that $f$ is the zero polynomial?
It would be great if someone could explain...thank you [**I was looking for "why" if a polynomial has more than $n$ roots it must be the zero polynomial]
http://math.stackexchange.com/questions/25822/how-to-prove-that-a-polynomial-of-degree-n-has-at-most-n-roots
– Charlie Nov 19 '15 at 21:53