Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

If $p \geqslant 1$, and let $c^p \leqslant \sum\limits_{i=1}^n a_i^p $ . Then $$ c \leqslant \sum_{i=1}^n a_i$$ Here $c , a_i \geqslant 0$.

share|cite|improve this question

$\|a\|_p = \left( \sum\limits_{i=1}^n a_i^p\right)^{1/p}$ is the $\ell_p$ norm of $(a_1,\ldots,a_n)$. The fact that this is subadditive, and thus a norm, is Minkowski's inequality. Thus $$\|a\|_p \le \|(a_1,0,\ldots,0)\|_p + \|(0,a_2,0,\ldots,0)\|_p + \ldots + \|(0,\ldots,0,a_n)\|_p = \sum_{i=1}^n |a_i|$$

share|cite|improve this answer

An elementary argument might go as follows: The case $c=0$ is clear. Thus, assume $c\neq 0.$ We can reduce to the case $c=1$ by dividing through by $c^p$ in the first inequality, and by $c$ in the second inequality. So suppose that $\sum a_i^p \ge 1.$ If all $a_i< 1,$ then $1\le \sum a_i^p \le \sum a_i$ is clear. Otherwise there is some $a_i \ge 1$ and again we are done.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.