Minkowski's inequality
   HOME

TheInfoList



OR:

In
mathematical analysis Analysis is the branch of mathematics dealing with continuous functions, limits, and related theories, such as differentiation, integration, measure, infinite sequences, series, and analytic functions. These theories are usually studied ...
, the Minkowski inequality establishes that the L''p'' spaces are
normed vector space In mathematics, a normed vector space or normed space is a vector space over the real or complex numbers, on which a norm is defined. A norm is the formalization and the generalization to real vector spaces of the intuitive notion of "length ...
s. Let ''S'' be a
measure space A measure space is a basic object of measure theory, a branch of mathematics that studies generalized notions of volumes. It contains an underlying set, the subsets of this set that are feasible for measuring (the -algebra) and the method that ...
, let and let ''f'' and ''g'' be elements of L''p''(''S''). Then is in L''p''(''S''), and we have the
triangle inequality In mathematics, the triangle inequality states that for any triangle, the sum of the lengths of any two sides must be greater than or equal to the length of the remaining side. This statement permits the inclusion of degenerate triangles, but ...
:\, f+g\, _p \le \, f\, _p + \, g\, _p with equality for if and only if ''f'' and ''g'' are positively
linearly dependent In the theory of vector spaces, a set of vectors is said to be if there is a nontrivial linear combination of the vectors that equals the zero vector. If no such linear combination exists, then the vectors are said to be . These concepts are ...
, i.e., for some or . Here, the norm is given by: :\, f\, _p = \left( \int , f, ^p d\mu \right)^ if ''p'' < ∞, or in the case ''p'' = ∞ by the
essential supremum In mathematics, the concepts of essential infimum and essential supremum are related to the notions of infimum and supremum, but adapted to measure theory and functional analysis, where one often deals with statements that are not valid for ''all' ...
:\, f\, _\infty = \operatorname_, f(x), . The Minkowski inequality is the triangle inequality in L''p''(''S''). In fact, it is a special case of the more general fact :\, f\, _p = \sup_ \int , fg, d\mu, \qquad \tfrac + \tfrac = 1 where it is easy to see that the right-hand side satisfies the triangular inequality. Like Hölder's inequality, the Minkowski inequality can be specialized to sequences and vectors by using the
counting measure In mathematics, specifically measure theory, the counting measure is an intuitive way to put a measure on any set – the "size" of a subset is taken to be the number of elements in the subset if the subset has finitely many elements, and infinity ...
: :\biggl( \sum_^n , x_k + y_k, ^p \biggr)^ \le \biggl( \sum_^n , x_k, ^p \biggr)^ + \biggl( \sum_^n , y_k, ^p \biggr)^ for all
real Real may refer to: Currencies * Brazilian real (R$) * Central American Republic real * Mexican real * Portuguese real * Spanish real * Spanish colonial real Music Albums * ''Real'' (L'Arc-en-Ciel album) (2000) * ''Real'' (Bright album) (2010) ...
(or
complex Complex commonly refers to: * Complexity, the behaviour of a system whose components interact in multiple ways so possible interactions are difficult to describe ** Complex system, a system composed of many components which may interact with each ...
) numbers ''x''1, ..., ''x''''n'', ''y''1, ..., ''y''''n'' and where ''n'' is the
cardinality In mathematics, the cardinality of a set is a measure of the number of elements of the set. For example, the set A = \ contains 3 elements, and therefore A has a cardinality of 3. Beginning in the late 19th century, this concept was generalized ...
of ''S'' (the number of elements in ''S''). The inequality is named after the German mathematician
Hermann Minkowski Hermann Minkowski (; ; 22 June 1864 – 12 January 1909) was a German mathematician and professor at Königsberg, Zürich and Göttingen. He created and developed the geometry of numbers and used geometrical methods to solve problems in number t ...
.


Proof

First, we prove that ''f''+''g'' has finite ''p''-norm if ''f'' and ''g'' both do, which follows by :, f + g, ^p \le 2^(, f, ^p + , g, ^p). Indeed, here we use the fact that h(x)=, x, ^p is
convex Convex or convexity may refer to: Science and technology * Convex lens, in optics Mathematics * Convex set, containing the whole line segment that joins points ** Convex polygon, a polygon which encloses a convex set of points ** Convex polytop ...
over (for ) and so, by the definition of convexity, :\left, \tfrac f + \tfrac g\^p\le\left, \tfrac , f, + \tfrac , g, \^p \le \tfrac, f, ^p + \tfrac , g, ^p. This means that :, f+g, ^p \le \tfrac, 2f, ^p + \tfrac, 2g, ^p=2^, f, ^p + 2^, g, ^p. Now, we can legitimately talk about \, f + g\, _p. If it is zero, then Minkowski's inequality holds. We now assume that \, f + g\, _p is not zero. Using the triangle inequality and then Hölder's inequality, we find that :\begin \, f + g\, _p^p &= \int , f + g, ^p \, \mathrm\mu \\ &= \int , f + g, \cdot , f + g, ^ \, \mathrm\mu \\ &\le \int (, f, + , g, ), f + g, ^ \, \mathrm\mu \\ &=\int , f, , f + g, ^ \, \mathrm\mu+\int , g, , f + g, ^ \, \mathrm\mu \\ &\le \left( \left(\int , f, ^p \, \mathrm\mu\right)^ + \left (\int , g, ^p \,\mathrm\mu\right)^ \right) \left(\int , f + g, ^ \, \mathrm\mu \right)^ && \text \\ &= \left (\, f\, _p + \, g\, _p \right )\frac \end We obtain Minkowski's inequality by multiplying both sides by :\frac.


Minkowski's integral inequality

Suppose that and are two ''σ''-finite measure spaces and is measurable. Then Minkowski's integral inequality is , : : \left \int_F(x,y)\, \mu_1(\mathrmx)\^p \mu_2(\mathrmy)\right \le \int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx), with obvious modifications in the case . If , and both sides are finite, then equality holds only if a.e. for some non-negative measurable functions ''φ'' and ''ψ''. If μ1 is the counting measure on a two-point set then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting for , the integral inequality gives :\, f_1 + f_2\, _p = \left(\int_\left, \int_F(x,y)\,\mu_1(\mathrmx)\^p\mu_2(\mathrmy)\right)^ \le\int_\left(\int_, F(x,y), ^p\,\mu_2(\mathrmy)\right)^\mu_1(\mathrmx)=\, f_1\, _p + \, f_2\, _p. This notation has been generalized to :\, f\, _ = \left(\int_ \left f(x,y), ^q\mathrmy\right \mathrmx \right)^ for f:\mathbb^\to E, with \mathcal_(\mathbb^,E) = \. Using this notation, manipulation of the exponents reveals that, if p>q, then \, f\, _\leq\, f\, _.


Reverse inequality

When p< 1 the reverse inequality holds: :\, f+g\, _p \ge \, f\, _p + \, g\, _p We further need the restriction that both f and g are non-negative, as we can see from the example f=-1, g=1 and p=1: \, f+g\, _1 = 0 < 2 = \, f\, _1 + \, g\, _1. The reverse inequality follows from the same argument as the standard Minkowski, but uses that Holder's inequality is also reversed in this range. Using the Reverse Minkowski, we may prove that power means with p\le 1, such as the
Harmonic Mean In mathematics, the harmonic mean is one of several kinds of average, and in particular, one of the Pythagorean means. It is sometimes appropriate for situations when the average rate is desired. The harmonic mean can be expressed as the recipro ...
and the
Geometric Mean In mathematics, the geometric mean is a mean or average which indicates a central tendency of a set of numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometric mean is defined as the ...
are concave.


Generalizations to other functions

The Minkowski inequality can be generalized to other functions \phi(x) beyond the power function x^. The generalized inequality has the form :\phi^(\sum_^ \phi(x_+y_)) \leq \phi^(\sum_^ \phi(x_))+\phi^(\sum_^ \phi(y_)) Various sufficient conditions on \phi have been found by Mulholland and others. For example, for x\geq 0 one set of sufficient conditions from Mulholland is # \phi(x) is continuous and strictly increasing with \phi(0)=0 . #\phi(x) is a convex function of x . #\log\phi(x) is a convex function of \log(x) .


See also

*
Cauchy–Schwarz inequality The Cauchy–Schwarz inequality (also called Cauchy–Bunyakovsky–Schwarz inequality) is considered one of the most important and widely used inequalities in mathematics. The inequality for sums was published by . The corresponding inequality f ...
* Mahler's inequality * Hölder's inequality


References

* * . * . * *


Further reading

* {{Measure theory Inequalities Articles containing proofs Measure theory