Minkowski inequality
From Wikipedia, the free encyclopedia
In mathematical analysis, the Minkowski inequality establishes that the Lp spaces are normed vector spaces. Let S be a measure space, let 1 ≤ p ≤ ∞ and let f and g be elements of Lp(S). Then f + g is in Lp(S), and we have
with equality for 1 < p < ∞ if and only if f and g are positively linearly dependent (which means f = λ g or g = λ f for some λ ≥ 0).
The Minkowski inequality is the triangle inequality in Lp(S).
Like Hölder's inequality, the Minkowski inequality can be specialized to sequences and vectors by using the counting measure:
for all real (or complex) numbers x1, ..., xn, y1, ..., yn and where n is the cardinality of S (the number of elements in S).
[edit] Proof
First, we prove that f+g has finite p-norm if f and g both do, which follows by
Indeed, here we use the fact that h(x) = xp is convex over (for p greater than one) and so, if a and b are both positive then
This means that
Now, we can legitimately talk about . If it is zero, then Minkowski's inequality holds. We now assume that is not zero. Using Hölder's inequality
We obtain Minkowski's inequality by multiplying both sides by .
[edit] References
- Hardy, G. H. and Littlewood, J. E. and Pólya, G. (1988). Inequalities, Reprint of the 1952 edition, Cambridge Mathematical Library, Cambridge: Cambridge University Press, xii+324. ISBN 0-521-35880-9.
- H. Minkowski, Geometrie der Zahlen , Chelsea, reprint (1953)
- M.I. Voitsekhovskii (2001), “Minkowski inequality”, in Hazewinkel, Michiel, Encyclopaedia of Mathematics, Kluwer Academic Publishers, ISBN 978-1556080104