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

The inequality is the following:

$a^ \theta b^ {1-\theta}$ $\leq$ $[\theta ^ \theta (1-\theta)^ {1-\theta}]^{1/p}(a^p+b^p)^{1/p}$, where $\theta \in [0,1]$, $a,b$ are nonnegative.

This inequality is used to give a sharper constant in the proof of an embedding theorem in Sobolev spaces. Here is the link On page 66, the author used the inequality to give a sharper estimate, but he didn't give a proof of this inequality. Actually, $a^ \theta b^ {1-\theta}$ $\leq$ $(a^p+b^p)^{1/p}$ is obvious (this is my first try), and enough to prove the embedding theorem, but it is always interesting to give a sharper inequality.

I tried to prove this seemingly elementary inequality, but I'm really not good at it. Can anyone give a smart answer? Any hint would be appreciated.

share|cite|improve this question
up vote 5 down vote accepted

Both sides of the inequality are homogeneous, if we multiply $a$ and $b$ with $t > 0$, the expression is multiplied with $t$. Therefore, we can assume $a^p + b^p = 1$ (if $a = b = 0$, the inequality is trivially an equality). So we need to show

$$ a^\theta b^{1-\theta} \leqslant \left[\theta^\theta(1-\theta)^{1-\theta}\right]^{1/p}$$

under the constraint $a^p+b^p = 1$.

If $a = 0$ or $b = 0$, the inequality is again trivial, so let's suppose $a \neq 0 \neq b$.

Let $\alpha = a^p$ and raise the inequality to the $p$-th power to obtain

$$\alpha^\theta(1-\alpha)^{1-\theta} \leqslant \theta^\theta(1-\theta)^{1-\theta}$$

as the inequality to be shown. Take the logarithm and differentiate with respect to $\alpha$:

$$\frac{d}{d\alpha} \left(\log \alpha^\theta(1-\alpha)^{1-\theta}\right) = \frac{\theta}{\alpha} - \frac{1-\theta}{1-\alpha}.$$

It is easy to see that the derivative is positive for $0 < \alpha < \theta$ and negative for $\theta < \alpha < 1$, hence $\alpha \mapsto \alpha^\theta(1-\alpha)^{1-\theta}$ has a unique maximum at $\alpha = \theta$.

share|cite|improve this answer
Thanks very much. Even though I realized the homogeneity at first, I didn't think about it in this way. The proof is really smart. – student May 16 '14 at 22:25
I'll vote for this answer because it provided the idea to deal with this kind of problem, although it is more complicated than the others. – student May 16 '14 at 22:39

By the AM/GM inequality, $$ \left(\frac a\theta\right)^\theta \left(\frac b{1-\theta}\right)^{1-\theta} \le \theta\left(\frac a\theta\right) + (1-\theta)\left(\frac b{1-\theta}\right) = a+b $$ Now replace $a$ and $b$ with $a^p$ and $b^p$.

share|cite|improve this answer
Thanks very much! This may be the most elegant proof. – student May 16 '14 at 22:37
It's really the same as the earlier answer by @TenaliRaman. – user21467 May 16 '14 at 22:48

From Jensen, we can obtain, $$a^{\theta}b^{1 - \theta} \leq \theta a + (1 - \theta) b$$ for $a, b \geq 0$ and $0 \leq \theta \leq 1$.

Substitute $a = (1 - \theta)a$ and $b = \theta b$, and we get, $$((1 - \theta)a)^{\theta}(\theta b)^{1 - \theta} \leq \theta (1 - \theta) a + (1 - \theta) \theta b$$ which gives, $$a^{\theta}b^{1 - \theta} \leq \theta^\theta (1 - \theta)^{1 - \theta} (a + b)$$

The rest should follow.

share|cite|improve this answer
Thanks a lot. Jensen's inequality makes the proof simpler. And for the last step, replace $a$ and $b$ with $a^p$ and $b^p$ and take the p-th root then get the desired result. – student May 16 '14 at 22:36
Precisely. (Surely you meant pth root instead of pth power). – TenaliRaman May 16 '14 at 22:40
Oh, thanks for telling me the typo. I've fixed it. – student May 16 '14 at 22:41

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.