# Combined AM GM QM inequality

I came across this interesting inequality, and was looking for interesting proofs. $x,y,z \geq 0$

$$2\sqrt{\frac{x^{2}+y^{2}+z^{2}}{3}}+3\sqrt [3]{xyz}\leq 5\left(\frac{x+y+z}{3}\right)$$

Addendum.

In general, when is

$$a\sqrt{\frac{x^{2}+y^{2}+z^{2}}{3}}+b\sqrt [3]{xyz}\leq (a+b)\left(\frac{x+y+z}{3}\right)$$

true?

-

2
I'm not sure what is interesting here, nor how to measure the interest found in a proof. – Asaf Karagila Jul 26 '11 at 15:41
I deleted my answer because it was thoroughly invalid. – anon Jul 26 '11 at 15:59

2
@Asaf, These inequalities are usually abbreviated as $2QM+3GM \leq 5AM$ The interesting bit is that it is true that $GM \leq AM \leq QM$. – picakhu Jul 26 '11 at 16:00

1
@picakhu: Can you change your title both to something that better reflects the question and doesn't use 'interesting?' It seems obvious to me that you find the question interesting, or you wouldn't ask it. – mixedmath♦ Jul 26 '11 at 17:19

2
I see. I guess you are not familiar with mixing variables/EV then. I'll post a comment on this shortly. – Soarer Jul 26 '11 at 17:34
show 15 more comments

## 1 Answer

This is not a direct answer to the question, but it's probably too long for a comment, so I'm leaving it as an answer. (In the comments it seems that OP was not familiar with the technique of mixing variables/smoothing, which was used by Honey_S in the link provided to solve the problem; or the (n-1)-EV theorem, so this answer would be a quick exposition of what they are.)

Mixing variables/smoothing:

In inequalities such as $f(a,b,c) \ge 0$, we seek to prove an inequality of the type $f(a,b,c) \ge f(t,t,c)$. We expect to iterate this inequality so that we can conclude the minimum would be attained when many variables are equal.

Example 1: (AM-GM inequality)

We want to show that if $a,b,c > 0$, then $a+b+c \ge 3(abc)^{1/3}$.

Proof. Consider

$f(a,b,c) = a + b + c - 3(abc)^{1/3}$

Now by 2-variable AM-GM, we see that $f(a,b,c) \ge f(\sqrt{ab}, \sqrt{ab}, c)$. You can then imagine that if we keep on doing such smoothing - i.e. next time replace $(\sqrt{ab}, c)$ with 2-tuple of their geometric mean for example, then in infinite time we reach the case where all three variables are equal, and that $f(a,b,c)$ attains its minimum when $a=b=c$, which is 0.

In general there are many choices of $t$. If there's an initial condition on $a+b+c$, you may want to change $(a,b)$ to $\left(\frac{a+b}{2}, \frac{a+b}{2} \right)$ or sometimes $(0,a+b)$ if you guess that equality case of the inequality involves 0. If there is an initial condition on $a^2+b^2+c^2$, you may change $(a,b)$ to $\left(\sqrt{\frac{a^2+b^2}{2}}, \sqrt{\frac{a^2+b^2}{2}}\right)$ etc.

In the AM-GM example, life is nice because $f(a,b,c) \ge f(t,t,c)$ holds unconditionally. Very often, this is not the case. For example, in Honey_S's solution in the link, after assuming $abc=1$ by homogenity he proved that

$f(a,b,c) \ge f(\sqrt{ab},\sqrt{ab},c)$

for

$f\left({a,b,c}\right) = 5\left({a+b+c}\right)-2\sqrt{3\left({a^{2}+b^{2}+c^{2}}\right)}$

only when $c = \max (a,b,c)$. However in this case, we are left to show that $f(t,t,c) \ge 0$ under the condition $t^2c = 1$. This is a one-variable inequality easily handled by calculus.

If you want to see more examples of smoothing in action, check this thread and the four links in that post, this and this for example.

(n-1)-EV theorem:

This is a theorem that kills many olympiad inequalities. You can see Vasile Cirtoaje's original article here. Basically what it does is that after some tedious calculus checking, many inequalities actually attain its extremum when (n-1) of the n variables involved in the inequality are equal.(And we can use calculus to check the remaining case) Check out theorem 3 and its corollaries in the link.

If you want to see its applications, see the "Applications" section of Vasc's paper, and if you want some more, see here or maybe a recent post on this forum. I hope this would be enough for you now :)

-

1
Thanks for the two methods. This will be a fun read for me. :) Maybe I can teach some to my friends who are still young enough to tackle olympiads! – picakhu Jul 26 '11 at 19:07
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 27, "mathjax_display_tex": 2, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9632174372673035, "perplexity_flag": "head"}