Generalized triangle inequality

CyberShot
Messages
133
Reaction score
2

Homework Statement



Show that

|x_1 + x_2 + · · · + x_n | ≤ |x_1 | + |x_2 | + · · · + |x_n |

for any numbers x_1 , x_2 , . . . , x_n

Homework Equations



|x_1 + x_2| ≤ |x_1| + |x_2| (Triangle inequality)

The Attempt at a Solution



I tried using the principle of induction here, but to no avail.

Can I induct on the basis |x_1| ≤ |x_1| ?
 
Physics news on Phys.org
Hint: | x_1+x_2 + x_3 | \leq |x_1 + x_2| + | x_3 |
 
so I can write |x_1 + x_2 + x_3| ≤ |x_1| + |x_2| + |x_3|

since |x_1 + x_2| ≤ |x_1| + |x_2|

but how do I cover all the "n" cases?
 
CyberShot said:
so I can write |x_1 + x_2 + x_3| ≤ |x_1| + |x_2| + |x_3|

since |x_1 + x_2| ≤ |x_1| + |x_2|

but how do I cover all the "n" cases?

Use the inductive principle... assume that | \sum_{i=1}^n x_i| \leq \sum_{i=1}^n |x_i| for some some n=k (it is obviously true for n=1, 2 and 3) , and then show that it must then also be true for n=k + 1.
 
CyberShot said:

Homework Statement



Show that

|x_1 + x_2 + · · · + x_n | ≤ |x_1 | + |x_2 | + · · · + |x_n |

for any numbers x_1 , x_2 , . . . , x_n


Homework Equations



|x_1 + x_2| ≤ |x_1| + |x_2| (Triangle inequality)


The Attempt at a Solution



I tried using the principle of induction here, but to no avail.

Can I induct on the basis |x_1| ≤ |x_1| ?

You can use the easily-proven fact that the absolute-value function is convex, in the sense that f(x) satisfies f(\alpha w_1 + (1-\alpha)w_2) \leq \alpha f(w_1) + (1-\alpha) f(w_2) for all \alpha \in [0,1]. Try to prove that
\left| \frac{x_1 + x_2 + \cdots + x_n}{n}\right| \leq \frac{1}{n}|x_1| + \cdots + \frac{1}{n} |x_n|. Hint: induction.

RGV
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top