Prove that $d(x,y) \ge d(a,b)-d(x,a)-d(y,b)$

42 Views Asked by At

So far I've attempted algebraic manipulation with absolute values.

I know that by symmetry, $d(x,y) = d(y,x)$,
I also know that the Triangle Inequality holds for distances; i.e. $d(x,z)\le d(x,y)+d(y,z)$.

But I just can't figure out how to go about this proof.

2

There are 2 best solutions below

0
On

$$\underbrace{d(x,y)+d(x,a)}_{\geq d(a,y)}+d(b,y)\geq d(a,y)+d(b,y)\geq d(a,b)$$

0
On

We have, by using the triangle inequality twice, that $$ d(a,b)\leq d(a,x)+d(x,b)\leq d(a,x)+d(x,y)+d(y,b) $$ Remove the middle party, and reorganize it a bit, and you get your inequality.