Triangle inequality for a normalized absolute distance

[buraq01]

Hi, can you please give me some hints to show that
\frac{|a-b|}{1+|a|+|b|} \leq \frac{|a-c|}{1+|a|+|c|}+\frac{|c-b|}{1+|c|+|b|}, \forall a, b, c \in \mathbb{R}.
I tried to get this from
|a-b| \leq |a-c|+|c-b|, \forall a, b, c \in \mathbb{R},
but I couldn't succeed.

Thank you.

 

[susskind_leon]

What do you get when you multiply by all the denominators?
Can you do that and isolate |a-b| on the lhs and |a-c|+|c-b| on the rhs?

 

[buraq01]

I tried to play around with that approach but I couldn't get anything.

 

[jbunniii]

I played around with this for a few minutes but didn't find a proof. However, there's a similar inequality that I do know how to prove. Perhaps you can adapt this proof, or use this inequality to prove yours.

Claim:

\frac{x}{1 + x} \leq \frac{y}{1 + y} + \frac{z}{1 + z}

for all non-negative x, y, z such that x <= y + z.

Sketch of proof:

First show that the function f(t) = t / (1 + t) is monotonically increasing for non-negative t. Then apply this fact to t1 = x and t2 = y + z.

 

[susskind_leon]

I still think you can definitely do it by multiplying with the denominators, you just need to be very persistent and the calculation is very lengthy.