Is there a good reason why a^{2b} + b^{2a} <= 1 when a+b=1? - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-18T19:23:38Z http://mathoverflow.net/feeds/question/17189 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/17189/is-there-a-good-reason-why-a2b-b2a-1-when-ab1 Is there a good reason why a^{2b} + b^{2a} <= 1 when a+b=1? Sunni 2010-03-05T16:18:14Z 2013-05-12T18:55:27Z <p>The following problem is not from me, yet I find it a big challenge to give a nice (in contrast to 'heavy computation') proof. The motivation for me to post it lies in its concise content.</p> <p>If $a$ and $b$ are nonnegative real numbers such that $a+b=1$, show that $a^{2b} + b^{2a}\le 1$.</p> http://mathoverflow.net/questions/17189/is-there-a-good-reason-why-a2b-b2a-1-when-ab1/17192#17192 Answer by Mariano Suárez-Alvarez for Is there a good reason why a^{2b} + b^{2a} <= 1 when a+b=1? Mariano Suárez-Alvarez 2010-03-05T16:27:06Z 2010-03-05T16:37:44Z <p>Silly non-answer removed.</p> http://mathoverflow.net/questions/17189/is-there-a-good-reason-why-a2b-b2a-1-when-ab1/17196#17196 Answer by Markus for Is there a good reason why a^{2b} + b^{2a} <= 1 when a+b=1? Markus 2010-03-05T17:32:22Z 2010-03-16T19:26:49Z <p>EDIT: wrong proof attempt</p> http://mathoverflow.net/questions/17189/is-there-a-good-reason-why-a2b-b2a-1-when-ab1/17199#17199 Answer by Gjergji Zaimi for Is there a good reason why a^{2b} + b^{2a} <= 1 when a+b=1? Gjergji Zaimi 2010-03-05T18:15:16Z 2010-03-05T18:15:16Z <p>This is too long to be a comment.</p> <p>This inequality appears as conjecture 4.8 in this article <a href="http://jipam.vu.edu.au/article.php?sid=1077" rel="nofollow">here</a>. As you probably know, V.Cirtoaje has written many books on olympiad-style inequalities, so you see my reason for not <em>believing</em> that a simple solution exists. Optimization problems can sometimes (or most of the time actually) require "non-elegant" analysis (whatever that means to you) so this search is a bit pointless in my opinion. If an elegant solution is found to some nontrivial optimization/estimation problem then it is very likely to appear in an olympiad/competition, and AOPS is the right place to carry such discussions.</p> http://mathoverflow.net/questions/17189/is-there-a-good-reason-why-a2b-b2a-1-when-ab1/18321#18321 Answer by Yaakov Baruch for Is there a good reason why a^{2b} + b^{2a} <= 1 when a+b=1? Yaakov Baruch 2010-03-15T22:57:28Z 2010-03-16T00:11:55Z <p>UPDATE: this "proof" is WRONG!<br> We want to prove that a^(2-2a)+(1-a)^(2a)&lt;=1 for 0&lt;=a&lt;=1, or for 0&lt;=a&lt;=1/2 because of symmetry under a -> 1-a. Set f(a)=a^(2-2a). Then we want to prove that f(a)&lt;=1-f(1-a), but since trivially f(a)&lt;=a in [0,1/2], we have f(a)&lt;=a&lt;=1-a&lt;=1-f(1-a). QED</p> http://mathoverflow.net/questions/17189/is-there-a-good-reason-why-a2b-b2a-1-when-ab1/21126#21126 Answer by fedja for Is there a good reason why a^{2b} + b^{2a} <= 1 when a+b=1? fedja 2010-04-12T17:17:08Z 2010-04-13T14:22:52Z <p>Fixed now. I spent some time looking for some clever trick but the most unimaginative way turned out to be the best. So, as I said before, the straightforward Taylor series expansion does it in no time. </p> <p>Assume that $a>b$. Put $t=a-b=1-2b$.</p> <p>Step 1: <code>\begin{aligned} a^{2b}&amp;=(1-b)^{1-t}=1-b(1-t)-t(1-t)\left[\frac{1}2b^2+\frac{1+t}{3!}b^3+\frac{(1+t)(2+t)}{4!}b^4+\dots\right] \\ &amp;\le 1-b(1-t)-t(1-t)\left[\frac{b^2}{1\cdot 2}+\frac{b^3}{2\cdot 3}+\frac{b^4}{3\cdot 4}+\dots\right] \\&amp; =1-b(1-t)-t(1-t)\left[b\log\frac 1{a}+b-\log\frac {1}a\right] \\ &amp;=1-b(1-t^2)+(1-b)t(1-t)\log\frac{1}a=1-b\left(1-t^2-t(1+t)\log\frac 1a\right) \end{aligned}</code> (in the last line we rewrote $(1-b)(1-t)=(1-b)2b=b(2-2b)=b(1+t)$)</p> <p>Step 2. We need the inequality <code>$e^{ku}\ge (1+u)(1+u+\dots+u^{k-1})+\frac k{k+1}u^{k+1}$</code> for $u\ge 0$. For $k=1$ it is just $e^u\ge 1+u+\frac{u^2}{2}$. For $k\ge 2$, the Taylor coefficients on the left are $\frac{k^j}{j!}$ and on the right $1,2,2,\dots,2,1$ (up to the order $k$) and then $\frac{k}{k+1}$. Now it remains to note that $\frac{k^0}{0!}=1$, $\frac{k^j}{j!}\ge \frac {k^j}{j^{j-1}}\ge k\ge 2$ for $1\le j\le k$, and $\frac{k^{k+1}}{(k+1)!}\ge \frac{k}{k+1}$.</p> <p>Step 3: Let $u=\log\frac 1a$. We've seen in Step 1 that $a^{2b}\le 1-b(1-t\mu)$ where $\mu=u+(1+u)t$. In what follows, it'll be important that $\mu\le\frac 1a-1+\frac 1a t=1$ (we just used $\log\frac 1a\le \frac 1a-1$ here.</p> <p>We have $b^{2a}=b(a-t)^t$. Thus, to finish, it'll suffice to show that $(a-t)^t\le 1-t\mu$. Taking negative logarithm of both sides and recalling that $\frac 1a=e^u$, we get the inequality <code>$$tu+t\log(1-te^u)^{-1}\ge \log(1-t\mu)^{-1}$$</code> to prove. Now, note that, according to Step 2, <code>\begin{aligned} &amp;\frac{e^{uk}}k\ge \frac{(1+u)(1+u+\dots+u^{k-1})}k+\frac{u^{k+1}}{k+1} \ge\frac{(1+u)(\mu^{k-1}+\mu^{k-2}u+\dots+u^{k-1})}k+\frac{u^{k+1}}{k+1} \\ &amp;=\frac{\mu^k-u^k}{kt}+\frac{u^{k+1}}{k+1} \end{aligned}</code> Multiplying by $t^{k+1}$ and adding up, we get $$t\log(1-te^u)^{-1}\ge -ut+\log(1-t\mu)^{-1}$$ which is exactly what we need.</p> <p>The end.</p> <p>P.S. If somebody is still interested, the bottom line is almost trivial once the top line is known. Assume again that $a>b$, $a+b=1$. Put $t=a-b$.</p> <p><code>\begin{aligned} &amp;\left(\frac{a^b}{2^b}+\frac{b^a}{2^a}\right)^2=(a^{2b}+b^{2a})(2^{-2b}+2^{-2a})-\left(\frac{a^b}{2^a}-\frac{b^a}{2^b}\right)^2 \\ &amp;\le 1+\frac 14\{ [\sqrt 2(2^{t/2}-2^{-t/2})]^2-[(1+t)^b-(1-t)^a]^2\} \end{aligned}</code> Now it remains to note that $2^{t/2}-2^{-t/2}$ is convex on $[0,1]$, so, interpolating between the endpoints, we get $\sqrt 2(2^{t/2}-2^{-t/2})\le t$. Also, the function $x\mapsto (1+x)^b-(1-x)^a$ is convex on $[0,1]$ (the second derivative is $ab[(1-x)^{b-2}-(1+x)^{a-2}]$, which is clearly non-negative). But the derivative at $0$ is $a+b=1$, so $(1+x)^b-(1-x)^a\ge x$ on $[0,1]$. Plugging in $x=t$ finishes the story. </p> http://mathoverflow.net/questions/17189/is-there-a-good-reason-why-a2b-b2a-1-when-ab1/21160#21160 Answer by Will Jagy for Is there a good reason why a^{2b} + b^{2a} <= 1 when a+b=1? Will Jagy 2010-04-12T22:28:31Z 2010-04-13T02:40:16Z <p>I think it gives a better sense of the geometry of the problem to ask whether, with non-negative $x,y$ such that $$\frac{1}{2} \leq x + y \leq 1,$$ we can prove that $$x^{2 y} + y^{2 x} \leq 1 ?$$ I'm not entirely certain where the second level curve component, through $\left( \frac{1}{4} , \frac{1}{4}\right),$ meets the axes. My programmable calculator seems to think that, if this arc does have $\left( \frac{1}{2} , 0 \right)$ as a limit point, the arc is tangent to the $x$-axis. </p> <p>I see, this was pointed out in a comment on March 17 by Yaakov Baruch, one needs to click on the "show 6 more comments." I think I will leave this here anyway.</p> http://mathoverflow.net/questions/17189/is-there-a-good-reason-why-a2b-b2a-1-when-ab1/98117#98117 Answer by unknown (google) for Is there a good reason why a^{2b} + b^{2a} <= 1 when a+b=1? unknown (google) 2012-05-27T14:34:55Z 2012-05-27T14:34:55Z <p>This type of problem can be solved by the following approach:</p> <ul> <li>Maximize the function a^(2b)+b^(2a) s.t. a+b=1. </li> <li>We find that the function is maximized at a=b=1/2 and takes value 1.</li> </ul> http://mathoverflow.net/questions/17189/is-there-a-good-reason-why-a2b-b2a-1-when-ab1/130399#130399 Answer by jbc for Is there a good reason why a^{2b} + b^{2a} <= 1 when a+b=1? jbc 2013-05-12T09:45:39Z 2013-05-12T09:45:39Z <p>Since this question has been bumped up I would like to state what I think is its natural framework: We have the inequality $f(a,b) \leq 1$ for $a+b=k$ when $k$ lies between $\frac 12$ and $1$. Otherwise, the inequality is $f(a,b) \leq \frac {k^k}{2^{k-1}}$ (with $f(a,b) = a^{2b}+b^{2a}$). This version is not just more comprehensive but it illustrates the dichotomy in where the maximum occurs (at the symmetric point $(\frac k2,\frac k2)$ or at the boundary $(k,0)$). The two cases considered above ($k=\frac 12$ and $k=1$) are precisely the transitional ones. One can also get estimates from below (usually by the constant $1$ but in a small neighbourhood around the critical interval $[\frac 12,1]$ the sharp version involves values which are given implicitly as the solution of transcendental equations).</p> <p>(P.S. I had already given some of this information in a comment but, since it elicited no reaction, I have taken the liberty to repeat it here despite the fact that it isn't really an answer but, hopefully, does shed some light on the problem and its solution).</p>