Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
First Selection Examination Muirhead’s inequality is an important Example 1. For any a, b, c > 0, prove
generalization of the AM-GM that
Problem 1. Let M be the intersection of
inequality. It is a powerful tool for (a+b)(b+c)(c+a) ≥ 8abc.
diagonals AC and BD of the convex
solving inequality problem. First we
quadrilateral ABCD. The bisector of
give a definition which is a Solution. Expanding both sides, the
angle ACD meets the ray BA at the point
generalization of arithmetic and desired inequality is
K. Prove that if MA·MC + MA·CD
geometric means.
=MB·MD, then ∠BKC= ∠BDC. a2b+a2c+b2c+b2a+c2a+c2b ≥ 6abc.
Problem 2. Let R+ be the set of all Definition. Let x1, x2, …, xn be positive This is equivalent to [(2,1,0)]≥ [(1,1,1)],
positive real numbers. Find all functions real numbers and p = (p1, p2, …, pn) which is true by Muirhead’s inequality
f: R+→R+ such that x2 ( f (x) + f (y) ) = ∊ℝn. The p-mean of x1, x2, …, xn is since (2,1,0)≻(1,1,1).
( x+y ) f ( f (x) y) holds for any positive defined by
real numbers x and y. For the next example, we would like to
1
Problem 3. Find all pairs of positive
[ p] = ∑ xσp1(1) xσp2(2) L xσp(nn) ,
n! σ ∈S n
point out a useful trick. When the
product of x1, x2, …, xn is 1, we have
integers (m, n) such that the numbers where Sn is the set of all permutations
m2−4n and n2−4m are perfect squares. of {1,2,…, n}. (The summation sign [(p1, p2, …, pn)] = [(p1–r, p2–r,…, pn–r)]
Second Selection Examination means to sum n! terms, one term for for any real number r.
each permutation σ in Sn.)
Problem 1. How many sequences of
Example 2. (IMO 1995) For any a, b, c
2005 terms are there such that the n
following three conditions hold: For example, [(1,0,K,0)] = 1 ∑ xi is > 0 with abc = 1, prove that
n i =1
1 1 1 3
(a) no sequence has three consecutive the arithmetic mean of x1, x2, …, xn and + + ≥ .
terms equal to each other, a 3 (b + c) b3 (c + a) c 3 (a + b) 2
[(1 / n ,1 / n , K ,1 / n )] = x11 / n x 12 / n L x 1n / n is
(b) every term of every sequence is
their geometric mean. Solution. Multiplying by the common
equal to 1 or −1, and
denominator and expanding both sides,
(continued on page 4) Next we introduce the concept of the desired inequality is
majorization in ℝn. Let p = (p1, p2, …,
Editors: 張 百 康 (CHEUNG Pak-Hong), Munsang College, HK
pn) and q = (q1, q2, …, qn) ∊ℝn satisfy 2(a4b4 + b4c4 + c4a4 )
高 子 眉 (KO Tsz-Mei)
梁 達 榮 (LEUNG Tat-Wing)
conditions + 2(a4b3c + a4c3b + b4c3a + b4a3c + c4a3b
李 健 賢 (LI Kin-Yin), Dept. of Math., HKUST
吳 鏡 波 (NG Keng-Po Roger), ITC, HKPU
1. p1 ≥ p2 ≥ ⋯ ≥ pn and q1 ≥ q2 ≥ ⋯ ≥ qn, + c4b3a) + 2(a3b3c2 + b3c3a2 + c3a3b2 )
Artist: 楊 秀 英 (YEUNG Sau-Ying Camille), MFA, CU
2. p1 ≥ q1, p1+p2 ≥ q1+q2, … , ≥ 3(a 5b 4 c 3 + a 5 c 4 b 3 + b 5 c 4 a 3 + b 5 a 4 c 3
Acknowledgment: Thanks to Elina Chiu, Math. Dept., p1+p2+⋯+pn−1 ≥ q1+q2+⋯+qn−1 and + c 5 a 4 b 3 + c 5b 4 a 3 ) + 6a 4 b 4 c 4 .
HKUST for general assistance.
3. p1+p2+⋯+pn = q1+q2+⋯+qn.
On-line:
http://www.math.ust.hk/mathematical_excalibur/
This is equivalent to [(4,4,0)]+2[(4,3,1)]
Then we say (p1, p2, …, pn) majorizes
+ [(3,3,2)] ≥ 3[(5,4,3)] + [(4,4,4)]. Note
The editors welcome contributions from all teachers and (q1, q2, …, qn) and write
students. With your submission, please include your name, 4+4+0 = 4+3+1 = 3+3+2 = 8, but 5+4+3
address, school, email, telephone and fax numbers (if (p1, p2, …, pn) ≻ (q1, q2, …, qn). = 4+4+4 = 12. So we can set r = 4/3 and
available). Electronic submissions, especially in MS Word,
are encouraged. The deadline for receiving material for the use the trick above to get [(5,4,3)] =
next issue is April 16, 2006. Theorem (Muirhead’s Inequality). Let [(11/3,8/3,5/3)] and also [(4,4,4)] =
For individual subscription for the next five issues for the x1, x2, …, xn be positive real numbers [(8/3,8/3,8/3)].
05-06 academic year, send us five stamped self-addressed
and p, q ∊ℝn. If p ≻ q, then [p] ≥ [q].
envelopes. Send all correspondence to:
Furthermore, for p ≠ q, equality holds if Observe that (4,4,0) ≻ (11/3,8/3,5/3),
Dr. Kin-Yin LI
and only if x1= x2 = ⋯= xn. (4,3,1) ≻ (11/3,8/3,5/3) and (3,3,2) ≻
Department of Mathematics
The Hong Kong University of Science and Technology
(8/3,8/3,8/3). So applying Muirhead’s
Clear Water Bay, Kowloon, Hong Kong Since (1,0,…,0) ≻ (1/n,1/n,…,1/n), inequality to these three majorizations
Fax: (852) 2358 1643
AM-GM inequality is a consequence. and adding the inequalities, we get the
Email: makyli@ust.hk desired inequality.
Mathematical Excalibur, Vol. 11, No. 1, Feb. 06 - Mar. 06 Page 2
Example 3. (1998 IMO Shortlisted (1) [(9,0,0)] ≥ [(7,1,1)] ≥ [(6,0,0)] c < d. Let r = (r1,…,rn) be defined by ri
Problem) For any x, y, z > 0 with xyz = = pi except rj = b + c and rk = b – c. By
1, prove that (2) [(7,5,0)] ≥ [(5,5,2)] the definition of c, either rj = qj or
rk=qk. Also, by the definitions of b, c,
x3 y3 z3 3 (3) 2[(7,5,0)] ≥ 2[(6,5,1)] ≥ 2[(5,4,0)] d, we get p ≻ r, p ≠ r and r ≻ q. Now
+ + ≥ .
(1+ y)(1+ z) (1+ z)(1+ x) (1+ x)(1+ y) 4
(4) [(7,5,0)] + [(5,2,2)] ≥ 2[(6,7/2,1)]
∑ xσ (xσ
pj r
Solution. Multiplying by the common n!([ p] − [r]) = x pk
( j ) σ (k ) − xσj( j ) xσrk(k ) )
denominator and expanding both sides, ≥ 2[(11/2,7/2,3/2)] ≥ 2[(4,2,0)] σ∈S n
Muirhead’s inequality, (4) is by the fact, i ≠ j, k and u = xσ(j) , v = xσ(k). For each
This is equivalent to 4[(4,0,0)] + Muirhead’s inequality and the remark and
4[(3,0,0)] ≥ [(0,0,0)] + 3[(1,0,0)] + permutation σ, there is a permutation ρ
(5) is by the remark.
3[(1,1,0)] + [(1,1,1)]. such that σ(i) = ρ(i) for i ≠ j, k and σ(j)
Considering the sum of the leftmost parts = ρ(k), σ(k) = ρ(j). In the above sum, if
For this, we apply Muirhead’s of these inequalities is greater than or we pair the terms for σ and ρ, then xσ =
inequality and the trick as follow: equal to the sum of the rightmost parts of xρ and combining the parenthetical
these inequalities, we get the desired factors for the σ and ρ terms, we have
[(4,0,0)] ≥ [(4/3,4/3,4/3)] = [(0,0,0)], inequalities.
3[(4,0,0)] ≥ 3[(2,1,1)] = 3[(1,0,0)], (ub+d vb–d– ub+c vb–c)+(vb+d ub–d –vb+c ub–c)
3[(3,0,0)] ≥ 3[(4/3,4/3,1/3)] = 3[(1,1,0)] = ub–d vb–d (ud+c – vd+c) (ud–c – vd–c) ≥ 0.
Alternate Solution. Since
and [(3,0,0)] ≥ [(1,1,1)] . So the above sum is nonnegative. Then
x −x
5 2
x −x 5 2 [p] ≥ [r]. Equality holds if and only if u
Adding these, we get the desired
− = v for all pairs of σ and ρ, which yields
inequality. x5 + y 2 + z 2 x3 ( x 2 + y 2 + z 2 )
x1= x2 = ⋯= xn. Finally we recall r has
( x 3 − 1) 2 ( y 2 + z 2 ) at least one more coordinate in
Remark. For the following example, = ≥ 0, agreement with q than p. So repeating
we will modify the trick above. In case x( x + y 2 + z 2 )( x 5 + y 2 + z 2 )
2
this process finitely many times, we
xyz ≥ 1, we have
we have will eventually get the case r = q. Then
[(p1, p2, p3)] ≥ [(p1–r, p2–r, p3–r)] we are done.
x5 − x 2 y5 − y 2 z5 − z2
+ +
for every r ≥ 0. Also, we will use the x5 + y 2 + z 2 y5 + z 2 + x2 z 5 + x2 + y 2 Next, for the advanced readers, we
following will outline a longer proof, which tells
x5 − x2 y5 − y2 z5 − z 2 more of the story. It is consisted of two
≥ + +
Fact. For p, q ∊ℝn, we have x3 (x2 + y2 + z2 ) y3 ( y2 + z2 + x2 ) z3 (z2 + x2 + y2 ) steps. The first step is to observe that if
[ p] + [q] ⎡ p + q ⎤ c1, c2, …, ck ≥ 0 with sum equals 1 and
≥⎢ . 1 1 1 1 v1, v2, …, vk ∊ℝn, then
2 ⎣ 2 ⎥⎦ ≥
x +y +z
2 2 2
(x2 − + y2 − + z 2 − )
x y z k
⎡ k ⎤
This is because by the AM-GM ∑ c [v i ] ≥ ⎢ ∑ ci v i ⎥.
i
⎣ i =1 ⎦
inequality, 1 i =1
≥ ( x 2 + y 2 + z 2 − yz − zx − xy )
xσp1(1) L xσpn( n ) + xσq1(1) L xσq n( n ) x + y2 + z2
2
This follows by using the weighted
AM-GM inequality instead in the proof
2 ( x − y ) 2 + ( y − z ) 2 + ( z − x) 2 of the fact above. (For the statement of
= ≥ 0.
≥x ( p1 + q1 ) / 2
σ (1 ) L xσ( p( nn+) qn ) / 2 . 2( x 2 + y 2 + z 2 ) the weighted AM-GM inequality, see
Mathematical Excalibur, vol. 5, no. 4,
Summing over σ∊Sn and dividing by n!, p. 2, remark in column 1).
we get the inequality.
Proofs of Muirhead’s Inequality The second step is the difficult step of
Example 4. (2005 IMO) For any x, y, z showing p ≻ q implies there exist
> 0 with xyz ≥ 1, prove that Kin Yin Li nonnegative numbers c1, c2, …, cn! with
sum equals 1 such that
x5 − x2 y5 − y 2 z5 − z 2 Let p ≻ q and p ≠ q. From i = 1 to n, the
+ 5 2 2 + 5 2 2 ≥ 0. n!
x +y +z y +z +x z +x +y
5 2 2
first nonzero pi – qi is positive by q = ∑ ci Pi ,
i =1
Solution. Multiplying by the common condition 2 of majorization. Then there is
denominator and expanding both sides, a negative pi – qi later by condition 3. It where P1, P2, …, Pn! ∊ℝn whose
the desired inequality is equivalent to follows that there are j < k such that pj > qj, coordinates are the n! permutations of
[(9,0,0)]+4[(7,5,0)]+[(5,2,2)]+[(5,5,5)] pk < qk and pi = qi for any possible i the coordinates of p. Muirhead’s
≥ [(6,0,0)] + [(5,5,2)] + 2[(5,4,0)] + between j, k. inequality follows immediately by
2[(4,2,0)] + [(2,2,2)]. applying the first step and observing
Let b = (pj+pk)/2, d = (pj–pk)/2 so that that [Pi]=[p] for i=1,2,…, n!.
[b–d,b+d] = [pk, pj] ⊃ [qk, qj]. Let c be
To prove this, we note that (continued on page 4)
the maximum of |qj–b| and |qk–b|, then 0 ≤
Mathematical Excalibur, Vol. 11, No. 1, Feb. 06 - Mar. 06 Page 3
H lies inside the circle of radius r (STFA Leung Kau Kui College), CHAN Birkhoff’s Theorem. For every doubly
centered at M1, but all other points of R Pak Woon (HKU Math UG Year 1), stochastic matrix D, there exist
is outside or on the circle. Hence the WONG Kwok Cheung (Carmel Alison nonnegative numbers c(σ) with sum
interior of H does not contain any other Lam Foundation Secondary School, Form equals 1 such that
point of R. 7) and YUEN Wah Kong (St. Joan of Arc
Secondary School). D= ∑ c(σ )M (σ ).
σ ∈S n
Below we will say two triangles are
disjoint if their interiors do not Granting these results, for Pi’s in the
intersect. There are 3 possible cases: second step, we can just let Pi= M(σi)p.
Olympiad Corner
(a) H is a pentagon. Then H may be (continued from page 1) Hardy-Littlewood-Polya’s theorem can
divided into three disjoint triangles be proved by introducing r as in the
with vertices in R, each of them first proof. Following the idea of
Problem 1. (Cont.)
containing a point of B inside. The Hardy-Littlewood-Polya, we take T to
triangle with these points of B as (c) the sum of all terms of every sequence be the matrix with
vertices would contain another point of
Tjj= d + c =Tkk, Tjk= d − c =Tkj,
is at least 666?
R, which would be in H. This is
impossible. 2d 2d
Problem 2. Let O be the center of the
circumcircle of the acute-angled triangle all other entries on the main diagonal
(b) H is a quadrilateral. Then one of ABC, for which ∠CBA < ∠ACB holds. equal 1 and all other entries of the
the Mi is inside H and the other Mj, Mk, matrix equal 0. We can check T is
The line AO intersects the side BC at the
Ml, Mm are at its vertices, say clockwise.
point D. Denote by E and F the centers of doubly stochastic and r = Tp. Then we
The four disjoint triangles MiMjMk,
MiMkMl, MiMlMm, MiMmMi induce four the circumcircles of triangles ABD and repeat until r = q.
points of B, which can be used to form ACD respectively. Let G and H be two
two disjoint triangles with vertices in B points on the rays BA and CA such that Birkhoff’s theorem can be proved by
which would contain two points in R. AG=AC and AH=AB, and the point A lies induction on the number N of positive
So H would then contain another point between B and G as well as between C and entries of D using Hall’s theorem (see
of R inside, other than Mi, which is H. Prove the quadrilateral EFGH is a Mathematical Excalibur, vol. 1, no. 5,
impossible. rectangle if and only if ∠ACB −∠ABC = p. 2). Note N ≥ n. If N = n, then the
60˚. positive entries are all 1’s and D is a
(c) H is a triangle. Then it contains permutation matrix already. Next for N
inside it two points Mi, Mj. One of the Problem 3. Let a, b and c be positive > n, suppose the result is true for all
three disjoint triangles MiMkMl, numbers such that ab + bc + ca = 1. doubly stochastic matrices with less
MiMlMm, MiMmMk will contain Mj. Prove the inequality than N positive entries. Let D have
Then we can break that triangle into
three smaller triangles using Mj. This 1 3
3 exactly N positive entries. For j = 1,…,
33 + 6(a + b + c) ≤ . n, let Wj be the set of k such that Djk > 0.
makes five disjoint triangles with abc abc
vertices in R, each having one point of We need a system of distinct
B inside. With these five points of B, representatives (SDR) for W1,…,Wn.
three disjoint triangles with vertices in To get this, we check the condition in
B can be made so that each one of them Hall’s theorem. For every collection
having one point of R. Then H Proofs of Muirhead’s Inequality W j1 , K , W j m , note m is the sum of all
contains another point of R, different
from M1, M2, M3, M4, M5, which is (continued from page 2) positive entries in column j1,…,jm of D.
impossible. This is less than or equal to the sum of
For the proof of the second step, we all positive entries in those rows that
Problem 245. ABCD is a concave follow the approach in J. Michael Steele’s have at least one positive entry among
quadrilateral such that ∠BAD =∠ABC book The Cauchy-Schwarz Master Class, column j1,…,jm. This latter sum is the
=∠CDA = 45˚. Prove that AC = BD. MAA-Cambridge, 2004. For a n×n number of such rows and is also the
Solution. CHAN Tsz Lung (HKU matrix M, we will denote its entry in the number of elements in the union of
Math PG Year 1), KWOK Lo Yan j-th row, k-th column by Mjk. Let us W j1 , K , W j m .
(Carmel Divine Grace Foundation introduce the term permutation matrix for
Secondary School, Form 6), Problem σ∊Sn to mean the n×n matrix M(σ) with So the condition in Hall’s theorem is
Solving Group @ Miniforum, WONG satisfied and there is a SDR for W1,…,
Kai Cheuk (Carmel Divine Grace M(σ)jk = 1 if σ(j)=k and M(σ)jk = 0
otherwise. Also, introduce the term Wn. Let σ(i) be the representative in Wi,
Foundation Secondary School, Form 6),
WONG Man Kit (Carmel Divine Grace doubly stochastic matrix to mean a square then σ∊Sn. Let c(σ) be the minimum of
Foundation Secondary School, Form 6) matrix whose entries are nonnegative real D1σ (1) ,K, Dnσ ( n ) . If c(σ) = 1, then D is a
and WONG Tsun Yu (St. Mark’s numbers and the sum of the entries in
School, Form 6). permutation matrix. Otherwise, let
every row and every column is equal to
Let line BC meet AD at E, then ∠BEA one. The proof of the second step follows D’= (1– c(σ))–1(D – c(σ) M(σ)).
=180˚ −∠ABC −∠BAD = 90˚. Note from two results:
Then D = c(σ) M(σ) + (1– c(σ)) D’ and
∆AEB and ∆CED are 45˚-90˚-45˚ D’ is a double stochastic matrix with at
Hardy-Littlewood-Polya’s Theorem. If p
triangles. So AE = BE and CE = DE. least one less positive entries than D.
≻ q, then there is a n×n doubly stochastic
Then ∆AEC ≅ ∆BED. So AC = BD. So we may apply the cases less than N
matrix D such that q = Dp, where we write
to D’ and thus, D has the required sum.
Commended solvers: CHAN Ka Lok p and q as column matrices.