Let $a$ and $b$ be positive numbers such that $a+b=1$. Prove that: $$a^{4b^2}+b^{4a^2}\leq1$$
I think this inequality is very interesting because the equality "occurs" for $a=b=\frac{1}{2}$ and also for $a\rightarrow0$ and $b\rightarrow1$.
I tried to work with a function of one variable, but the derivative is not easy.
I also don't get something solvable by Taylor series.


We define $f(x,y)=x^{4y^2}+y^{4x^2}$.
This is my plan to solve the problem:
This will be troublesome:
$$g(x)=x^{4(1-x)^2}+(1-x)^{4x^2}$$
Set $g_{1}(x) = x^{4(1-x)^2}$ and $g_{2}(x) = (1-x)^{4x^2}$. Therefore, we can break it up like so:
$$g'(x) = g_{1}'(x)+g_{2}'(x)$$ $$g_{1}'(x)=g_{1}', g_{2}'(x)=g_{2}'$$ $$\ln(g_{1})=\ln \left(x^{4(1-x)^2}\right)$$ $$\ln(g_{1})={4(1-x)^2} \cdot \ln \left(x\right)$$ $$\frac{g_{1}'}{g_{1}}= 4 \cdot \left((1-x)^2 \right)' \cdot \ln(x)+\frac{4(1-x)^2}{x}$$ $$\frac{g_{1}'}{g_{1}}= 4 \cdot -2 \cdot (1-x) \cdot \ln(x)+\frac{4(1-x)^2}{x}$$ $$\frac{g_{1}'}{g_{1}}= 8(x-1)\ln(x)+\frac{4x^2-8x+4}{x}$$ $$\frac{g_{1}'}{g_{1}}= 8(x-1)\ln(x)+4x-8+\frac{4}{x}$$ $$g_{1}'= x^{4(1-x)^2} \cdot \left(8(x-1)\ln(x)+4x-8+\frac{4}{x}\right)$$
Alright. Deep breath. Let's keep going.
$$\ln(g_{2})=4x^2\ln(1-x)$$ $$\frac{g_{2}'}{g_{2}}=8x\ln(x-1)+\frac{4x^2}{x-1}$$
$$g_{2}'= (1-x)^{4x^2}\left(8x\ln(x-1)+\frac{4x^2}{x-1}\right)$$
$$g_{1}'= x^{4(1-x)^2} \cdot \left(8(x-1)\ln(x)+4x-8+\frac{4}{x}\right)$$
$$g'(x)=x^{4(1-x)^2} \cdot \left(8(x-1)\ln(x)+4x-8+\frac{4}{x}\right) + (1-x)^{4x^2}\left(8x\ln(1-x)+\frac{4x^2}{x-1}\right)$$
The maximum appears (according to the closed interval method), either at:
$$g(0)=1$$ $$g(1)=1$$
Or at the $x$-value(s) of the solution of:
$$0=x^{4(1-x)^2} \cdot \left(8(x-1)\ln(x)+4x-8+\frac{4}{x}\right) + (1-x)^{4x^2}\left(8x\ln(1-x)+\frac{4x^2}{x-1}\right)$$
Therefore, if we set $x_{1}$, $x_{2}$, $x_{3}$ ... to be the solutions to the equation above in the interval $x_{n} \in [0,1]$, we have reduced the problem to proving that:
$$g(x_{1}),g(x_{2}), g(x_{3})... \leq 1$$
Through some graphing of $g(x)$, we see that there exists $x_{1}$, $x_{2}$, and $x_{3}$, where $x_{2}$ is $0.5$ and the others are not easily calculatable or are irrational.
It can easily be seen that $g'(0.5) = 0$ and that $g(0.5)=1$ (a maximum of the function). Since we now have proof that $g(x_{2}) \leq 1$ and we see that there does not exist an $x_{n}$ s.t. $n>3$ and $g'(x_{n})=0$, we can reduce our previous problem to:
Prove that:
$$g(x_{1}), g(x_{3}) \leq 1$$
Through Newton's Method, we obtain approximations of $x_{1}$ and $x_{3}$ accurate to 10 decimal places. We state them below:
$$x_{1} \approx 0.281731964017$$ $$x_{3} \approx 0.718268035983$$
Note that:
$$g'(x_{1}) \approx g'(0.281731964017)=7.349676423 \cdot 10^{-14}$$ $$g(x_{1}) \approx g(0.281731964017)=0.973494223187$$
We now have that $g(x_{1})$ is a minimum of the function and that $g(x_{1}) \leq 1$
Finally:
$$g'(x_{3}) \approx g'(0.718268035983)=-7.349676423 \cdot 10^{-14}$$ $$g(x_{3}) \approx g(0.718268035983)=0.973494223187$$
We now have that $g(x_{1})$ is also a minimum of the function and that $g(x_{1}) \leq 1$
We now have that:
$$g(x_{1}), g(x_{2}), g(x_{3}) \leq 1$$
Q.E.D
I took a very head-on brute-force approach to the problem, but I am happy with the rigorousness of the result and the final proof. We also now have the minimums of the function, which if anyone is curious, is $\approx 0.973494223187$