Triangle inequality
The triangle inequality takes a few common forms, for example: d(x,z)≤d(x,y)+d(y,z) (see metric space) of which |x−z|≤|x−y|+|y−z| is a special case.
Another common way of writing it is |a+b|≤|a|+|b|, notice if we set a=x−y and b=y−z then we get |x−y+y−z|≤|x−y|+|y−z| which is just |x−z|≤|x−y|+|y−z|
Contents
[hide]Definition
The triangle inequality is as follows:
- |a+b|≤|a|+|b|
Proof
We have 4 cases:
- Suppose that a>0 and b>0
- We see immediately that a>0⟹a+b>0+b=b>0 so a+b>0
- thus |a+b|=a+b
- We also see that |a|=a as a>0
- and that |b|=b for the same reason.
- thus |a|+|b|=a+b
- We see that |a+b|=|a|+|b|
- Notice |a+b|=|a|+|b|⟹|a+b|≤|a|+|b| in the literal sense of "if left then right"
- (⟹ denotes logical implication)
- Notice |a+b|=|a|+|b|⟹|a+b|≤|a|+|b| in the literal sense of "if left then right"
- We see immediately that a>0⟹a+b>0+b=b>0 so a+b>0
- Suppose that a>0 and b≤0
- Suppose that a≤0 and b>0
- Mathematicians are lazy, as R is a field (an instance of a ring) we know that a+b=b+a (addition is commutative)
- As |⋅|:R→R is a function we know that if x=y then |x|=|y|
- As, again, R is a ring, we know that |a|+|b|=|b|+|a|
- So:
- |a+b|
- =|b+a| by the commutativity of addition on R
- ≤|b|+|a| by the 2nd case (above)
- =|a|+|b| again by commutativity of the real numbers
- |a+b|
- Thus |a+b|≤|a|+|b|
- Both a≤0 and b≤0
TODO: Finish proof
Reverse Triangle Inequality
This is |a|−|b|≤|a−b|
Proof
Take |a|=|(a−b)+b| then by the triangle inequality above:
|(a−b)+b|≤|a−b|+|b| then |a|≤|a−b|+|b| clearly |a|−|b|≤|a−b| as promised
Note
However we see |b|−|a|≤|b−a| but |b−a|=|(−1)(a−b)|=|−1||a−b|=|a−b| thus |b|−|a|≤|a−b| also.
That is both:
- |a|−|b|≤|a−b|
- |b|−|a|≤|a−b|
Full form
There is a "full form" of the reverse triangle inequality, it combines the above and looks like: |a−b|≥| |a|−|b| |
It follows from the properties of absolute value, I don't like this form, I prefer just "swapping" the order of things in the abs value and applying the same result