# Algebraic inequality proof [closed]

Let $\{p_i\}_{i=1...n}$ be a set of real numbers with $p_i \in [0,1] \; \forall i$, and $\sum_{i=1}^n p_i = 1$. I assume that there is one element in this set that is strictly larger than all the others, and wlog I call it $p_1$. I am attempting to prove or disprove the following proposition:

For all $\alpha > 1$, $p_1^{\alpha-1} > \sum_{i=1}^n p_i^{\alpha}$.

Any help appreciated.

## closed as off-topic by Namaste, C. Falcon, Arnaldo, Leucippus, Daniel W. FarlowJun 17 '17 at 2:34

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Namaste, C. Falcon, Arnaldo, Leucippus, Daniel W. Farlow
If this question can be reworded to fit the rules in the help center, please edit the question.

• What did you attempt prior to posting this? Please add your answer to this question in your post; otherwise it comes across as a problem statement problem with not context, no effort, etc. – Namaste Jun 16 '17 at 22:14

Note that $$p_i^{\alpha}=p_i^{\alpha-1}p_i\leq p_1^{\alpha-1}p_i$$ for all $i$, with the equality being strict for $i>1$. Therefore if $n>1$ then $$\sum_{i=1}^np_i^{\alpha}<p_1^{\alpha-1}\sum_{i=1}^np_i=p_1^{\alpha-1}$$ since $\sum_ip_i=1$.