# Proving inequality $(a+\frac{1}{a})^2 + (b+\frac{1}{b})^2 \geq \frac{25}{2}$ for $a+b=1$

If $a, b$ are positive real numbers and $a+b = 1$, prove that :

$$\left(a+\frac{1}{a}\right)^2 + \left(b+\frac{1}{b}\right)^2 \geq \frac{25}{2}$$

I can see that the value $\frac{25}2$ is attained for $a=b=\frac12$. But I do not know how to show that this is the minimal possible value.

Thank you.

• A very nice argument based on convexity of $f(x)=\left(x+\frac1x\right)^2$ was given in this comment. – Martin Sleziak May 31 '16 at 8:08

First Method.

$a^{2}+\dfrac{1}{a^{2}}\geq -15a+\dfrac{47}{4}$ $~$ $\Longleftrightarrow$ $~$ $(2a-1)^{2}(a^{2}+16a+4)\geq 0$ : evident
$\therefore$ $\left(a+\dfrac{1}{a}\right)^{2}+\left(b+\dfrac{1}{b}\right)^{2}=4+a^{2}+\dfrac{1}{a^{2}}+b^{2}+\dfrac{1}{b^{2}}\geq 4-15a+\dfrac{47}{4}-15b+\dfrac{47}{4}=\dfrac{25}{2}$

Second Method.

$\left(a+\dfrac{1}{a}\right)^{2}+\left(b+\dfrac{1}{b}\right)^{2}=4+\underline{a^{2}+b^{2}}+\underline{\dfrac{1}{a^{2}}+\dfrac{1}{b^{2}}}\geq 4+\underline{\dfrac{1}{2}}+\underline{8}=\dfrac{25}{2}$

1. $(1^{2}+1^{2})(a^{2}+b^{2})\geq (a+b)^{2}$ : Cauchy-Schwarz
2. $(a+b)(a+b)\left(\dfrac{1}{a^{2}}+\dfrac{1}{b^{2}}\right)\geq (1+1)^{3}$ : Holder
• from where did you got the "-15a + 47/4" ? – user93765 Sep 8 '13 at 17:27
• From tangent line at 1/2 – chloe_shi Sep 8 '13 at 17:29

First $$(a+1/a)^2 + (b+1/b)^2 \geq\frac{1}{2} (a+b+1/a+1/b)^2=\frac{1}{2}(1+1/(ab))^2.$$

Then note that $$ab\le(a+b)^2/4=1/4.$$

Take it into the first one, you may get your inequality.

Generalization:

If $\sum_{1\le r\le n}a_r=S$ where $a_i$s are positive real numbers

$$\sum_{1\le r\le n}\left(a_r+\frac1{a_r}\right)^2=\sum_{1\le r\le n}a_r^2+\sum_{1\le r\le n}a_r^{-2}+2n$$

We know $$\frac{\sum_{1\le r\le n}a_r^m}n> \text{ or } <\left(\frac{\sum_{1\le r\le n}a_r}n\right)^m$$ according as $m$ lies or does not lie in $(0,1)$

Putting $m=2,$ $$\frac{\sum_{1\le r\le n}a_r^2}n>\left(\frac{\sum_{1\le r\le n}a_r}n\right)^2=\left(\frac Sn\right)^2=\frac{S^2}{n^2}$$

Putting $m=-2,$ $$\frac{\sum_{1\le r\le n}a_r^{-2}}n>\left(\frac{\sum_{1\le r\le n}a_r}n\right)^{-2}=\left(\frac Sn\right)^{-2}=\frac{n^2}{S^2}$$

On simplification, $$\sum_{1\le r\le n}\left(a_r+\frac1{a_r}\right)^2\ge \frac{(n^2+S^2)^2}{S^2n}$$

Here $S=1,n=2$

We can use the inequalities between quadratic mean (a.k.a. square root mean), arithmetic mean, geometric mean and harmonic mean $$\sqrt{\frac{x^2+y^2}2} \ge \frac{x+y}2 \ge \sqrt{xy} \ge \frac2{\frac1x+\frac1y}.$$ These inequalities are true for any $x,y>0$. The equality holds if and only if $x=y$. They can be generalized for more than two variables (also proofs for two variables are easier). If you are not familiar with these inequalities, you can find a lot of material on them, just try to search for some reasonable queries like this one or this one.

You want to minimize $f(a,b)=\left(a+\frac1a\right)^2+\left(b+\frac1b\right)^2$. Notice that $$f(a,b)=\left(a+\frac1a\right)^2+\left(b+\frac1b\right)^2 = a^2+b^2 + \frac1{a^2}+\frac1{b^2} +4.$$ So minimizing $g(a,b)=a^2+b^2 + \frac1{a^2}+\frac1{b^2}$ is an equivalent problem.

Using QM-AM inequality we get $$\frac{a^2+b^2}2 \ge \left(\frac{a+b}2\right)^2 = \frac14$$ which implies $$a^2+b^2 \ge \frac12.\tag{1}$$

If we combine HM-GM and AM-GM we get $$\frac2{\frac1{a^2}+\frac1{b^2}} \le \sqrt{a^2b^2} = ab \le \left(\frac{a+b}2\right)^2 = \frac14,$$ which is equivalent to $$\frac1{a^2}+\frac1{b^2} \ge 8.\tag{2}$$

By adding the inequalities $(1)$ and $(2)$ we get $$g(a,b) = a^2+b^2 + \frac1{a^2}+\frac1{b^2} \ge 8+\frac12$$ and $$f(a,b)=g(a,b)+4 \ge 12+\frac12 = \frac{25}2.$$

The inequalities $(1)$ and $(2)$ can be also interpreted geometrically.

Minimizing $a^2+b^2$ for $a+b=1$ is simply finding the point on the line $a+b=1$ which is closest to the origin. If you draw the picture, you immediately see that it is the point given by $a=b=\frac12$.

We also want some geometrical insight into minimizing $\frac1{a^2}+\frac1{b^2}$ for $a+b=1$. Let us transform this problem a bit.

If we denote $x=\frac1a$, then $y=\frac1b=\frac1{1-a}=\frac1{1-\frac1x}=\frac{x}{x-1}$. It is not difficult to see that this is a hyperbole with the asymptotes $x=1$ and $y=1$. And we want to minimize $\frac1{a^2}+\frac1{b^2}=x^2+y^2$, which means that we want to find the closest point to the origin on this hyperbole. (To be more precise, only in the part of the hyperbole in the first quadrant, since $x,y>0$.) Here is a plot from WolframAlpha.

Again we see from the picture that the closest point will be the one with $x=y$. (Which gives us $x=y=2$ and $a=b=\frac12$.)

• Originally I posted this as an answer to this question. But since the emphasis of that question seems to be evaluation of the OPs attempt, this is probably a better place where to post this. – Martin Sleziak May 31 '16 at 8:32