2
$\begingroup$

I'm studying numerical analysis and in the book I'm reading there is a theorem thats find a raduis such that all the roots of a polynomial $P$ (with coefficient in $\mathbb{C}$) are in the open disk with center at $(0,0)$. This can be helpful when trying to find roots as it gives a good initial guess.

The only problem I have is that I can't seem to be able to understand why this is true :

$|P(z)| \geq |a_n z^n| - |a_{n-1}z^{n-1}+ \cdots +a_1z+a_0|.$

($P(z)= \sum_{i = 0}^n a_i z^i$)

*also assume $|z| > 1$.

  • 0
    I have edited your question to make it easier to read. Please make certain that it still reflects the question you intended to ask.2011-12-16

2 Answers 2

4

This is due to the reverse triangle inequality: $ |u - v| \geqslant |u| - |v|. $ This can be derived from the usual triangle inequality as follows: $ |u| = |(u - v) + v| \leqslant |u - v| + |v|. $

Applying the reverse triangle inequality to $u = a_nz^n$ and $v = - \left( a_{n-1} z^{n-1} + \cdots + a_1 z + a_0 \right)$ and noting that $|-v| = |v|$, we get the claim.

  • 2
    A sh$a$rper version of this inequality is in [my answer here](http://math.stackexchange.com/questions/39567/)2011-12-16
3

This is just the inverse triangle inequality ($|x| = |x -y + y|\leq |x-y| + |y|$, hence $|x| - |y| \leq |x-y|$).

Apply this to $x = a_n z^n$ and $y = -(a_0 + \cdots + a_{n-1} z^{n-1})$.