Inequality Handout

The Wonderful Schur’s Inequality

Aritra12
 CONTENTS I

Contents

Contents I
0.1 Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1

1 Schur’s Inequality 2
1.1 Schur’s Inequality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.2 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
1.3 Hints to selected problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
1.4 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
 Structure 1

Acknowledgements

This handout is on " The Wonderful Schur’s Inequality " is intended for inequalities and it
has been authored by Aritra12. The handout basically covers up some of the important cases,
results & some techniques on Schur’s Inequality, I am also thankful to the several resources
which I listed also forgot some to enlist also users on AoPS who posted problems and solution.
No handout can be all perfect so if you see any problem or typos don’t forget to gmail at
gaussiancurvature360@gmail.com.

0.1 Structure

The topic is basically divided into 9 parts namely the

• Schur’s Inequality
Introduction about it , what is schur’s Inequality & its proof.

• The k = 1 case
One of the most often used case of the schur’s Inequality or the third degree Schur’s
Inequality.

• The k = 2 case
One of the most often used case of the schur’s Inequality or the fourth degree Schur’s
Inequality.

• Revisiting the k = 1 case

Revisiting it for some more forms & variants with some more examples.

• Revisiting the k = 2 case

Revisiting it for some more forms & variants with some more examples.

• Generalised Schur-Vornicu Schur Inequality

About it & some example problems.

• Extension
Extension of schur’s Inequality to five , six seven variables.

• Two beautiful Results

two beautiful results which can be deduced from schur namely Euler’s Inequality &
Gerretsen’s Inequality.

• Some related problems

Title is self explanatory also hints to selected problems are provided.
Structure CHAPTER 1. SCHUR’S INEQUALITY 2

Chapter 1

Schur’s Inequality

• Schur’s Inequality

• The k = 1 case

• The k = 2 case

• Revisiting the k = 1 case

• Revisiting the k = 2 case

• Generalised Schur-Vornicu Schur Inequality

• Extension

• Two beautiful Results

.

• Some related problems

 Schur’s Inequality 3

1.1 Schur’s Inequality

Theorem 1.1.1 (Schur’s Inequality) — For non-negative real numbers a, b, c and for
k ∈ R+ ,

ak (a − b)(a − c) + bk (b − a)(b − c) + ck (c − a)(c − b) ≥ 0

Proof.1 (Without loss of generality) That 0 ≤ x ≤ y ≤ z. At a minimum, this lets us identify

some positive terms. For example, we now see that the first summand is non negative, so we
can look at what’s left. The common factor is of these two terms is z − y, and when we take
it out our sum becomes
n o
ak (a − b)(a − c) + (c − b) ck (c − a) − bk (b − a)

By grace of the Fates, we now see why the second term is also non negative both factors of
ck (c − a) are at least as large as the factors of bk (b − a) Finally, we can read off the case of
equality from the above statement using the observation that for the sum to be zero, both
summands must be zero. There are some special forms of schur’s inequality(basically for
k = 1, 2) which have been shown below, they are usually used in solving this inequalities.

Case 1 (k = 1). When k = 1 in schur’s inequality,

a3 + b3 + c3 + 3abc ≥ a2 (b + c) + b2 (a + c) + c2 (a + b)

also this is true

9abc
(a + b + c)2 + ≥ 4(ab + bc + ca)
a+b+c

Problem 1.1.1. Let a, b, c be three real numbers. Prove that

2 5 
a6 + b6 + c6 + a2 b2 c2 ≥ a (b + c) + b5 (c + a) + c5 (a + b)
3

According to AM-GM inequality and Schur inequality, we deduce that

3 ∑ a6 + 3a2 b2 c2 ≥ 2 ∑ a6 + ∑ a4 b2 + c2


cyc cyc cyc
   
= ∑ a + a b + ∑ a + a c ≥ 2 ∑ a5 (b + c)
6 4 2 6 4 2
cyc cyc cyc

1 http://www-stat.wharton.upenn.edu/ steele/Publications/Books/CSM-
C/New%20Problems/SchursInequality/SchursInquality.tex.pdf
 Schur’s Inequality 4

Problem 1.1.2. a, b, and c are non-negative reals such that a + b + c = 1. Prove that
1
a3 + b3 + c3 + 6abc ≥
4

Recall of schur’s inequality for k = 1, we know that,

a3 + b3 + c3 + 3abc ≥ a2 (b + c) + b2 (a + c) + c2 (a + b)

Now back to the main problem, just multiply both sides by 4,

4(a3 + b3 + c3 ) + 24abc ≥ 1

Note that a + b + c = 1 so (a + b + c)3 = 1 So we can also rewrite that,

4(a3 + b3 + c3 ) + 24abc ≥ (a + b + c)3 = 1

Hence we get this inequality,

a3 + b3 + c3 + 6abc ≥ a2 (b + c) + b2 (c + a) + c2 (a + b)

which obviously is true as we got in the first line.

Problem 1.1.3. Let a, b, c be positive reals such that a + b ≥ c; b + c ≥ a; and c + a ≥ b, we

have
2a2 (b + c) + 2b2 (c + a) + 2c2 (a + b) ≥ a3 + b3 + c3 + 9abc
After checking that equality holds for (a, b, c) = (t,t,t) and (2t,t,t), it is apparent that more
than straight AM-GM will be required. To handle the condition, put a = y + z, b = z + x, c =
x + y with x, y, z ≥ 0. Now, the left hand side becomes

4x3 + 4y3 + 4z3 + 10x2 (y + z) + 10y2 (z + x) + 10z2 (x + y) + 24xyz

while the right hand side becomes

2x3 + 2y3 + 2z3 + 12x2 (y + z) + 12y2 (z + x) + 12z2 (x + y) + 18xyz

The desired is seen to be equivalent to

x3 + y3 + z3 + 3xyz ≥ x2 (y + z) + y2 (z + x) + z2 (x + y),

which is Schur’s inequality. Equality holds where x = y = z, which gives (a, b, c) = (t,t,t), or
when two of x, y, z are equal and the third is 0, which gives (a, b, c) ∈ {(2t,t,t), (t, 2t,t), (t,t, 2t)}

Problem 1.1.4. For x, y, z ≥ 0, the following inequality holds:

√
 p  √
3 p
5 ∑ x + y ∑ (x + y)(y + z) ≥ ∑ x + y + 18 (x + y)(y + z)(z + x)
 Schur’s Inequality 5

If (x√+ y)(y +√z)(z + x) = 0, then at least two of x, y, z vanish so that the inequality reduces to
10a a ≥ 8a a, for some √ a ≥ 0, which is obviously true. Assume (x + y)(y + z)(z + x) 6= 0.
√ √
Then x + y, y + z, z + x form the sides of a triangle. The segments of the sides from
the vertices of the triangle to the points of tangency with the incircle split each of the sides
√ √
into two
√ pats, thus insuring the existence of a, b, c > 0 such that x + y = a + b, y+z =
b + c, z + x = c + a. In terms of a, b, c the inequality becomes

5(a + b + c) a2 + b2 + c2 + 3(ab + bc + ca) ≥ 4(a + b + c)3 + 9(a + b)(b + c)(c + a)

 

Let for ou ease S = a3 + b3 + c3 , s = ab(a + b) + bc(b + c) + ca(c + a), and p = abc. The
straightforward algebraic manipulation reduces the above inequality to

5S + 5s + 15s + 45p ≥ 4S + 12s + 24p + 9s + 18p

which is simplified to S + 3p ≥ s that is again the k=1 case of schur’s Inequality.

 Schur’s Inequality 6

Problem 1.1.5 (Cezar Lupu). Let a, b, c be positive reals such that a + b + c + abc = 4.
Prove that √
a b c 2
√ +√ +√ ≥ · (a + b + c)
b+c c+a a+b 2

Note that Schur’s inequality for k = 1 can be expressed as

9abc
≥ 4(ab + bc + ca) − (a + b + c)2
a+b+c
let us claim that so as to proof the other , somehow going to follow the method of contradiction,

Claim— ab + bc + ca > a + b + c

9abc
≥ 4(ab + bc + ca) − (a + b + c)2 > (a + b + c)(4 − (a + b + c)) = abc(a + b + c)
a+b+c
Hence according to our claim a + b + c < 3,but wait also note that on the other hand abc < 1,
which implies a + b + c + abc = 4 < 4 which is a clear contradiction. So the other
ab + bc + ca < a + b + c
is true & now by Cauchy Schwarz
! !
√ a
∑a b+c ∑ √b + c ≥ (a + b + c)2
cyc cyc

But, also by Cauchy,

p √
(a + b + c)(a(b + c) + b(c + a) + c(a + b)) ≥ ∑ a b + c
cyc

Hence its true by our proved equation before that

√ r √
a 2 a+b+c 2
∑ √b + c ≥ 2 · (a + b + c) · ab + bc + ca ≥ 2 · (a + b + c)
cyc

Case 2 (k = 2). When k = 2 in schur’s inequality,

a4 + b4 + c4 + abc(a + b + c) ≥ a3 b + a3 c + b3 a + b3 c + c3 a + c3 b

Problem 1.1.6 (srijonrick). Prove that

! ! ! !
∑(a − x)4 + 2 ∑ x3 y + 4 ∑ x2y2 + 8xyza > ∑(a − x)2(a2 − x2)
cyc sym cyc cyc

where a = x + y + z and x, y, z ∈ R.
 Schur’s Inequality 7

First recall Schur’s Inequality with k = 2,

d 4 +b4 +c4 +dbc(d +b+c) > d 3 b+d 3 c+b3 d +b3 c+c3 d +c3 b = d 3 (b+c)+b3 (d +c)+c3 (d +b)−(∗)
Now in (∗) if we take
d = x + y, b = y + z and c = z + x
we get,
(x + y)4 + (y + z)4 + (z + x)4 + (x + y)(y + z)(z + x)2(x + y + z) > (x + y)3 (x + y + 2z) + (y +
z)3 (2x + y + z) + (z + x)3 (x + 2y + z)
Now it’s given that a = x + y + z, using that along with the above equation we get,
(a − x)4 + (a − y)4 + (a − z)4 + E > (a − x)3 (a + x) + (a − y)3 (a + y) + (a − z)3 (a + z) − (1)
where E = 2(x + y)(y + z)(z + x)(x + y + z)
If we expand E we get it as
2x3 y + 2x3 z + 4x2 y2 + 4x2 z2 + 8x2 yz + 2xy3 + 2xz3 + 8xyz2 + 8xy2 z + 2yz3 + 4y2 z2 + 2y3 z.
Now recall notations

∑ x2y2 = x2y2 + y2z2 + z2x2 and ∑ x3y = x3y + x3z + y3z + y3x + z3y + z3x
cyc sym

Hence E = 2 ∑sym x3 y + 4 ∑cyc x2 y2 + 8xyza − (2) and (a − x)3 (a + x) = (a − x)2 (a2 +

x2 ) − (3)
On combining (1), (2) and (3) we get the desired inequality:
! ! ! !
∑(a − x)4 + 2 ∑ x3 y + 4 ∑ x2y2 + 8xyza > ∑(a − x)2(a2 − x2)
cyc sym cyc cyc

Note. This two cases are generally in use in schur’s inequality but don’t think that problem
are only with this two cases, these are just the two important cases of Schur’s Inequality.

Case 3 (Third Degree Schur Inequality). Note again though same as the before we will revisit
case of k = 1 also useful form
a2 + b2 + c2 (a + b + c) + 9abc ≥ 2(a + b + c)(ab + bc + ca)

Even that is a third degree Schur Inequality

Oh also pls don’t think they are bound to be 1 or 2 also can be 3, now if we let also now take
k = 3,

Problem 1.1.7 (Aritra12). Let p, q, r be non negative reals such that pqr = 1. Find the
maximum value for the expression

∑ p[r4 + q4 − p4 − p]
cyc
 Schur’s Inequality 8

This is Schur’s Inequality with k = 3, Note that Schur’s Inequality with k = 3 gives
∑ p3(p − q)(p − r) ≥ 0
cyc

Which implies that,

∑ p5 + ∑ p3qr ≥ ∑ p4q + ∑ p4r
cyc cyc cyc cyc
since
pqr = 1 and ∑ p4q = ∑ pr4, ∑ p4r = ∑ pq4
cyc cyc cyc cyc
It concludes that,
∑ p5 + ∑ p2 ≥ ∑ pr4 + ∑ pq4
cyc cyc cyc cyc

∑ p[r4 + q4 − p4 − p] ≤ 0,
cyc
Hence the maximum value of the expression is 0 with equality holding iff p = q = r = 1.

Problem 1.1.8. Let a, b, c be positive real numbers. Prove that

a2 b2 c2 3
p +p +p ≥
(1b + c) (b8 + c3 ) (c + a) (c8 + a3 ) (a + b) (a8 + b3 ) 2
(Pham [Kim Hung)

By Holder inequality, we deduce that

!2 ! !3
a2 2 3 3

2
∑ p(b + c) (b3 + c3) ∑ a (b + c) b +c ≥ ∑a
cyc cyc cyc

So it is enough to prove that

!3
∑ a2 ≥ 9 ∑ a2 (b + c) b3 + c3


4
cyc cyc
6 4 2 2 2 2 2 2


⇔ 4∑a +3∑a b +c + 24a b c ≥ 9abc ∑ a (b + c).
cyc cyc cyc

According to the third degree-Schur inequality ∑cyc a2 (b + c) ≤ ∑cyc a3 + 3abc, so it’s enough
to prove that
4 ∑ a6 + 3 ∑ a4 b2 + c2 ≥ 9 ∑ a4 bc + 3a2 b2 c2


cyc cyc cyc
which is obvious by AM-GM inequality because
 
2 ∑ a6 = ∑ a6 + b6 ≥ ∑ a2 b2 a2 + b2 = ∑ a4 b2 + c2 ≥ 2 ∑ a4 bc ≥ 6a2 b2 c2



cyc cyc cyc cyc cyc

We are done. Equality holds for a = b = c.

Time for some substitution,
 Schur’s Inequality 9

Problem 1.1.9. Let a, b, c be positive real numbers with abc = 1. Prove that
a b c
∑(a + bc) ≤ 3 + c + a + b
cyc

Let’s put
x y z
a = ,b = ,c =
y z x
and the inequality becomes:
x2
 
x y
∑ + ≤ 3+∑
cyc y x cyc yz

⇐⇒ ∑(x2y + xy2) ≤ 3xyz + ∑ x3

cyc cyc

which is exactly Schur’s inequality. This substitution

x y z
a = ,b = ,c =
y z x
has very wide use in many problems also in contests like USAMO/IMO.

Problem 1.1.10 (Tournament of Towns 1997). Let a, b, c be positive numbers such that
abc = Prove that
1 1 1
+ + ≤1
a+b+1 b+c+1 c+a+1

We can rewrite the given inequality as following :

1 1 1 1
1/3
+ 1/3
+ 1/3
≤
a + b + (abc) b + c + (abc) c + a + (abc) (abc)1/3
We make the substitution a = x3 , b = y3 , c = z3 with x, y, z > 0. Then, it becomes
1 1 1 1
+ + ≤
x3 + y3 + xyz y3 + z3 + xyz z3 + x3 + xyz xyz
which is equivalent to
x3 + y3 + xyz y3 + z3 + xyz ≤ x3 + y3 + xyz y3 + z3 + xyz z3 + x3 + xyz






xyz ∑
cyclic

or
∑ x6y3 ≥ ∑ x5y2z2
sym sym

Which is nothing but Schur.

Problem 1.1.11. For the above example determine how this satisfies with schur’s Inequality

∑ x6y3 ≥ ∑ x5y2z2
sym sym
 Schur’s Inequality 10

Corollary 1.1.2 — If
∞
f (x) = ∑ ak x k ,
k=0
where ak ≥ 0 (k ∈ N), for all x, y, z ≥ 0, then

(x − y)(x − z) f (x) + (y − z)(y − x) f (y) + (z − x)(z − y) f (z) ≥ 0

Sketch of proof. Using Schur’s Inequality,

     
(x − y)(x − z) ak xk + (y − z)(y − x) ak yk + (z − x)(z − y) ak zk ≥ 0

List of some corollaries

Corollary 1.1.3 —

(x − y)(x − z) (y − z)(y − x) (z − x)(z − y)

k
+ k
+ k
≥ 0 (x, y, z ∈ (0, 1), k ∈ N ∗ )
1−x 1−y 1−z

Corollary 1.1.4 —

(x − y)(x − z) ln(1 − x) + (y − z)(y − x) ln(1 − y) + (z − x)(z − y) ln(1 − z) ≤ 0(x, y, z ∈ (0, 1))

Corollary 1.1.5 —
1+x 1+y 1+z
(x − y)(x − z) ln + (y − z)(y − x) ln + (z − x)(z − y) ln ≥ 0(x, y, z ∈ (0, 1))
1−x 1−y 1−z

Corollary 1.1.6 —
x+1 y+1 z+1
(x − y)(x − z) ln + (y − z)(y − x) ln + (z − x)(z − y) ln ≥ 0(x, y, z > 1)
x−1 y−1 z−1

This are some of the many important results of schur’s inequality. Why not look over k = 2
case or fourth degree Schur Inequality again with some more variants?

Case 4 (Fourth Degree Schur’s Inequality). Also can be written as

(a + b + c) a3 + b3 + c3 + 3abc ≥ 2 a2 + b2 + c2 (ab + bc + ca)

also
6abc(a + b + c)
a2 + b2 + c2 + ≥ 2(ab + bc + ca)
a2 + b2 + c2 + ab + bc + ca
 Schur’s Inequality 11

Problem 1.1.12. Let a, b, c be non-negative real numbers with a + b + c = 2. Prove that

a4 + b4 + c4 + abc ≥ a3 + b3 + c3

According to the fourth degree Schur inequality, we have

a4 + b4 + c4 + abc(a + b + c) ≥ a3 (b + c) + b3 (c + a) + c3 (a + b)

or
2 a4 + b4 + c4 + abc(a + b + c) ≥ a3 + b3 + c3 (a + b + c)

Now putting our given condition of a + b + c = 2 into the above inequality, we get the our
result. Equality holds for a = b = c = 23 , or a = b = 1, c = 0 or permutations.

Problem 1.1.13 (Vasile Cirtoaje). Suppose that a, b, c are non-negative real numbers.
Prove that
a2 b2 c2
+ + ≥1
2b2 − bc + 2c2 2c2 − ca + 2a2 2a2 − ab + 2b2

According to Cauchy-Schwarz inequality, we deduce that

2
a2 a2 + b2 + c2
∑ 2b2 − bc + 2c2 ≥ a2 (2b2 − bc + 2c2) + b2 (2c2 − ca + 2a2) + c2 (2a2 − ac + 2b2)
cyc

It suffices to prove that

!2 !
∑ a2 ≥ ∑ a2 2b2 − bc + 2c2 ⇔ ∑ a4 + abc ≥ 2 ∑ a2 b2


∑a
cyc cyc cyc cyc cyc

According to the fourth degree Schur inequality, we conclude that

!
∑ a4 + abc ∑ a ≥ ∑ ab a2 + b2 ≥ 2 ∑ a2b2


cyc cyc cyc cyc

We are done. Equality holds for a = b = c and a = b, c = 10 or permutations.

Problem 1.1.14 (IMO 2000/2). Let a, b, c be positive numbers such that abc = 1. Prove
that    
1 1 1
a−1+ b−1+ c−1+ ≤1
b c a

It is equivalent to the following homogeneous inequality

! ! !
(abc)2/3 (abc)2/3 (abc)2/3
a − (abc)1/3 + b − (abc)1/3 + c − (abc)1/3 + ≤ abc
b c a
 Schur’s Inequality 12

After the substitution a = x3 , b = y3 , c = z3 with x, y, z > 0, it becomes

(xyz)2 (xyz)2 (xyz)2
   
3 3 3
x − xyz + 3 y − xyz + 3 z − xyz + 3 ≤ x3 y3 z3
y z x
which simplifies to
x2 y − y2 z + z2 x y2 z − z2 x + x2 y z2 x − x2 y + y2 z ≤ x3 y3 z3

Or
3x3 y3 z3 + ∑ x6 y3 ≥ ∑ x4 y4 z + ∑ x5 y2 z2
cyclic cyclic cyclic
or
3
2
3 x2 y y2 z z2 x + x2 y ≥ x2 y y2 z





∑ ∑
cyclic sym

which is a special case of Schur’s inequality.

Theorem 1.1.7 (Vornicu-Schur inequality) — Consider real numbers a, b, c, x, y, z such

that a ≥ b ≥ c and either x ≥ y ≥ z or z ≥ y ≥ x. Let k ∈ Z>0 be a positive integer and let
f : R → R≥0 be a function from the reals to the nonnegative reals that is either convex or
monotonic. Then

f (x)(a − b)k (a − c)k + f (y)(b − a)k (b − c)k + f (z)(c − a)k (c − b)k ≥ 0.

The below is a special case of the above also the below can also be termed as Vornicu-Schur
Inequality.

Theorem 1.1.8 (Generalised Schur’s Inequality) — Let a, b, c be three reals with a ≥

b ≥ c and y ≥ x and the other pairs , where x, y, z be three non-negative reals. Then, the
inequality
x(a − b)(a − c) + y(b − c)(b − a) + z(c − a)(c − b) ≥ 0

Problem 1.1.15. Prove that if x, y, z ≥ 0 satisfy xy + yz + zx + xyz = 4 then x + y + z ≥

xy + yz + zx.

Let us write the given condition as

x y y z z x x y z
· + · + · +2 · · = 1
2 2 2 2 2 2 2 2 2
Hence there are positive real numbers a, b, c such that
2a 2b 2c
x= , y= , z=
b+c c+a a+b
But now the solution is almost over, since the inequality
x + y + z ≥ xy + yz + zx
 Schur’s Inequality 13

is equivalent to
a b c 2ab 2bc 2ca
+ + ≥ + +
b + c c + a a + b (c + a)(c + b) (a + b)(a + c) (b + a)(b + c)
After clearing denominators, the inequality becomes

a(a + b)(a + c) + b(b + a)(b + c) + c(c + a)(c + b) ≥ 2ab(a + b) + 2bc(b + c) + 2ca(c + a)

After basic computations, it reduces to

a(a − b)(a − c) + b(b − a)(b − c) + c(c − a)(c − b) ≥ 0

But this is Schur’s inequality.

Problem 1.1.16 (Duong Du Lam). Given non-negative reals a, b, c which have at least two
positive numbers prove that
2  2  2
1 5 a2 + b2 + c2

a b c
+ + + ≥ ·
b+c c+a a+b 2 4 ab + bc + ca

Multiply both sides of a given inequality by (a + b)(b + c)(c + a), we can rewrite it as

a2 (a + b)(c + a) (a + b)(b + c)(c + a) 5 a2 + b2 + c2 (a + b)(b + c)(c + a)

∑ + ≥ ·
b+c 2 4 ab + bc + ca
or
a2 (a − b)(a − c) ∑ ab(a + b)
∑ + 2 ∑ a3 + abc +
b+c 2

5 5 abc a + b + c2
2 2
≥ ∑ a2 ∑ a − ·



4 4 ab + bc + ca
So now by Vornicu-Schur Inequality
a2 (a − b)(a − c)
∑ ≥0
b+c
a2 +b2 +c2
similarly now by AM-GM ab+bc+ca ≥ 1 , so what remains to prove is

∑ ab(a + b) 5 5abc
2 ∑ a3 + abc + ∑ a2 ∑ a



≥ −
2 4 4
The rest part is left to the readers.

Problem 1.1.17. How

∑ ab(a + b) 5 5abc
2 ∑ a3 + abc + ∑ a2 ∑ a



≥ −
2 4 4
is it true in the above problem?
 Schur’s Inequality 14

We see several substitutions work along and play an important role here , using proper substi-
tution is quite powerful while solving this inequalities since a proper one can lead you to the
form which you actually want. Some quite useful theorems which you might want want to
look at or more precisely when you move upon the bound of three variables .

Theorem 1.1.9 (Extension to 5 variables) — Let x ≥ y ≥ z ≥ v ≥ 0 and t > 0 such that

x + v ≥ y + z, then

xt (x−y)(x−z)(x−v)+yt (y−x)(y−x)(y−v)+zt (z−x)(z−y)(z−v)+vt (v−x)(v−y)(v−z) ≥ 0

Using the generalisation of Schur’s Inequality

f (x)(x − y)(x − z) + f (y)(y − x)(y − z) + f (z)(z − x)(z − y) ≥ 0.

We can write the following Schur’s type inequality,

f (x)(x − y)(x − z)(x − v) + f (y)(y − x)(y − z)(y − v)+
+ f (z)(z − x)(z − y)(z − v) + f (v)(v − x)(v − y)(v − z) ≥ 0
Theorem 1.1.10 — If the real numbers x, y, z, v, w,t ∈ R are such that x ≥ y ≥ z ≥ v ≥
w ≥ 0,t > 0 and x + v ≥ y + z, then it’s true that

x2 (x − y)(x − z)(x − v)(x − w) + y0 (y − x)(y − z)(y − v)(y − w)+

+z0 (z − x)(z − y)(z − v)(z − w) + vt (v − x)(v − y)(v − z)(v − w)+
+w0 (w − x)(w − y)(w − z)(w − v) ≥ 0

Theorem 1.1.11 (Extension to 7 variables) — If the real numbers x, y, z, v, w, u,t ∈ R are

such that x ≥ y ≥ z ≥ v ≥ w ≥ u ≥ 0,t > 0 and x + u ≥ y + w ≥ z + v, then

xt (x − y)(x − z)(x − v)(x − w)(x − u)+

+yt (y − x)(y − z)(y − v)(y − w)(y − u)+
+zt (z − x)(z − y)(z − v)(z − w)(z − u)+
+vt (v − x)(v − y)(v − z)(v − w)(v − u)+
+wt (w − x)(w − y)(w − z)(w − v)(w − u)+
+ut (u − x)(u − y)(u − z)(u − v)(u − w) ≥ 0

Let us denote a = x − y ≥ 0, b = y − z ≥ 0, c = z − v ≥ 0, d = v − w ≥ 0, e = w − u ≥ 0. The

condition x + u ≥ y + w, means x − y ≥ w − u, i.e. a ≥ e, and the condition y + w ≥ z + v,
means y − z ≥ v − w, i.e. b ≥ d. Now we rewrite the left side of theorem 1.1.7 using
F(x, y, z, v, w, u,t) =xt (x − y)(x − z)(x − v)(x − w)(x − u)+
+ yt (y − x)(y − z)(y − v)(y − w)(y − u)+
+ zt (z − x)(z − y)(z − v)(z − w)(z − u)+
+ v0 (v − x)(v − y)(v − z)(v − w)(v − u)+
+wt (w − x)(w − y)(w − z)(w − v)(w − u)+
+ ut (u − x)(u − y)(u − z)(u − v)(u − w),
 Schur’s Inequality 15

and the variables a, b, c, d, e : F(x, y, z, v, w, u,t) = xt · a(a + b)(a + b + c)(a + b + c + d)(a +

b + c + d + e) + yt · (−a)b(b + c)(b + c + d)(b + c + d + e) + zt · [−(a + b)](−b)c(c + d)(c +
d + e) + vt · [−(a + b + c)][−(b + c)](−c)d(d + e)+ wt · [−(a + b + c + d)][−(b + c + d)][−(c +
d)](−d)e + ut [−(a + b + c + d + e)][−(b + c + d + e)][−(c + d + e)][−(d + e)](−e) =

[xt · a(a + b)(a + b + c)(a + b + c + d) − ut · (b + c + d + e)(c + d + e)(d + e)e]

−(b + c + d) · [yt · ab(b + c)(b + c + d + e) − wt · (a + b + c + d)(c + d)de] +
+c · [zt · (a + b)b(c + d)(c + d + e) − vt · (a + b + c)(b + c)d(d + e)] ≥ 0

We will demonstrate successively:

xt · a(a + b)(a + b + c)(a + b + c + d) − ut · (b + c + d + e)(c + d + e)(d + e)e ≥

yt · ab(b + c)(b + c + d + e) − wt · (a + b + c + d)(c + d)de

yt · ab(b + c)(b + c + d + e) − wt · (a + b + c + d)(c + d)de ≥ 0

zt · (a + b)b(c + d)(c + d + e) − vt · (a + b + c)(b + c)d(d + e) ≥ 0

In order to show
xt · a(a + b)(a + b + c)(a + b + c + d) − ut · (b + c + d + e)(c + d + e)(d + e)e ≥
yt · ab(b + c)(b + c + d + e) − wt · (a + b + c + d)(c + d)de

we have

xt · a(a + b)(a + b + c)(a + b + c + d) − ut · (b + c + d + e)(c + d + e)(d + e)e ≥

≥ yt · ab(b + c)(b + c + d + e) − wt · (a + b + c + d)(c + d)de

equivalent to

xt · a(a + b)(a + b + c)(a + b + c + d) + wt · (a + b + c + d)(c + d)de ≥

≥ yt · ab(b + c)(b + c + d + e) + ut · (b + c + d + e)(c + d + e)(d + e)e

But a ≥ e so a + b + c + d ≥ b + c + d + e. This means that the above inequality is valid if we

demonstrate

xt · a(a + b)(a + b + c) + wt · (c + d)de ≥ yt · ab(b + c) + ut · (c + d + e)(d + e)e

t · a3 + a2 (b + b + c) + ab(b + c) + wt · (c +
 
The above inequality can be written in the form: x
d)de ≥ yt · ab(b + c) + ut · e3 + e2(c + d + d) + e(c + d)d .Because a ≥ e ≥ 0 and b ≥ d ≥ 0
 

and x ≥ y ≥ w ≥ u ≥ 0 we have xt · a3 + a2 (b + b + c) ≥ ut · e3 + e2 (c + d + d) xt ·ab(b+c) ≥

yt · ab(b + c), wt · (c + d)de ≥ ut · e(c + d)d. Adding these inequalities we show that above is
true. In order to prove

yt · ab(b + c)(b + c + d + e) − wt · (a + b + c + d)(c + d)de ≥ 0

we have yt ≥ wt ≥ 0, a · (b + c + d + e) = a · (b + c + d) + ae ≥ ae + (b + c + d) · e = (a + b +
c + d) · e ≥ 0 and b(b + c) ≥ d(d + c) = (c + d)d ≥ 0. Multiplying these inequalities term by
term we obtain

yt · ab(b + c)(b + c + d + e) − wt · (a + b + c + d)(c + d)de ≥ 0

 Schur’s Inequality 16

Now we demonstrate

zt · (a + b)b(c + d)(c + d + e) − vt · (a + b + c)(b + c)d(d + e) ≥ 0

: zt ≥ vt ≥ 0 and (a+b)b c2 + c(d + d + e) ≥ d(d +e) c2 + c(a + b + b) , because from a ≥ e

   

and b ≥ d we get (a + b)bc2 ≥ d(d + e)c2 and (a + b)bc(d + d + e) ≥ d(d + e)c(a + b + b)

equivalent to (a + b)b(d + e) + (a + b)bd ≥ d(d + e)(a + b) + d(d + e)b. But (a + b)b(d + e) ≥
(a + b)d(d + e) = d(d + e)(a + b), and (a + b)bd ≥ (e + d)bd = d(d + e)b. Now by addition
term by term we obtain the required inequality

zt · (a + b)b(c + d)(c + d + e) − vt · (a + b + c)(b + c)d(d + e) ≥ 0

To finish the proof we have a + b + c + d + e ≥ b + c + d ≥ 0, c ≥ 0 and if we use the above

three deduced inequalities we can deduce our first expression. Using the hypothesis of schur’s
Inequality we can observe that in the Schur type inequality extension upto 7 variables we realize
the equality in the following cases: i, x = y = z = v = w = u ≥ 0; ii, x = y = z = v = w ≥ 0, u = 0;
iii, x = y = z = v ≥ 0, w = u = 0; iv, x = y = z ≥ 0 and v = w = u = 0. v, x = y ≥ 0 and
z = v = w = u = 0. Two beautiful results which can be resulted from our wonderful schur
inequality

Theorem 1.1.12 (Euler’s Inequality) — It states that if the circumradius of a triangle is

R and the inradius is r, then R ≥ 2r. If this is expressed in terms of the sides a, b, c, we get
r
abc (−a + b + c)(a − b + c)(a + b − c)
p ≥
(a + b + c)(−a + b + c)(a − b + c)(a + b − c) a+b+c

which is equivalent to

abc ≥ (−a + b + c)(a − b + c)(a + b − c)

Theorem 1.1.13 (Gerretsen’s Inequality) — It states that if s, r, R denotes the semi-

perimeter, inradius and circumradius of a triangle, then

16Rr − 5r2 ≤ s2 ≤ 4R2 + 4Rr + r2

 Problems 17

1.2 Problems

Problem 1.2.1. Show that ∀x, y, z ∈ R we have:

∑ x6 + 3x2y2z2 ≥ 2 ∑ x3y3
Hints: 1

Problem 1.2.2. Prove for all non-negative real numbers a, b, c that

∑(a − b)3 ≥ ∑(a + b − c)(b − a)(a − c)

cyc cyc

Problem 1.2.3. Given a, b, c ≥ 0 such that (a + b)(b + c)(c + a) = 8, prove that:

108
a3 + b3 + c3 + abc + ≥ 8.
(a + b + c)3
Hints: 2

Problem 1.2.4. Prove that for any three non negative reals a, b, c, we have

2
2
2
b2 − c2 + c2 − a2 + a2 − b2 ≥ 4(b − c)(c − a)(a − b)(a + b + c)
Hints: 3

Problem 1.2.5 (IMO 1983). · Prove that if a, b, c are sidelengths of a triangle, then
a2 b(a − b) + b2 c(b − c) + c2 a(c − a) ≥ 0.
Hints: 4

Problem 1.2.6. Prove that if a, b, c are sidelengths of a triangle, and t ≥ 1 is a real, then
(t + 1) ∑ a3 b ≥ ∑ ab3 + tabc(a + b + c)
Hints: 5

Problem 1.2.7 (Nguyen Huy Tan). Prove the following inequality with non-negative real
numbers a, b, c such that ab + bc + ca > 0
a(b + c) b(a + c) c(a + b) 3[(a − b)(b − c)(c − a)]2
+ + ≥ 2+ 2
b2 + bc + c2 c2 + ca + a2 a2 + ab + b2 (a + ab + b2 ) (b2 + bc + c2 ) (c2 + ca + a2 )
Hints: 6
 Problems 18

Problem 1.2.8. Let x, y, z ∈ (0, ∞) such that x + y + z = 1. Prove that:

x y z 36xyz
+ + ≥
xy + 1 yz + 1 zx + 1 13xyz + 1

Problem 1.2.9 (Nguyen Huy Tung). For positive numbers a, b, c prove that
s
a b c 9 (a3 + b3 + c3 )
+ + ≥33
b c a (a + b + c)3

Hints: 7
 Hints to selected problems 19

1.3 Hints to selected problems

1. As x2 + y2 ≥ 2xy, ∑ x6 + 3x2 y2 z2 ≥ ∑ x2 y2 (x2 + y2 ) ≥ 2 ∑ x3 y3 .

2. By schur’s inequality, 4 a3 + b3 + c3 + 15abc ≥ (a + b + c)3

3. Rewrite this inequality in the form ∑(a + b)2 (a − b)(a − c) ≥ 0

4. Rewrite this as
∑ c(a + b − c)(a − b)(a − c) ≥ 0.
Now, this follows, it is shown that

c(a + b − c), a(b + c − a), b(c + a − b)

are the side lengths of a triangle.

5. For t = 1, it becomes
∑ b(b + a)(a − b)(a − c) ≥ 0
what follows from
∑ b2(a − b)(a − c) ≥ 0
and
∑ ba(a − b)(a − c) ≥ 0.

6. Note that
 
a(b + c) 1 a(b + c)(ab + bc + ca)
∑ b2 + bc + c2 − 2 = ab + bc + ca ∑ b2 + bc + c2
− a(b + c)

ab(a − b)2
=∑
(b2 + bc + c2 ) (c2 + ca + a2 )
Try to induce an inequality from it and try to take out this expression

2abc[a(a − b)(a − c) + b(b − c)(b − a) + c(c − a)(c − b)] ≥ 0

7. Basically
4(x + y + z)3 ≥ 27 x2 y + y2 z + z2 x + xyz


 Hints to selected problems 20

Use our famous substitution for a, b, c as

a b
x= , y=
b c
and the similar for z. Try to considerate out some proper form and then apply Vornicu-Schur
Inequality.
 References 21

1.4 References

˜ Secrets in Inequality by Pham kim Hung

˜ Olympiad Inequalities by Thomas J. Mildorf

˜ Vornicu-Schur Inequality by Nguyn Huy Tùng

˜ A Schur type inequality for seven variables

˜ A Schur type inequality for five variables

Further reading

Schur’s Inequality has a very important role in the pqr method, for understanding you can
check this two handouts & yes the below two are links.

˜ pqr method ( phoenixfire , Aritra12 )

˜ An Interesting Property of Quadratic Polynomials ( Aritra12 , Do Xua Trong )