Processing math: 100%

Wednesday, December 23, 2015

Prove a(ac)2+b(bc)2(ac)(bc)(a+bc) for all real a,b,c0: Second Attempt

For reals a,b,c0, prove the inequality

a(ac)2+b(bc)2(ac)(bc)(a+bc)

and state when the equality holds.

From our previous attempt, we know AM-GM inequality wouldn't help, so we try to expand both sides of the equation and see where that leads us:

a(ac)2+b(bc)2(ac)(bc)(a+bc)

a(a22ac+c2)+b(b22bc+c2)(abacbc+c2)(a+bc)

a32a2c+ac2+b32b2c+bc2

a2b+ab2abca2cabc+ac2abcb2c+bc2+ac2+bc2c3

Rearrange the terms we get:

a3+b3+c3+3abca2(b+c)+b2(a+c)+c2(a+b)

I hope you've developed a good sense of familiarity with Schur's inequality that says:

For non-negative real numbers x, y, z and a positive number t,

xt(xy)(xz)+yt(yz)(yx)+zt(zx)(zy)0.

The equality holds in two cases:

1. x=y=z, or

2. One fo them is 0, while the other two are equal.

For t=1, Schur's inequality can be rearranged into

x3+y3+z3+3xyzx2(y+z)+y2(x+z)+z2(x+y)

Therefore
a3+b3+c3+3abca2(b+c)+b2(a+c)+c2(a+b) is actually the Schur's inequality when t=1. Equality occurs when a=b=c or when two of a,b or c are equal, and the third is a zero.

No comments:

Post a Comment