I am having difficulty understanding the intuition behind the proof for the following theorem:
Suppose $a_0,a_1,\dots, a_m \in \mathbb F.$ If $$a_0 + a_1z^1+ \cdots + a_mz^m = 0$$ for every $z \in \mathbb F$, then $a_0 =a_1 =\dots = a_m = 0$
The proof I am referring to below is from Sheldon Axler's Linear Algebra Done Right.
Question 1 : Doesn't the choice of $z$ only prove the theorem for $z \ge1$?
Question 2 : Why should we let $z$ be represented in terms of the coefficients? Normally in a function, we wouldn't define the independent variable ($z$) in terms of the parameters(the coefficients) would we?
Question 3 : How is $(|a_0|+ |a_1|+ \cdots|a_{m-1}|)z^{m-1} < |a_m z^m|$ for possible cases in which coefficients, in addition to $a_m$, do not equal to $0$?
Side Yes/No Question: Can this theorem be proven with induction by taking the derivative and showing the constant term to be zero on each step also?
Thanks in Advance!
