Any ideas how to prove this inequality of any two complex numbers?
$$ ||z| - |w||\leq|z + w |$$
My intuition told me to square both sides:
$$ (|z| - |w|) ^ 2 \leq |z + w|^2 \\ |z|^2 - 2|z||w| + |w|^2 \leq |(z + w)(z+w)| \\z \bar z - 2|z||w| + w \bar w \leq |zz+2wz + ww| $$ In polar complex notation $ z = a + ib, w = c + id$ where $ a,b,c,d \ \epsilon \ R: $ $$ a^2+b^2 - 2\sqrt {a^2+b^2} \sqrt{c^2 + d^2} + c^2 + d^2 \leq |a^2 + 2abi-b^2 + 2((ac-bd) + (bc + ad)i) + c^2 + 2cdi - d^2| $$ Simplify RHS in polar complex notation: $$ |a^2 + c^2 - (b^2 + d^2) + 2ac - 2bd + 2(bc + ad + cd + ab)i| $$
If I take the magnitude of the RHS, maybe the terms can cancel out the LHS and become something like: $$0\leq a^2 + b^2$$ Then it becomes obvious that the inequality is true. Is expanding a reasonable technique or is there a better way to prove this?
A shorter way is to note the difference form $|z+w| \ge |z| - |w|$ of the triangle inequality*. Similarly we have $|z+w|=|w+z| \ge |w|-|z|$. Together these imply $|z+w|\ge\max\{|z| - |w|,|w|-|z|\} = \big| |z|-|w| \big|$.
*It's worth remembering why $|z+w| \ge |z| - |w|$ is a version of the triangle inequality: it's because $|z| = |(z+w)-w| \le |z+w|+|-w| = |z+w|+|w|$.