Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Given the complex polynomial $P(z) = z^2 + a_1z + a_0$ and the constraint that $|z| > 1$, I'm trying to show that $|P(z)| \geq |z|^2 - |a_1||z| - |a_0|$. The obvious thing to do here of course is to apply the triangle inequality which yields $$ |P(z)| = |z^2 + a_1z + a_0| \leq |z|^2 + |a_1||z| + |a_0| $$ Just as obvious though is the fact that this is not remotely close to what I am trying to show. I'm sure I'm missing a relevant detail. I have attempted, and failed, to productively apply the constraint on $|z|$. This is effectively the start of a proof of the Fundamental Theorem of Algebra.

Would appreciate any tips.

share|cite|improve this question
up vote 4 down vote accepted

Hint. The triangle inequality also shows that $$|a+b|\geq |a|-|b|.$$

To see this, note that $$|a| = |a+b-b| \leq |a+b|+|b|.$$

(In point of fact, I don't see that the constraint is needed at all to establish what you want, though it would be useful to obtain further lower bounds on $|P(z)|$...)

share|cite|improve this answer
Got it! Thanks for the hint: $|P(z)| = |(z^2 + a_1z) + a_0| \geq |z^2 + a_1z| - |a_0| \geq |z|^2 - |a_1||z| - |a_0|$ – ItsNotObvious May 17 '11 at 21:01
OR (same proof actually), you can use the triangle inequality for $z^2= P(x)-a_1z-a_0$. – N. S. May 18 '11 at 1:29

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.