If a, b, and c are non-negative real numbers and k 1 is real, then the
following inequality holds: ak (a b)(a c) + bk (b c)(b a) + ck (c a)(c b) 0 Proof. We can assume without loss of generality that c b a via a permutation of the variables (as both sides are symmetric in those variables). Then collecting terms, we wish to show that
(a b) ak (a c) bk (b c) + ck (a c)(b c) 0 which is clearly true as every term on the left is positive. There are a couple of special cases worth noting: Taking k = 1, we get the well-known a3 + b3 + c3 + 3abc ab(a + b) + ac(a + c) + bc(b + c) If c = 0, we get (a b)(ak+1 bk+1 ) 0. If b = c = 0, we get ak+2 0. If b = c, we get ak (a c)2 0.
h1i hTheoremi h26D15i This text is available under the Creative Commons Attribution/Share-Alike License 3.0. You can reuse this document or portions thereof only if you do so under terms that are compatible with the CC-BY-SA license.