Since the inequality involves the minimum of two positive numbers and since the function y=x2 is increasing on the set R+, our task is to verify
(x+y+z)(x1+y1+z1)≤(yx+zy+xz)2and(x+y+z)(x1+y1+z1)≤(xy+zx+yz)2,(1)
as well as to find when *at least one* equality in (1) holds. Replacing a triple (x, y, z)
by the triple (y, x, z), we get the second inequality in (1) from the first one. Thus we
can restrict to the proof of the first inequality. Distributing both sides leads to
3+yx+zx+xy+zy+xz+yz≤y2x2+z2y2+x2z2+2(zx+xy+yz).
Let us introduce the new (positive) variables a=x/y, b=y/z, c=z/x and rewrite
the last inequality as
(a2−1−a+a1)+(b2−1−b+b1)+(c2−1−c+c1)≥0.(2)
For any positive t, we notice that
t2−1−t+t1=(t2−1)−tt2−1=t(t2−1)(t−1)=t(t−1)2(t+1).
This implies that (2) holds as well and that (2) becomes an equality if and only if a=b=c=1, i.e. x=y=z for the original variables. Note that the last condition does not change under transformation (x,y,z)→(y,x,z). Thus the original inequality is proven and becomes an equality if and only x=y=z.