3

Prove that $ ||x| - |y|| \le |x| - |y| $ for all $ x,y \in \mathbb{C} $.

I fully understand the other inequality: $|x+y| \le |x|+|y| $ for all $ x,y \in \mathbb{C} $.

But I have no clue how to start this one.

Any help will be greatly appreciated.

Thanks in advance!

PandaMan
  • 3,337

2 Answers2

5

First off, the assertion $\vert \vert x \vert - \vert y \vert \vert \le \vert x \vert - \vert y \vert$ is false: to see this, just choose $\vert y \vert > \vert x \vert$. I think what you want is $ \vert \vert x \vert - \vert y \vert \vert \le \vert x - y \vert$, as was stated and correctly demonstrated by Citizen in his/her answer.

Having said these things, and to avoid re-writing what is essentially the same answer over and over, you might check out my answer to this question:

How can I derive this expression related to the triangle inequality?

Hope this helps! Cheers!

Robert Lewis
  • 72,871
4

Notice $$|x| = |x + y - y| \leq |x - y| + |y| \implies |x| - |y| \leq |x-y| $$

By the same reasoning, you can do the same with $y$ instead of $x$, and obtain the desired result, the reversed triangle inequality.

ILoveMath
  • 10,999