Given a polynomial $P(x) = a_1 x + a_2 x^2 + .. + a_n x^n$ with $a_0 = 0$
I am trying to prove that in the neighbourhood of zero $B_{r}(0)$ the graph of the polynomial will cross the x-axis if and only if the smallest integer $k \in \{1,...,n\}$ such that $a_{k} \neq 0$ is odd
I know that an odd-degree polynomial with $P(0) = 0$ will cross the x-axis while an even-degree polynomial wont, but I am confused with degree of the smallest term, for instance $x^4 + x^5$ has an odd degree so it crosses the x-axis in general, but in the neighbourhood of zero it won't cross, because the smallest $k$ is even (the odd power is also high, so it's flattened out at zero)
Any help would be great!
Suppose $k$ is odd and $P(x)=a_kx^k+\cdots+a_nx^n=x^k(a_k+\cdots a_nx^{n-k})=x^kg(x)$. As $x\to 0$, $g(x)\to a_k$. Assume $a_k>0$, otherwise consider $-P$ so in a small enough neighborhood of zero, $0<a_k-\epsilon\le g(x)$. If $x>0$, $0<(a_k-\epsilon)x^k\le P(x)$. If $x<0$, $0<>a_k-\epsilon)x^k\ge P(x)$. IVT yields the result.