If a, b, and c are non-negative real numbers and $a + b + c = 2 $, prove that $ 2 \ge a^2 b^2 + b^2 c^2 + c^2 a^2 $
2026-03-27 16:03:58.1774627438
I'm new to proving inequalities. How does one prove this?
108 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
It's actually $1\ge a^2 b^2 + b^2 c^2 + c^2 a^2$.
It is enough to show the homogenous symmetric inequality $$ (a+b+c)^4 - 16(a^2 b^2 + b^2 c^2 + c^2 a^2)\ge 0$$
Assume an ordering $a \le b \le c$. Write \begin{eqnarray} a &=&p \\ b&=& p+ q\\ c &=& p+q +r \end{eqnarray} with $p$, $q$, $r\ge 0$. Substitute $a$, $b$, $c$ in terms of $p$, $q$, $r$ in the expression above. We get a polynomial of degree $4$ in $p$, $q$, $r$ with all the coefficients positive. Since $p$, $q$, $r$ are also positive we conclude that the expression is positive.
Obs: We have equality if and only if two of the $a$, $b$, $c$ are equal and the third is $0$.