Академический Документы
Профессиональный Документы
Культура Документы
Famous Inequalities
In this chapter we meet three very important inequalities: Bernoullis Inequality, the
Arithmetic MeanGeometric Mean Inequality, and the CauchySchwarz Inequality.
At first we consider only pre-calculus versions of these inequalities, but we shall
soon see that a thorough study of inequalities cannot be undertaken without calculus.
And really, calculus cannot be thoroughly understood without some knowledge of
inequalities. We define Eulers number e by a more systematic method than that of
Example 1.32. Well see that this method engenders many fine extensions.
The following is a very useful little inequality. It is named for the Swiss mathemati-
cian Johann Bernoulli (16671748).
Lemma 2.1. (Bernoullis Inequality) Let n D 1; 2; 3; : : : : Then for x > 1;
.1 C x/n 1 C nx :
.1 C x/2 D 1 C 2x C x 2 1 C 2x:
Etcetera: We could clearly continue this procedure up to any positive integer n; and
so our proof is complete. t
u
Example 2.2. We show that for jxj < 1; the sequence fx n g converges to 0. First,
for 0 < x < 1 we can write x D 1Cq 1
, for some q > 0: Then by Bernoullis
Inequality (Lemma 2.1),
.1 C q/n 1 C nq;
so that
1 1
0 < xn D :
.1 C q/ n 1 C nq
Letting n ! 1; the result follows. For 1 < x < 0; we simply replace x with x
above. (The case x D 0 is trivial.)
1=n
Exercise 2.1 contains the fact that for any x > 0; x converges to 1:
Example 2.3. The series
1
X
1 C x C x2 C x3 C D xk
kD0
1 55
10x D 5 C D :
1 1=10 9
Therefore, x D 11=18:
1=n
p 2.5. [2] Here we show that the sequence n
Example converges to 1: Setting
x D 1= n in Bernoullis Inequality (Lemma 2.1) we get
n
1 p p
1C p 1C n > n:
n
Therefore
1 2 p 2=n
1C p > n D n1=n 1;
n
!nC1 nC1
.1 C 1 nC1
nC1
/ 1 1C 1
nC1 1 1
D 1C D 1C 1 :
.1 C n/
1 n n 1 C n1 n .n C 1/2
Therefore
nC1
1 1 n
1C 1C
nC1 n
n
and so 1 C n1 is increasing. In a very similar way, which we leave for
Exercise 2.6 (see also Example 1.43 and Exercise 1.39), one can show that
nC1
1 C n1 is decreasing. Then we have
1 n 1 nC1 1 1C1
1C 1C 1C D 4;
n n 1
n
and so 1 C n1 is also bounded above. Therefore, by the Increasing Bounded
Sequence Property (Theorem 1.34), this sequence has a limit: Eulers number, e:
28 2 Famous Inequalities
We begin with a simple yet incredibly useful fact. It turns out to be a special case of
the main result of this section (Theorem 2.10).
Lemma 2.7. Let a and b be positive real numbers. Then
p aCb
ab ; and equality occurs here , a D b:
2
Proof. It is easily verified that
Therefore,
aCb p
.a C b/2 4ab; or ab :
2
p p
Now if a D b; then clearly ab D aCb 2
: Conversely, if ab D aCb
2
then in the
first line of the proof we must have .a b/2 D 0; and so a D b: t
u
The average A D aCb is known as the Arithmetic Mean of a and b: The quantity
p 2
G D ab is known as their Geometric Mean.p A rather satisfying Proof Without
Words for Lemma 2.7, which also suggests why ab is called the Geometric Mean,
is shown Fig. 2.1. See also Exercise 2.19
A G
a b
p aCb
Fig. 2.1 G D ab A D 2
2.2 The AGM Inequality 29
1X
n
a1 C a2 C C an
AD D aj :
n n j D1
If these numbers are also nonnegative, then their Geometric Mean given by
0 11=n
1=n Y
n
G D .a1 /.a2 / .an / D@ aj A :
j D1
However, for practical purposes one often desires other properties, like (i) having
M.a1 ; a2 ; : : : ; an / independent of the order in which the numbers a1 ; a2 ; : : : ; an are
arranged, and (ii) having M.t a1 ; t a2 ; : : : ; t an / D tM.a1 ; a2 ; : : : ; an / for any t 0:
The reader should agree that A and G each satisfy (i) and (ii).
The Arithmetic MeanGeometric Mean Inequality below, or what we shall
call the AGM Inequality for short, extends Lemma 2.7 to n numbers. This
inequality is of fundamental importance in mathematical analysis. The great French
mathematician Augustin Cauchy (17891857) was the first to prove it, in 1821.
We provide his proof at the end of this section. (The Scottish mathematician Colin
Maclaurin (16981746) had an earlier proof, around 1729, which wasnt quite
complete.)
30 2 Famous Inequalities
The list of mathematicians who have offered proofs of the AGM Inequality over
the years is impressive. It includes Liouville, Hurwitz, Steffensen, Bohr, Riesz,
Sturm, Rado, Hardy, Littlewood, and Polya. (See, e.g., [5,9,18,32,49]; the book [9]
contains over 75 proofs.) Below we provide the clever 1976 proof given by K.M.
Chong [10].
Theorem 2.10. (AGM Inequality) Let a1 ; a2 ; : : : ; an be n positive real numbers,
where n 2. Then
G A;
That is,
a1 an
a1 C an A : (2.1)
A
Take n D 3 here, and notice that the Arithmetic Mean of the two numbers a2 and
a1 C a3 A is A: Now we apply Lemma 2.7 to these two numbers, along with (2.1)
to get
a1 a3
A2 a2 .a1 C a3 A/ a2 :
A
That is,
A3 a1 a2 a3 :
A4 a1 a2 a3 a4 :
Clearly we could continue this procedure indefinitely, showing that A G for any
positive integer n; and so we have proved the main part of the theorem. Now to
address the equality conditions. If a1 D a2 D D an , then it is easily verified that
2.2 The AGM Inequality 31
.1:1/.1:5/.1:3/1=3 1:289 ;
the average rate of return over the 3 years is just under 29 %: The Arithmetic Mean
gives an overestimate of the average rate of return, at 30 %:
Example 2.12. We saw in Example 2.9 that a rectangle with given perimeter has
greatest area when the rectangle is a square, and that a rectangle with given area has
least perimeter when the rectangle is a square. Likewise, using the AGM Inequality
(Theorem 2.10), a box (even in n dimensions) with given surface area has greatest
volume when the box is a cube, and a box (even in n dimensions) with given volume
has least surface area when the box is a cube.
Example 2.13. Named for Heron of Alexandria (c. 1070 AD), Herons formula
gives the area T of a triangle in terms of its three side lengths a; b; c and
perimeter P; as follows:
So if we apply the AGM Inequality (Theorem 2.10) to the three numbers P 2a;
P 2b and P 2c, we obtain
3
.P 2a/ C .P 2b/ C .P 2c/
16T P
2
; or
3
P2
T p :
12 3
Therefore, for a triangle with fixed perimeter P , its area T is largest possible when
P 2a D P 2b D P 2c: This is precisely when a D b D c, that is, when the
triangle is equilateral. Likewise a triangle with fixed area T phas least perimeter P
when it is an equilateral triangle. In either case, T D P 2 =.12 3/:
Remarkp2.14. We saw in Example 2.13 that for a triangle, we have T
P 2 =.12 3/: In Example 2.9, we saw that for a rectangle, T P 2 =16: This
latter inequality persists for all quadrilaterals having area T and perimeter P:
See Exercise 2.29. These inequalities are called isoperimetric inequalities. The
isoperimetric inequality for an n-sided polygon is
P2
T ;
4n tan .=n/
32 2 Famous Inequalities
and equality holds if and only if the polygon is regular. The isoperimetric inequality
for any plane figure with area T and perimeter P is
P2
T :
4
The famous isoperimetric problem was to prove that equality holds here if and
only if the plane figure is a circle. The solution of the isoperimetric problem takes
up an important and interesting episode in the history of mathematics [37]. For a
polished modern solution, see [25]. The reader might find it somewhat comforting
that
h
i
lim n tan D :
n!1 n
This can be verified quite easily (see Exercise 5.46) using LHospitals Rule, which
we meet in Sect. 5.3.
Example 2.15. [26] We show that Bernoullis Inequality (Lemma 2.1)
.1 C x/n 1 C nx
for x > 1 and n D 1; 2; 3; : : : follows from the AGM Inequality (Theorem 2.10).
First, if 1 < x 1=n; then 1 C nx 0 < 1 C x; and so 1 C nx < .1 C x/n :
Therefore we assume that x > 1=n. We write
1 C nx C .n 1/ 1 C nx C 1 C 1 C C 1
1Cx D D ;
n n
where there are n 1 1s to the right of nx in the second numerator. Then applying
the AGM Inequality (Theorem 2.10) to the n positive numbers 1 C nx; 1; 1; : : : ; 1 ,
we get
1 C nx C 1 C 1 C C 1 n
.1 C x/n D .1 C nx/.1/.1/ .1/ D 1 C nx;
n
as desired.
Conversely, it happens that the AGM Inequality (Theorem 2.10) follows from
Bernoullis Inequality (Lemma 2.1), and so the two are equivalent. We leave the
verification of this for Exercise 2.10.
Example 2.16. For n positive numbers a1 ; a2 ; : : : ; an , their Harmonic Mean is
given by
1=a1 C 1=a2 C C 1=an 1
H D :
n
Replacing aj with 1=aj in the AGM Inequality (Theorem 2.10) we get
H G:
2.2 The AGM Inequality 33
X
n X n
1
aj n2 : (2.2)
j D1 j D1
aj
2ab
H D :
aCb
.a1 a2 a3 a4 a5 a6 a7 a8 /1=8
1=2
1=2
D .a1 a2 a3 a4 /1=4 .a5 a6 a7 a8 /1=4
1=2 1=2
1 1
.a1 C a2 C a3 C a4 / .a5 C a6 C a7 C a8 /
4 4
34 2 Famous Inequalities
1 1 1
.a1 C a2 C a3 C a4 / C .a5 C a6 C a7 C a8 /
2 4 4
1
D .a1 C a2 C a3 C a4 C a5 C a6 C a7 C a8 / :
8
Clearly we could continue this procedure indefinitely, and so we may assume that
we have proved that G A for any n of the form n D 2m : For any (other) n; we
choose m so large that 2m > n: Now,
a1 C a2 C C an C .2m n/A
D A:
2m
The numerator of the left-hand side here has 2m members in the sum and so we can
apply what we have proved so far to see that
1=2m
a1 a2 an A.2 n/
m
A:
That is,
m n m
a1 a2 an A2 A2 ) G n An :
t
u
Remark 2.17. Extending Lemma 2.7 to n D 4; 8; 16; : : : as above is not too hard,
just a bit messy. Cauchys genius lies in being able to extending the result to
any n: With this in mind we mention that T. Harriet proved the AGM Inequality
(Theorem 2.10) for n D 3 around 1,600 [39]. No small feat for the time.
P
n P
n
Proof. If aj2 D 0 or bj2 D 0 then the inequality holds, with equality.
j D1 j D1
aj2 bj2
Otherwise, we set aj D P
n and bj D P
n in Lemma 2.7 to obtain
ak2 bk2
kD1 kD1
0 1
aj bj 1B a2
B j C
bj2 C
C:
s s
P
n P
n 2@Pn
2
P
n
2
A
ak2 bk2 ak bk
kD1 kD1
kD1 kD1
For example, suppose that three squares with side lengths a1 ; a2 and a3 have
average area T . Then the single square with area T is the one with side length R.
The reader should verify that R is a mean. We have seen that G A. The
CauchySchwarz Inequality (Theorem 2.18) shows that A R, on taking
b1 D b2 D D bn D 1=n.
Remark 2.20. Readers who know some linear algebra might recognize the
CauchySchwarz Inequality in the following form. For two vectors u D
.a1 ; a2 ; : : : ; an / and v D .b1 ; b2 ; : : : ; bn / in Rn ; their dot product is given by
P n p
uvD aj bj , and the length of u is given by kuk D u u . Then the Cauchy
j D1
Schwarz Inequality reads
ju vj kuk kvk :
(See [48], for example, for a proof of the CauchySchwarz Inequality in this
context.) This says that for non-zero vectors u and v we have
36 2 Famous Inequalities
uv
1 1;
kuk kvk
Moreover,
ku C vk kuk C kvk :
There are many other proofs of the CauchySchwarz Inequality, a few of which
we explore in the exercises. However, we would be remiss if we did not supply what
is essentially H. Schwarzs (18431921) own ingenious proof, as follows. (See also
Exercises 2.38 and 2.41.) For any real number t ,
X
n
.t aj C bj /2 0:
j D1
That is,
X
n X
n X
n
t2 aj2 C 2t aj bj C bj2 0:
j D1 j D1 j D1
Exercises 37
Now the left-hand side is a quadratic in the variable t and since it is 0, it must have
either no real root or one real root. (It cannot have two distinct real roots.) Therefore
its discriminant B 2 4AC must be 0: That is,
0 12
X
n X
n X
n
@2 aj bj A 4 aj2 bj2 0:
j D1 j D1 j D1
Exercises
2.1. Show that for x > 0; the sequence x 1=n converges to 1:
1=n
Hint: Write x 1=n D 1 C n x1
n
.
2.2. Show that Bernoullis Inequality (Lemma 2.1), implies Lemma 2.7:
p aCb
ab :
2
Hint: Assume that a A D .a C b/=2, take n D 2, and x D A=a 1.
2.3. [35] Show that Bernoullis Inequality (Lemma 2.1), holds also for x 2
2; 1.
2.4. (a) Write 0:237 and 6:457132 as fractions. (b) Describe how to write any
repeating decimal as a fraction.
x 1Dn1=n
2
2.5. [2] Take in Bernoullis Inequality (Lemma 2.1) to show that the
sequence 1 C n is increasing.
nC1
2.6. Show that 1 C n1 is decreasing, as follows.
(a) Verify that
.1 C 1 nC2
nC1
/
nC1
D 1C 1
1 1
.nC1/2
:
.1 C n/
1 nC1 nC1
2.7. [47] Find the least positive integer N such that for all n > N ,
n nC1
nnC1 nnC1
< n < :
.n C 1/n .n C 1/n
38 2 Famous Inequalities
u uC1
2.8. (e.g., [24, 34, 52, 54]) Show that x D 1 C 1u and y D 1 C 1u (and vice-
versa) are solutions to the equation x y D y x , for x; y > 0. (Taking u D 1; 2; 3; : : :
in fact yields all nontrivial (i.e., x y) rational solutions to this equation.)
2.9. [28] Denote by bxc the greatest integer not exceeding x: This function is often
called the Floor function. Prove that for x 1,
bxC1c
x bxc x
1C 2 1C
x
:
bxc bx C 1c
2.10. [26] In Example 2.15 we showed that the AGM Inequality implies Bernoullis
Inequality. Show that Bernoullis Inequality implies the AGM Inequality.
2.11. Explain how the inequality .a C b/2 4ab D .a b/2 0 in the proof of
Lemma 2.7 relates to Fig. 2.3.
ab
a
b a
ex C ex
cosh.x/ D 1;
2
with equality if and only if x D 0:
(c) [31] Show that for x > 0,
xn 1
:
1 C x C x 2 C C x 2n 2n C 1
m
E F
A b B
2.15. [51] The bank in your town sells British pounds at the rate 1 D $S and buys
them at the rate 1 D $B. You and your friend want to exchange dollars and pounds
betweenp the two of you, at a rate that is fair to both. Show that the fair exchange rate
is 1 D SB; the Geometric Mean of S and B:
2.16. [13] Let H G A denote respectively the Harmonic, Geometric and
Arithmetic Means of two positive numbers.
(a) Show that H; G; and A are the side lengths of a triangle if and only if
p p
3 5 A 3C 5
< < :
2 H 2
(b) Show that H; G; and A are the side lengths of a right triangle if and only if
A=H is the golden mean:
p
A 1C 5
D :
H 2
2.17. [56]
P
n
n.nC1/
(a) Prove that for any natural number n, we have kD 2
:
kD1
40 2 Famous Inequalities
n
(b) For n D 1; it is clear that n D nC1 2
: Use (a) and the AGM Inequality
(Theorem 2.10) to prove that for integers n 2,
nC1 n
n < 2
:
1
(a) For such a; b; show that ab 4:
(b) Use Lemma 2.7 to show that .aC1=a/2 C .bC1=b/2 2 .aC1=a/ .b C 1=b/ :
(c) Combine (a) and (b) to show that
2 2 2 2
1 1 1 1 1 1
aC C bC 2 a C bC .1C4/2 a C bC :
a b a b a b
A H
G
a b
2.20. (a) Suppose that a car travels at a miles per hour from point A to point B,
then returns at b miles per hour. Show that the average speed for the trip is the
Harmonic Mean of a and b.
(b) Show that G H < A G; where H; G and A the Harmonic, Geometric, and
Arithmetic Means of two numbers a; b > 0.
(c) For a; b > 0, Herons Mean, named for Heron of Alexandria (c. 1070 AD), is
p
aC ab C b
HO D :
3
Show that if a b, then G < HO < A; where G and A are the Geometric and
Arithmetic means of a and b.
Exercises 41
X
n X n
1
aj n2 :
j D1 j D1
aj
Apply this to the three numbers aCb, aCc; and bCc to obtain Nesbitts Inequality:
a b c 3
C C :
bCc aCc aCb 2
2 C 4 C 6 C C .2n/
lim D e:
n!1 1 C 3 C 5 C C .2n 1/
2.25. [30]
(a) In
n Example 2.6 we used Bernoullis Inequality (Lemma 2.1) to show that
n o
1 C n1 is an increasing sequence. Show this using the AGM Inequality
(Theorem 2.10). Hint: Consider the n C 1 numbers 1; nC1 ; nC1 ; : : : ; nC1 .
n o n n n
1 nC1
(b) Show that 1 C n is a decreasing sequence using the AGM Inequality
(Theorem 2.10). Hint: Consider the n C 2 numbers 1; nC1 n n
; nC1 n
; : : : ; nC1 , apply
the AGM Inequality, then take reciprocals. n n o
(c) Use the AGM Inequality (Theorem 2.10) to show that 1 n1 is a
decreasing sequence (for n D 2; 3; : : :).
Hint: Consider the n C 1 numbers 1; 1 n1 ; 1 n1 ; : : : ; 1 n1 :
42 2 Famous Inequalities
Note: Many variations of Exercise 2.25 have been discovered and rediscovered
over the years (e.g., [15, 22, 27, 2931, 41, 57]). Other approaches can be found in
[3, 17, 42, 44].
2.26. [59] Apply the AGM Inequality (Theorem 2.10) to the n C k numbers
1 1 1 k1 k1 k1
1C ; 1C ; ; 1 C ; ; ; ;
n n n k k k
to show that
k
1 n k
1C < :
n k1
where is half of the sum of any pair of opposite angles. If the quadrilateral can
be inscribed in a circle then elementary geometry shows that D =2 and we get
Brahmaguptas formula
p
A D .s a/.s b/.s c/.s d /:
(And if d D 0 then the quadrilateral is in fact a triangle and we get Herons formula.)
Show that among all quadrilaterals with a given perimeter, the square has the largest
area.
Exercises 43
2.30. In our proof (that is, K.M. Chongs) of the AGM Inequality (Theorem 2.10)
we focused on A and used the inequality (2.1). Fill in the details of the following
proof, which focuses instead on G.
(a) Show (assuming again a1 a2 an ) that
a1 an
a1 C an G :
G
(b) Use this to prove the AGM Inequality.
2.31. Fill in the details of H. Dorries beautiful 1921 proof of the AGM Inequality
(Theorem 2.10), as follows. (This proof was rediscovered by P.P. Korovkin in 1952
[22] and again by G. Ehlers in 1954 [5].) Lemma 2.7 is the case n D 2; so we
proceed by induction, assuming that the result is true for n 1 numbers. What we
Pn
want to show is that aj nG:
j D1
Q
n
(a) Argue that since G n D aj ; at least one aj must be G; and some other aj
j D1
must be G: So we may assume that a1 G and a2 G:
(b) Show that a1 G and a2 G imply that
a1 a2 X
n
a1 a2 X
n
a1 C a2 G C ; and so aj G C C aj :
G j D1
G j D3
Hint: Consider the left-hand side divided by the right-hand side, apply the AGM
Inequality (Theorem 2.10), then tidy up.
2.33. [11] Let A; B and C be the interior angles of a triangle. Show that
p
3 3
sin.A/ C sin.B/ C sin.C / :
2
Hint:
A C B C C D ) sin.A/ C sin.B/ C sin.C / D 4 cos.A=2/ cos.B=2/ cos.C =2/:
2.34. [6] Prove that
p
p p
p p
n
3 n
21 6 2 : : : nC1 .n C 1/ n < :
.n C 1/n
44 2 Famous Inequalities
2.35. Analyze Cauchys proof of the AGM Inequality (Theorem 2.10) given at the
end of Sect. 2.2 to obtain necessary and sufficient conditions for equality.
2.36. In Cauchys proof of the AGM Inequality (Theorem 2.10) given at the end of
Sect. 2.2, we focused on A and had (for 2m > n):
a1 C a2 C C an C .2m n/A
AD :
2m
Then we applied the result for the 2m case. For a proof which focuses instead on G,
verify (for 2m > n) that
m m n
G 2 D a1 a2 an G 2 ;
t 2 1
ab a C b2 :
2 2t
p
(c) Now write aj bj D taj p1 t bj then sum from j D 1 to n to get
X
n
t X 2
n
1 X 2
n
aj bj aj C b :
j D1
2 j D1 2t j D1 j
Exercises 45
P
n P
n
then simplify. (This is the t at which t
2
aj2 C 2t1 bj2 attains its minimum.)
j D1 j D1
j D1
aj bj
1 X n
B s aj bj C
s
P
n
s
P
n
D1 @ P n
s
P
n A :
aj2 bj2 2 j D1 aj2 bj2
j D1 j D1 j D1 j D1
2.42. Fill in the details of the following (ostensibly) different proof of the Cauchy
Schwarz Inequality (Theorem 2.18).
(a) Replace a with a2 and b with b 2 in Lemma 2.7 to get ab 12 a2 C 12 b 2 :
(b) Dispense with the cases a1 D a2 D D an D 0 or b1 D b2 D D bn D 0:
!1=2 !1=2
Pn Pn
(c) Set a D aj aj2 and b D bj bj2 in (a), then sum from 1
j D1 j D1
to n:
2.43. Find necessary and sufficient conditions for equality to hold in the Cauchy
Schwarz Inequality (Theorem 2.18).
2.44. [33] Let a1 ; a2 ; : : : ; an be positive real numbers and let r n be a positive
integer. Set
1X 1X 1X
r n n
A1 D aj ; AD aj ; and 2 D .aj A/2 :
r j D1 n j D1 n j D1
1X 1X
n n
AD aj ; and BD bj ;
n j D1 n j D1
Clearly the CauchySchwarz Inequality (Theorem 2.18) implies that jj 1: Show
that jj 1 implies the CauchySchwarz Inequality. (For readers who know a little
linear algebra, [21] contains a neat relationship between and something called the
Gram determinant.)
2.48. [1, 50]
(a) Show that for x1 ; x2 ; : : : ; xn 2 R and y1 ; y2 ; : : : ; yn > 0 ,
.x1 C x2 C C xn /2 x2 x2 x2
1 C 2 C C n:
y1 C y2 C C yn y1 y2 yn
a b c 3
C C :
bCc aCc aCb 2
a4 C b 4 18 .a4 C b 4 /:
Exercises 47
then
p p p
a cos2 .x/ C b sin2 .x/ < c:
2.50. [20] We saw in Remark 2.14 that the isoperimetric inequality for an n-sided
polygon with area T and perimeter P is
P2
T :
4n tan .=n/
X
n
aj2 4T tan .=n/ :
j D1
P
n
2.51. Let a1 ; a2 ; : : : ; an ; and b1 ; b2 ; : : : ; bn be real numbers, with bj D 0: Show
j D1
that
0 12 0 0 12 1
X
n
B X
n X
n
CX 2
n
@ aj bj A @ aj2 @ aj A A bj :
j D1 j D1 j D1 j D1
P
n P
n
aj2 bj2 r r !
j D1 j D1 1 AB ab
!2 C :
P
n 4 ab AB
aj bj
j D1
48 2 Famous Inequalities
a bj
(a) Verify that bjj Ba aj
A
b
0:
(b) Use this to verify that
aA 2 a A
aj2 C b C aj bj :
bB j B b
(c) Write
0 11=2 0 11=2 r 0 11=2 0 11=2
X
n X
n
Bb @ X
n Xn
Aa 2 A
@ aj2 A @ bj2 A D a2 A @ bj ;
j D1 j D1
Aa j D1 j j D1
Bb
then use Lemma 2.7 and (b) to obtain the desired result.
2.53. Use the CauchySchwarz Inequality (Theorem 2.18) to prove Minkowskis
Inequality: Let a1 ; : : : ; an ; b1 ; : : : ; bn 2 R. Then
0 11=2 0 11=2 0 11=2
X
n
2 X
n X
n
@ aj C bj A @ aj2 A C@ bj2 A :
j D1 j D1 j D1
1X 1X 1X
n n n
aj bj aj bj :
n j D1 n j D1 n j D1
And the inequality is reversed if the sequences have opposite monotonicity. Fill in
the details of the following proof of Chebyshevs Inequality, for the aj0 s and bj0 s
P
n
both increasing. (The other case is handled similarly.) First, let A D n1 aj :
j D1
a1 a2 ak A akC1 an :
and therefore
1 X
n
aj A .bj bk / 0:
n j D1
(c) Expand then simplify the sum on the left hand side in (b).
2.55. [45] (If you did Exercise 2.54.) (a) Use Chebyshevs Inequality to prove that
for 0 a1 a2 an and n 1,
0 1n
1 X n
1X n
n
@ aj A a :
n j D1 n j D1 j
2.56. [40] (If you did Exercise 2.54.) Use Chebyshevs Inequality and the AGM
Inequality (Theorem 2.10) to prove that for 0 < a1 a2 an ;
X
n X
n
ajnC1 a1 a2 an aj :
j D1 j D1
P
n
2.57. For a1 ; a2 ; : : : ; an 2 R; their variance is the number 2 D 1
n
.aj A/2 ;
j D1
P
n
where A D 1
n
aj is their Arithmetic Mean. Suppose that m aj M for
j D1
all j .
(a) Verify that
1X 1X
n n
.aj A/2 D .M A/ .A m/ .M aj /.aj m/;
n j D1 n j D1
P
n
in order to conclude that 1
n
.aj A/2 .M A/ .A m/. (This inequality
j D1
was obtained differently, and generalized considerably, in [4].)
(b) Show that this inequality is better than, that is, is a refinement of Popovicius
Inequality:
1X
n
1
.aj A/2 .M m/2 :
n j D1 4
2.58. [32]
(a) Extend Exercise 2.57 to prove Grsss Inequality: Let a1 ; a2 ; : : : ; an ; and
b1 ; b2 ; : : : ; bn be real numbers, with m aj M and bj : Then
n
1 X 1 X n
1 X n
1
a b a b
j .M m/. /:
n j j
n j D1
j
n j D1 4
j D1
P
n P
n
Hint: Let A D 1
n
aj ; B D 1
n
bj and begin by applying the Cauchy
j D1 j D1
Schwarz Inequality (Theorem 2.18) to
0 12
1 X n
@ .aj A/.bj B/A :
n j D1
(b) Show by providing an example (take aj D bj for simplicity) that the constant
1=4 in Grsss Inequality cannot be replaced by any smaller number. That is,
the 1=4 is sharp.
References
18. Hardy, G.H., Littlewood, J.E., Polya, G.: Inequalities. Cambridge University Press,
Cambridge/New York (1967)
19. Hoehn, L.: A geometrical interpretation of the weighted mean. Coll. Math. J. 15, 135139
(1984)
20. Just, W., Schaumberger, N., Marsh, D.C.B.: Problem E1634. Am. Math. Mon. 71, 796 (1964)
21. Kass, S.: An eigenvalue characterization of the correlation coefficient. Am. Math. Mon. 96,
910911 (1989)
22. Korovkin, P.P.: Inequalities. Pergamon Press, Oxford (1961) (Originally published as Neraven-
stva, Gostekhizdat, Moscow, 1952.)
23. Kundert, K.R.: Correlation a vector approach. Coll. Math. J. 11, 52 (1980)
24. Kupitz, Y.S., Martini, H.: On the equation x y D y x : Elem. Math. 55, 95101 (2000)
25. Lax, P.D.: A short path to the shortest path. Am. Math. Mon. 102, 158159 (1995)
26. Maligranda, L.: The AM-GM inequality is equivalent to the Bernoulli inequality. Math. Intell.
35, 12 (2012)
27. Mahmoud. M., Edwards, P.: Some inequalities and sequences converging to e: Int. J. Math. Ed.
Sci. Tech. 30, 430434 (1999)
28. Marjanovic, M., Spital, S.: Problem E1950. Am. Math. Mon. 75, 543544 (1968)
29. Melzak, Z.A.: On the exponential function. Am. Math. Mon. 82, 842844 (1975)
30. Mendelsohn, N.S.: An application of a famous inequality. Am. Math. Mon. 58, 563 (1951)
31. Mitrinovic, D.S: Elementary Inequalities. P. Noordhoff, Groningen (1964)
32. Mitrinovic, D.S.: Analytic Inequalities. Springer, Berlin/New York (1970)
33. Murty, V.N., Dana, J.L: Problem 224. Coll. Math. J. 15, 7374 (1984)
34. Nakhli, F.: A transcendental sequence and a problem on commutativity of exponentiation of
real numbers. Math. Mag. 62, 185190 (1980)
35. Persky, R.L.: Extending Bernoullis inequality. Coll. Math. J. 25, 230 (1994)
36. Poly, G., Szego, G.: Problems and Theorems in Analysis I. Springer, Berlin/Heidelberg/New
York (2004)
37. Rademacher, H., Toeplitz, O.: The Enjoyment of Math. Princeton Univ Press, Princeton (1966)
38. Rose, D.: The Pearson and Cauchy-Schwarz inequalities. Coll. Math. J. 39, 64 (2008)
39. Roy, R.: Sources in the Development of Mathematics. Cambridge University Press,
Cambridge/New York (2011)
40. Sadoveanu, I., Vowe, M., Wagner, R.J.: Problem 458. Coll. Math. J. 23, 344345 (1992)
41. Sndor, J.: Monotonic convergence to e via the arithmetic-geometric mean. Math. Mag. 80,
228229 (2007)
42. Schaumberger, N.: Another application of the mean value theorem. Coll. Math. J. 10, 114115
(1979)
43. Schaumberger, N.: Another look at x 1=x . Coll. Math. J. 15, 249250 (1984)
44. Schaumberger, N.: Alternate approaches to two familiar results. Coll. Math. J. 15, 422423
(1984)
45. Schaumberger, N.: Another proof of Chebyshevs inequality. Coll. Math. J. 20, 141142 (1989)
46. Schaumberger, N., Eberhart, H.O.: Problem 134. Coll. Math. J. 11, 212213 (1980)
47. Schaumberger, N., Johnsonbaugh, R.: Problem 70. Coll. Math. J. 8, 295 (1977)
48. Slay, J.C., Solomon, J.L.: A note on the Cauchy-Schwarz inequality. Coll. Math. J. 10, 280281
(1979)
49. Steele, J.M: The Cauchy-Schwarz Master Class. Mathematical Association of
America/Cambridge University Press, Washington DC Cambridge/New York (2004)
50. Steele, J.M.: (2014) http://www-stat.wharton.upenn.edu/~steele
51. Schwenk, A.J.: Selection of a fair currency exchange rate. Coll. Math. J. 13, 154155 (1982)
52. Sved, M.: On the rational solutions of x y D y x : Math. Mag. 63, 3033 (1990)
53. Szsz, P.: Math Bite. Math. Mag. 68, 97 (1995)
54. Weaver, C.S.: Rational solutions of x y D y x . In: Page, W. (ed.) Two-Year College
Mathematics Readings, pp. 115117. Mathematical Association of America, Washington DC
(1981)
55. Wiener, J.: Bernoullis inequality and the number e. Coll. Math. J. 16, 399400 (1985)
52 2 Famous Inequalities
56. Wilker, J.B.: Stirling ideas for freshman calculus. Math. Mag. 57, 209214 (1984)
57. Yang, H., Yang, H.: The arithmetic-geometric mean inequality and the constant e: Math. Mag.
74, 321323 (2001)
58. Yi, H., Anderson, K.F.: Problem 11430. Am. Math. Mon. 118, 88 (2011)
59. Young, R.M.: Another quick proof that e < 3. Math. Gaz. 97, 333334 (2013)
http://www.springer.com/978-1-4939-1925-3