Professional Documents
Culture Documents
Minikowski Inequality
Minikowski Inequality
Minkowskis Inequality
)1/p
|ai + bi |p
( n
i=1
)1/p
|ai |p
( n
i=1
)1/p
|bi |p
i=1
To prove Minkowskis inequality, we need the following generalization of the CauchySchwartz inequality.
Lemma 2 (H
olders Inequality). Suppose that p, q > 1 satisfy 1/p + 1/q = 1. Then,
for ai , bi R, i = 1, . . . , n,
n
|ai bi |
( n
i=1
|ai |p
)1/p ( n
i=1
)1/q
|bi |q
i=1
< 0 if t < 1
= 0 if t = 1 .
(t)
> 0 if t > 1
Since (1) = 0, this gives the result.
Typeset by AMS-TEX
Step 2. Define
|ai |p
|bi |q
Ai = n
,
B
=
.
i
n
p
q
i=1 |ai |
i=1 |bi |
+
p
q
n
n
(with equality if and only if |ai |p /|bi |q = ( i=1 |ai |p ) / ( i=1 |bi |q ), a constant). Writing
this out fully, we get, for any i = 1, . . . , n,
|ai |
|bi |
1
|ai |p
1
|bi |q
+
.
n
n
n
1/p
1/q
n
p i=1 |ai |p
q i=1 |bi |q
(
|ai |p )
(
|bi |q )
1/p
1/q
Ai Bi
i=1
i=1
1/p
1/q
n
p q
( i=1 |ai |p ) ( i=1 |bi |q )
(with equality if and only if |ai |p /|bi |q is constant). This completes the proof of Holders
inequality.
Proof of Lemma 1. The case p = 1 is clear, so suppose p > 1 and define q > 1 by
1/p + 1/q = 1. We have that
n
n
p
|ai + bi | =
|ai + bi ||ai + bi |p1
i=1
i=1
|ai ||ai + bi |
i=1
( n
|ai |p
p1
)1/p ( n
i=1
i=1
)1/q
|ai + bi |(p1)q
( n
i=1
|bi |p
)1/p ( n
i=1
)1/q
|ai + bi |(p1)q
i=1
(
)1
1
(p 1)q = (p 1) 1
= p,
p
so we may rewrite the above inequality as
(
)1/p ( n
)1/p ( n
)1/q
n
n
p
p
p
p
|ai + bi |
|ai |
+
|bi |
|ai + bi |
.
i=1
i=1
i=1
i=1
n
1/q
Dividing by ( i=1 |ai + bi |p ) , we get
( n
)11/q ( n
)1/p ( n
)1/p
|ai + bi |p
|ai |p
+
|bi |p
.
i=1
i=1
i=1