$(W_1+W_2+\cdots+W_n)^a \leq W_1^a +\cdots + W_n^a$ for $n$ integer, $n\geq 2$, $W\gt 0$ and $a$ constant, real, $0\lt a\lt 1$ I am looking for a proof that this inequality:
$$(W_1+W_2+\cdots+W_n)^a \leq  W_1^a +\cdots +  W_n^a$$ 
is valid.
I have a power function $f(W)=W^a$ where $a$ is a real number, constant but usually $0\lt a\lt 1$. The $W_i$ are real positive numbers.
Then I want to check if $\left(\sum W_i\right)^a \leq \sum(W_i^a)$
For example for $n=2$ : $(x+y)^a \leq x^a + y^a$.
Thanks.
 A: This is equivalent to proving $(\frac{W_1}{W_1+W_2+...+W_n})^a+(\frac{W_2}{W_1+W_2+...+W_n})^a+...+(\frac{W_n}{W_1+W_2+...+W_n})^a\geq 1$. Write $a_i=\frac{W_1}{W_1+W_2+...+W_n}$. Then, $a_1+a_2+...+a_n=1$, $0< a_1,a_2,...,a_n,a < 1$. So, $a_i^a > a_i$. So, $a_1^a+...+a_n^a> a_1+a_2+...+a_n=1$. QED. 
Edit: I think the inequality should be strict since $a<1$.
A: To show that $(w_1+w_2)^a\leq w_1^a+w_2^a$ whenever $w_1$ and $w_2$ are positive, we can divide by $w_1^a$ on both sides and rewrite $\frac{w_2}{w_1}$ as $t$ to get the equivalent statement $(1+t)^a\leq 1+ t^a$ when $t\geq 0$.  Notice that the two sides agree when $t$ goes to zero, and the derivative of the right-hand side with respect to $t$ is always bigger than that of the left-hand side (because $0\lt a\lt 1$), so the inequality follows.
The case of general $n$ follows by induction, using the $n=2$ case for the inductive step. 
A: See my answer to Please explain inequality $|x^p-y^p|\le |x-y|^p$ -
the inequality you ask for follows by induction.
