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

I have a small question that I think is very basic but I am unsure how to tackle since my background in computing inequalities is embarrasingly weak -

I would like to show that, for a real number $p \geq 1$ and complex numbers $\alpha, \beta$, I have \begin{equation} |\alpha + \beta|^p \leq 2^{p-1}(|\alpha|^p + |\beta|^p) \end{equation}

I thought it would be best to rewrite this as \begin{equation} \left|\frac{\alpha + \beta}{2}\right|^p \leq \frac{|\alpha|^p + |\beta|^p}{2} \end{equation}

but then I am unsure what to do next - is this a sensible start anyways ? Any help would be great !

(P.S. this is not a homework question - I am currently trying to brush up my knowledge of $L^p$ spaces, and this inequality came up as a statement. I thought it might be wortwhile to make sure I can fill in the gaps to improve my skills in computing inequalities.)

share|cite|improve this question
The following may be quite useful: $(a-b)^2\geq 0$ for real $a,b$. As well, the triangle inequality is worth considering. – Alex R. May 9 '12 at 19:15
You could use convexity and Jensen's inequality in some way or another. – Daan Michiels May 9 '12 at 19:16
Check Minkowski's inequality . – Theorem May 9 '12 at 19:27
thank you all for your comments! Jensen's as well as Minkowski's inequality are coming in the sequel of the book I am using ( "Analysis" by Lieb) so I guess I need to be able to derive this without using them .. – harlekin May 9 '12 at 19:34
Let me know if you have any problems! – Theorem May 9 '12 at 19:36
up vote 11 down vote accepted
  • The map $x\mapsto x^p$ for $x\geq 0$ is convex, since its second derivative is $p(p-1)x^{p-2}\geq 0$.
  • We have $$\left|\frac{a+b}2\right|^p\leq \left(\frac{|a|+|b|}2\right)^p\leq \frac{|a|^p+|b|^p}2.$$
share|cite|improve this answer
loved ur proof ! very short indeed. – Theorem May 9 '12 at 19:39
It might be informative to mention Jensen's Inequality. – robjohn May 9 '12 at 20:26

Without loss of generality, we can assume that that $\lvert \alpha \rvert \geq \lvert \beta \rvert$. Now essentially you want to prove that $$\displaystyle \left \lVert \frac{z + 1}{2} \right \Vert^p \leq \displaystyle \frac{\lVert z \rVert^p + 1}{2},$$ where $\displaystyle z = \frac{\alpha}{\beta}$ and $\lVert z \rVert \geq 1$.

Note that $$ \displaystyle \left \lVert \frac{z + 1}{2} \right \Vert \leq \frac{\lVert z \rVert + 1}{2}$$

So if we prove that $\displaystyle \left(\frac{1+t}{2} \right)^p \leq \frac{1+t^p}{2}$, where $t = \lVert z \rVert \geq 1$, we are done.

Now this is a one-variable calculus problem. Consider $f(t) = \displaystyle \frac{1+t^p}{2} - \left(\frac{1+t}{2} \right)^p$. We then get that $$\displaystyle f'(t) = \frac{p t^{p-1}}{2} - \frac{p (1+t)^{p-1}}{2^p}.$$ Hence, $$f'(t) = \frac{p}{2} \left( t^{p-1} - \left(\frac{1+t}{2} \right)^{p-1}\right) \geq 0$$ for $t \geq 1$. Hence, $f(t)$ is increasing for all $t \geq 1$. And $f(1) = 0$. Hence, we have that $$f(t) \geq f(1) = 0.$$ Hence, we get that $$\displaystyle \left(\frac{1+t}{2} \right)^p \leq \frac{1+t^p}{2},$$ where $t = \lVert z \rVert \geq 1$

share|cite|improve this answer

In fact, one advantage of the argument in john w.'s answer is that it can be extended further to prove $$(a+b)^n\leq p^na^n+q^nb^n,$$ where $\frac{1}{p}+\frac{1}{q}=1$. In particular, one can choose the coefficient of $a^n$ very close to $1$ by paying the price of a larger coefficient of $b^n$.

The proof is achieved by arguing either $(a+b)\leq pa$ or $(a+b)\leq qb$ holds. This is true since otherwise one would get a contradiction that $\left(\frac{1}{p}+\frac{1}{q}\right)a+b>a+b$.

share|cite|improve this answer
The last inequality should be (1/p + 1/q)(a+b) > a+b (Note the parenthesis) – user65308 Jun 22 at 3:02

If the $p-1$ being $p$ is not a big deal then I think the following works. $|\alpha+\beta|\leq |\alpha|+|\beta|\leq 2\max\{|\alpha|,|\beta|\}$. If the max is $|\alpha|$, then $|\alpha+\beta|^p\leq 2^p|\alpha|^p\leq 2^p(|\alpha|^p+|\beta|^p)$. Similarly for $\beta$. In either case you get the inequality you want.

share|cite|improve this answer
It is actually a big deal, the inequality making use the convexity normally only overestimates the differences half as the inequality choosing the biggest one. – Shuhao Cao May 13 '12 at 2:01

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.