I am reading Prof. Ram Murty's Prime number and Irreducible polynomials. I am having problem in understanding a part of the following lemma:
Statement: Suppose that $\alpha$ is a complex root of a polynomial $$ f(x)=x^m+a_{m-1}x^{m-1}+\cdots+a_1x+a_0 $$ with coefficients $a_i$ equal to $0$ or $1$. If $|arg \ \alpha| \le \frac{\pi}{4}$ then $|\alpha| < \frac{3}{2}$. Otherwise $\mathfrak{R}(\alpha) < \frac{1+\sqrt{5}}{2\sqrt{2}}$.
Proof: The cases $m=1$ and $m=2$ can be verified directly. Assuming that $m \ge 3$, we compute for $z \ne 0$:
$$ \left| \frac{f(z)}{z^m}\right| \ge \left| 1+\frac{a_{m-1}}{z}+\frac{a_{m-2}}{z^2}\right| - \left(\frac{1}{|z|^3}+\cdots+\frac{1}{|z|^m}\right). $$
For $z$ satisfying $|arg \ z| \le \frac{\pi}{4}$ it is true that $\mathfrak{R}(\frac{1}{z^2}) \ge 0$, so for such $z$ we have
$$ \left|\frac{f(z)}{z^m}\right| > 1 - \frac{1}{|z|^2(|z|-1)} $$
How to obtain the cases when $m=1,2$?
How are the above two inequalities obtained?
Where are we using the fact: For $z$ satisfying $|arg \ z| \le \frac{\pi}{4}$ it is true that $\mathfrak{R}(\frac{1}{z^2}) \ge 0$?